Attacking DSA under a repeated bits assumption

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

Volumn 3156, Issue , 2004, Pages 428-440

  Leadbitter, P J ^a   Page, D ^a   Smart, N P ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EMBEDDED SYSTEMS;

PARTIAL INFORMATION; PRIVATE KEY; SECOND ORDERS; SIGNATURE SCHEME;

CRYPTOGRAPHY;

EID: 33646756983     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28632-5_31     Document Type: Article

References (19)

1. M. Bellare and S. Goldwasser and D. Micciancio. "Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DSS Case. In Advances in Cryptology - EUROCRYPT '97, Springer-Verlag LKNCS 1233, 277-291, 1997.
2. D. Bleichenbacher. On the generation of DSS one-time keys. Preprint, 2001.
3. D. Boneh and D. Brumley. Remote Timing Attacks Are Practical. To appear in 12th USENIX Security Symposium, USENIX Press, 2003.
4. N. Howgrave-Graham and N.P. Smart. Lattice attacks on digital signature schemes. Designs, Codes and Cryptography, 23, 283-290, 2001.
5. K. Itoh, T. Izu and M. Takenaka. Address-Bit Differential Power Analysis of Cryptographic Schemes OK-ECDH and OK-ECDSA. In Workshop on Cryptographic Hardware and Embedded Systems (CHES), Springer-Verlag LNCS 2523, 129-143, 2002.
6. K. Itoh, T. Izu and M. Takenaka, A Practical Countermeasure Against Address-Bit Differential Power Analysis. In Workshop on Cryptographic Hardware and Embedded Systems (CHES), Springer-Verlag LNCS 2779, 382-396, 2003.
7. P.C. Kocher. Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems. In Advances in Cryptology - CRYPTO '96, Springer-Verlag LNCS 1109, 104-113, 1996.
8. P.C. Kocher, J. Jaffe and B. Jun. Differential Power Analysis. In Advances in Cryptology - CRYPTO '99, Springer-Verlag LNCS 2139, 388-397, 1999.
9. A.K. Lenstra, H.W. Lenstra and L. Lovász. Factoring polynomials with rational coefficients. Math. Ann., 261, 515-534, 1982.
10. T.S. Messerges. Using Second-Order Power Analysis to Attack DPA Resistant Software. In Workshop on Cryptographic Hardware and Embedded Systems (CHES), Springer-Verlag LNCS 1965, 238-251, 2000.
11. B. Möller. Parallelizable Elliptic Curve Point Multiplication Method with Resistance against Side-Channel Attacks. In Information Security (ISC), Springer-Verlag LNCS 2433, 402-413, 2002.
12. P.Q. Nguyen and I.E. Shparlinski. The insecurity of the Digital Signature Algorithm with partially known nonces. J. Cryptology, 15, 151-176, 2002.
13. P.Q. Nguyen and I.E. Shparlinski. On the insecurity of the elliptic curve digital signature algorithm with partially known nonces. Designs, Codes and Cryptography, To appear.
14. W. Schindler. A Combined Timing and Power Attack. In 5th Workshop on Practice and Theory in Public Key Cryptosystems (PKC), Springer-Verlag LNCS 2274, 263-279, 2002.
15. C.P. Schnorr and M. Euchner. Lattice basis reduction: improved practical algorithms and solving subset sum problems. In Proc. FCT 1991, Springer-Verlag LNCS 529, 68-85, 1991.
16. Y. Tsunoo, E. Tsujihara, K. Minematsu and H. Miyauchi. Cryptanalysis of Block Ciphers Implemented on Computers with Cache. In International Symposium on Information Theory and Its Applications (ISITA), 2002.
17. Y. Tsunoo, T. Saito, T. Suzaki, M. Shigeri and H. Miyauchi. Cryptanalysis of DES Implemented on Computers with Cache. In Workshop on Cryptographic Hardware and Embedded Systems (CHES), Springer-Verlag LNCS 2779, 62-76, 2003.
18. C.D. Walter and S. Thompson. Distinguishing Exponent Digits by Observing Modular Subtractions. In Topics in Cryptology (CT-RSA), Springer-Verlag LNCS 2020, 192-207, 2001.
19. B.M.M. de Weger. Solving exponential diophantine equations using lattice basis reduction. J. Number Theory, 26, 325-367, 1987.