Generating standard DSA signatures without long inversion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1163, Issue , 1996, Pages 57-64

  Lenstra, Arjen K ^a  

^a Citibank NA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; NETWORK SECURITY; RANDOM NUMBER GENERATION;

DIGITAL SIGNATURE ALGORITHMS; DSA SIGNATURES; INTEGER MODULO; MEMORY BOUNDS; MODULAR INVERSE; MODULAR INVERSION; RANDOM NUMBERS;

CRYPTOGRAPHY;

EID: 84937396363     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0034835     Document Type: Conference Paper

References (16)

1. P. de Rooij, On the security of the Schnorr scheme using preprocessing, Advances in Cryptology, Eurocrypt'91, Lecture Notes in Comput. Sci. 547 (1991) 71-80.
2. P. de Rooij, On Schnorr's preprocessing for digital signature schemes, Advances in Cryptology, Eurocrypt'93, Lecture Notes in Comput. Sci. 765 (1994) 435-439.
3. O. Goldreich, L. A. Levin, Hard core bits for any one way function, 22nd Annual ACM symposium on theory of computing (1990); J. Symbolic Logic 58 (1993) 1102-1103.
4. B. Kaliski, Timing attacks on Cryptosystems, RSA Laboratories' Bulletin, Number 2, January 1996.
5. D. E. Knuth, The art of computer programming, volume 2, Seminumerical algorithms, second edition, Addison-Wesley, Reading, Massachusetts, 1981.
6. A. K. Lenstra, LIP, Long integer package, available by anonymous ftp from ftp. ox. ac. uk:/pub/math/freelip/freelip. l. 0. tar. gz.
7. J. Markoff, Secure digital transactions just got a little less secure, New York Times, December 11, 1995.
8. G. Marsaglia, Diehard randomness tests package, available by e-mail from the author (geo@stat. fsu. edu).
9. P. L. Montgomery, Modular multiplication without trial division, Math. Comp. 44 (1985) 519-521.
10. D. Naccache, D. M'Raïhi, D. Raphaeli, S. Vaudenay, Can D. S. A. be improved-complexity trade-offs with the digital signature standard, Preproceedings Euro-crypt'94 (1994) 85-101.
11. NIST, A proposed federal information processing standard for digital signature standard (DSS), Federal Register 56 (1991) 42980-42982.
12. S. Rajagopalan, R. Venkatesan, work in progress.
13. C. P. Schnorr, Efficient identification and signatures for smart cards, Advances in Cryptology, Crypto'89, Lecture Notes in Comput. Sci. 435 (1990) 239-251.
14. C. P. Schnorr, Efficient signature generation by smart cards, Journal of Cryptology 4 (1991) 161-174.
15. U. Vazirani, Randomness, adversaries and computations, Ph. D. thesis, UC Berkeley, 1986.
16. S.-M. Yen, C. Laih, A. K. Lenstra, A note on multi-exponentiation, IEE Proceedings, Computers and digital techniques 141 (1994).