Re: OpenSC at FOSDEM 2018

NdK <[email protected]> Tue, 9 Jan 2018 18:22:51 +0100
Newsgroups gmane.comp.encryption.opensc.devel
Message-ID <[email protected]>
Il 09/01/2018 17:53, Anders Rundgren ha scritto:

> Maybe "AI" will require a minor PKCS #11 update....
Not necessarily, if PKCS#11 allows for interactive key agreement
(multi-step DH)...
Tree Parity Machines (the simplest form of neural network) can exploit
the speed difference between simple learning and mutual learning to
converge to a common state faster than an attacker. The security margin
derives from information theory and does not require assumptions like
"this problem is difficult": the upper bound of what the attacker can
know is mathematically determined (too bad it's relatively high).
Actually TPMs' mutual learning is more practical than some PQC algorithms :)

BYtE,
 Diego


------------------------------------------------------------------------------
Check out the vibrant tech community on one of the world's most
engaging tech sites, Slashdot.org! http://sdm.link/slashdot