pith. sign in

arxiv: cond-mat/0206213 · v1 · submitted 2002-06-12 · ❄️ cond-mat.dis-nn

A secure key-exchange protocol with an absence of injective functions

classification ❄️ cond-mat.dis-nn
keywords key-exchangeprotocolcryptographyfindfunctionsinjectivenetworksneural
0
0 comments X
read the original abstract

The security of neural cryptography is investigated. A key-exchange protocol over a public channel is studied where the parties exchanging secret messages use multilayer neural networks which are trained by their mutual output bits and synchronize to a time dependent secret key. The weights of the networks have integer values between $\pm L$. Recently an algorithm for an eavesdropper which could break the key was introduced by Shamir et al. [adi]. We show that the synchronization time increases with $L^2$ while the probability to find a successful attacker decreases exponentially with $L$. Hence for large $L$ we find a secure key-exchange protocol which depends neither on number theory nor on injective trapdoor functions used in conventional cryptography.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.