An Interactive Identification Scheme Based on Discrete Logarithms and Factoring
- 1.5k Downloads
We describe a modification of an interactive identification scheme of Schnorr intended for use by smart cards. Schnorr’s original scheme had its security based on the difficulty of computing discrete logarithms. The modification that we present here will remain secure if either of two computational problems is infeasible, namely factoring a large integer and computing a discrete logarithm. For this enhanced security we require somewhat more communication and computational power, but the requirements remain quite modest, so that the scheme is well suited for use in smart cards.
KeywordsSmart Card Signature Scheme Discrete Logarithm Discrete Logarithm Problem Correct Output
- Yvo Desmedt, Claude Goutier, and Samy Bengio, “Special uses and abuses of the Fiat-Shamir passport protocol,” Advances in Cryptology (Proceedings of Crypto’ 87) Lecture Notes in Computer Science 293 (1988), 21–39.Google Scholar
- A. K. Lenstra, H. W. Lenstra, Jr., M. S. Manasse, and J. M. Pollard, “The Number Field Sieve”, Proceedings of the 22nd ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1990, 564–572.Google Scholar
- Arjen K. Lenstra and Mark S. Manasse, Factoring by Electronic Mail, Proceedings of Eurocrypt’ 89, Lecture Notes in Computer Science, to appear.Google Scholar
- C.P. Schnorr, Efficient Identification and Signatures for Smart Cards, Proceedings of Crypto’ 89, Lecture Notes in Computer Science, to appear.Google Scholar