On Lovász' lattice reduction and the nearest lattice point problem, Combinatorica, vol.6, issue.1, pp.1-13, 1986. ,
On the generation of one-time keys in dl signature schemes. Presentation at IEEE P1363 Working Group meeting, 2000. ,
Practical key recovery for discrete-logarithm based authentication schemes from random nonce bits, CHES 2015, vol.9293, pp.287-306, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01214701
ooh aah... just a little bit": A small amount of side channel can go a long way, CHES 2014, vol.8731, pp.75-92, 2014. ,
Virtually) free randomization techniques for elliptic curve cryptography, ICICS 03, vol.2836, pp.348-359, 2003. ,
Finding a small root of a bivariate integer equation; factoring with high bits known, EUROCRYPT'96, vol.1070, pp.178-189, 1996. ,
Finding a small root of a univariate modular equation, EUROCRYPT'96, vol.1070, pp.155-165, 1996. ,
Resistance against differential power analysis for elliptic curve cryptosystems, CHES'99, vol.1717, pp.292-302, 1999. ,
Template attacks, CHES 2002, vol.2523, pp.13-28, 2003. ,
A public key cryptosystem and a signature scheme based on discrete logarithms, CRYPTO'84, vol.196, pp.10-18, 1984. ,
Attacking (EC)DSA given only an implicit hint, SAC 2012, vol.7707, pp.252-274, 2013. ,
Public-key cryptosystems from lattice reduction problems, CRYPTO'97, vol.1294, p.112 ,
, , 1997.
Scalar multiplication on Weierstraß elliptic curves from Co-Z arithmetic, J. Cryptographic Engineering, vol.1, issue.2, pp.161-176, 2011. ,
Using templates to attack masked montgomery ladder implementations of modular exponentiation, WISA 08, vol.5379, pp.1-13, 2009. ,
Attacking ECDSAenabled RFID devices, ACNS 09, vol.5536, pp.519-534, 2009. ,
Lattice attacks on digital signature schemes, Des. Codes Cryptography, vol.23, issue.3, pp.283-290, 2001. ,
Improved elliptic curve multiplication methods resistant against side channel attacks, INDOCRYPT 2002, vol.2551, pp.296-313, 2002. ,
The Montgomery powering ladder, CHES 2002, vol.2523, pp.291-302, 2003. ,
Differential power analysis, CRYPTO'99, vol.1666, pp.388-397, 1999. ,
Elliptic curve cryptosystems, Math. Comp, vol.48, issue.177, pp.203-209, 1987. ,
Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems, CRYPTO'96, vol.1109, pp.104-113 ,
, , 1996.
Factoring polynomials with rational coefficients, Math. Ann, vol.261, pp.515-534, 1982. ,
Attacking DSA under a repeated bits assumption, CHES 2004, vol.3156, pp.428-440 ,
, , 2004.
Using Bleichenbacher's solution to the hidden number problem to attack nonce leaks in 384-bit ECDSA, CHES 2013, vol.8086, pp.435-452, 2013. ,
Use of elliptic curves in cryptography, CRYPTO'85, vol.218, pp.417-426, 1986. ,
Template attacks on ECDSA, WISA 08, vol.5379, pp.14-27, 2009. ,
Speeding the Pollard and elliptic curve methods of factorization, Math. Comput, vol.48, pp.243-264, 1987. ,
, FIPS PUB 186-2: Digital Signature Standard (DSS). National Institute for Standards and Technology, 2000.
The insecurity of the digital signature algorithm with partially known nonces, Journal of Cryptology, vol.15, issue.3, pp.151-176, 2002. ,
The insecurity of the elliptic curve digital signature algorithm with partially known nonces. Des. Codes Cryptography, vol.30, pp.201-217, 2003. ,
Efficient signature generation by smart cards, Journal of Cryptology, vol.4, issue.3, pp.161-174, 1991. ,
The distributions of individual bits in the output of multiplicative operations, Cryptography and Communications, vol.7, issue.1, pp.71-90, 2015. ,
New results on the complexity of the middle bit of multiplication, Computational Complexity, vol.16, issue.3, pp.298-323, 2007. ,