Can D.S.A. be improved? — Complexity trade-offs with the digital signature standard —

作者: David Naccache , David M'RaÏhi , Serge Vaudenay , Dan Raphaeli

DOI: 10.1007/BFB0053426

关键词:

摘要: … Institute of Standards and Technology to provide an appropriate core fur applications requiring digital signatures. Undoubtedly, many applications will include this standard in the future …

参考文章(8)
Ernest F. Brickell, Kevin S. McCurley, An interactive identification scheme based on discrete logarithms and factoring theory and application of cryptographic techniques. ,vol. 5, pp. 29- 39 ,(1992) , 10.1007/3-540-46877-3_6
Ernest F. Brickell, Daniel M. Gordon, Kevin S. McCurley, David B. Wilson, Fast exponentiation with precomputation theory and application of cryptographic techniques. pp. 200- 207 ,(1992) , 10.1007/3-540-47555-9_18
C. P. Schnorr, Efficient Identification and Signatures for Smart Cards international cryptology conference. pp. 239- 252 ,(1989) , 10.1007/0-387-34805-0_22
Louis C. Guillou, Jean-Jacques Quisquater, A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory theory and application of cryptographic techniques. pp. 123- 128 ,(1988) , 10.1007/3-540-45961-8_11
Peter L. Montgomery, Modular multiplication without trial division Mathematics of Computation. ,vol. 44, pp. 519- 521 ,(1985) , 10.1090/S0025-5718-1985-0777282-X
L. H. Harper, Stirling Behavior is Asymptotically Normal Annals of Mathematical Statistics. ,vol. 38, pp. 410- 414 ,(1967) , 10.1214/AOMS/1177698956
Taher ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms international cryptology conference. ,vol. 31, pp. 10- 18 ,(1985) , 10.1109/TIT.1985.1057074
James Hiram Morris, Lambda-calculus models of programming languages. Massachusetts Institute of Technology. ,(1969)