Abstract.
We consider the problem of constructing continuous cryptographic primitives. We present several candidates for continuous hard-to-invert functions. To formulate these candidates, we introduce constructions based on tropical and supertropical circuits.
Received: 2011-06-18
Published Online: 2012-05-01
Published in Print: 2012-May
© 2012 by Walter de Gruyter Berlin Boston
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Masthead
- Two-party key establishment: From passive to active security without introducing new assumptions
- Continuous hard-to-invert functions and biometric authentication
- Existence, algorithms, and asymptotics of direct product decompositions, I
- Isomorphism in expanding families of indistinguishable groups
- Search and test algorithms for triple product property triples
- Evolutionary algorithm solution of the multiple conjugacy search problem in groups, and its applications to cryptography
- A Diffie–Hellman key exchange protocol using matrices over noncommutative rings
- No-leak authentication by the Sherlock Holmes method
Schlagwörter für diesen Artikel
Hard-to-invert functions;
authentication protocols;
tropical polynomials
Artikel in diesem Heft
- Masthead
- Two-party key establishment: From passive to active security without introducing new assumptions
- Continuous hard-to-invert functions and biometric authentication
- Existence, algorithms, and asymptotics of direct product decompositions, I
- Isomorphism in expanding families of indistinguishable groups
- Search and test algorithms for triple product property triples
- Evolutionary algorithm solution of the multiple conjugacy search problem in groups, and its applications to cryptography
- A Diffie–Hellman key exchange protocol using matrices over noncommutative rings
- No-leak authentication by the Sherlock Holmes method