Abstract
At Crypto 93, Shamir proposed a family of signature schemes using algebraic bases. Coppersmith, Stern and Vaudenay presented an attack on one variant of the cryptosystem. Their attack does not recover the secret key. For one of the variants proposed by Shamir we show how to recover the secret key. Our attack is based on algebraic methods which are also applicable to many other instances of polynomial equations in the presence of some trapdoor condition.
Supported by DFG-Graduiertenkolleg “Mathematische Optimierung“. This work was done while the author was at the University of Frankfurt.
Chapter PDF
Similar content being viewed by others
References
D. Coppersmith: Private communication (1994).
D. Coppersmith, J. Stern and S. Vaudenay: Attacks on the Birational Permutation Signature Schemes. Proceedings of CRYPTO 93, Lecture Notes in Computer Science 773, 435–443 (1993).
N. Jacobson: Basic Algebra. W. H. Freeman and Company, San Francisco (1974).
B. Mishra: Algorithmic Algebra. Springer-Verlag, New York (1993).
D. Naccache: Can O.S.S. be Repaired ?-Proposal for a New Practical Signature Scheme. Proceedings of Eurocrypt 93, Lecture Notes in Computer Science 765, 233–239 (1993).
H. Ong, C. P. Schnorr, A. Shamir: A Fast Signature Scheme Based on Quadratic Equations. Proceedings 16th ACM Symposium on Theory of Computing, 208–216 (1984).
J. M. Pollard, C. P. Schnorr: An Efficient Solution to the Congruence x 2 + y 2 = m (mod n). IEEE Transactions on Information Theory, Vol. 33, 702–709 (1987).
A. Shamir: On the Generation of Multivariate Polynomials Which Are Hard To Factor. Proceedings 25th ACM Symposium on Theory of Computing, 796–804 (1993).
A. Shamir: Efficient Signature Schemes Based on Birational Permutations. Proceedings of CRYPTO 93, Lecture Notes in Computer Science 773, 1–12 (1993).
T. Theobald: Digitale Unterschriften mittels birationaler Permutationen. Diplomarbeit, Universität Frankfurt (1995).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Theobald, T. (1995). How to Break Shamir’s Asymmetric Basis. In: Coppersmith, D. (eds) Advances in Cryptology — CRYPT0’ 95. CRYPTO 1995. Lecture Notes in Computer Science, vol 963. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44750-4_11
Download citation
DOI: https://doi.org/10.1007/3-540-44750-4_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60221-7
Online ISBN: 978-3-540-44750-4
eBook Packages: Springer Book Archive