, The general sieve kernel and new records in lattice reduction. Cryptology ePrint Archive, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02397424
DSA signing key recovery with noisy side channels and variable error rates, INDOCRYPT. Lecture Notes in Computer Science, vol.10698, pp.147-165, 2017. ,
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. ,
Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes, CRYPTO'96, vol.1109, pp.129-142, 1996. ,
BKZ 2.0: Better lattice security estimates, ASI-ACRYPT, vol.7073, pp.1-20, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-01109961
Cachequote: Efficiently recovering long-term secrets of SGX EPID via cache, 2018. ,
Attacking OpenSSL implementation of ECDSA with a few signatures, ACM CCS, pp.1505-1515, 2016. ,
Attacking OpenSSL implementation of ECDSA with a few signatures, Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, p.16, 2016. ,
, Mathematics of Public Key Cryptography, 2012.
Constant-time callees with variable-time callers, USENIX Association, pp.83-98, 2017. ,
ECDSA key extraction from mobile devices via nonintrusive physical side channels, CCS, pp.1626-1638, 2016. ,
A survey of fast exponentiation methods, Journal of Algorithms, vol.27, issue.1, pp.129-146, 1998. ,
Extended hidden number problem and its cryptanalytic applications, SAC 2006, vol.4356, pp.114-133, 2007. ,
Extended hidden number problem and its cryptanalytic applications, pp.114-133, 2007. ,
, Lattice attacks on digital signature schemes. Designs, vol.23, pp.283-290, 2001.
The elliptic curve digital signature algorithm (ECDSA), International Journal of Information Security, vol.1, issue.1, pp.36-63, 2001. ,
On finding small solutions of modular multivariate polynomial equations, Advances in Cryptology -EUROCRYPT'98, pp.158-170, 1998. ,
Differential power analysis, Advances in Cryptology -CRYPTO' 99, pp.388-397, 1999. ,
Factoring polynomials with rational coefficients, Mathematische Annalen, vol.261, issue.4, pp.515-534, 1982. ,
Speeding the pollard and elliptic curve methods of factorization, Mathematics of Computation, vol.48, issue.177, pp.243-243, 1987. ,
LLL on the average, Proceedings of the 7th International Conference on Algorithmic Number Theory, pp.238-256, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00107309
The insecurity of the elliptic curve digital signature algorithm with partially known nonces. Designs, Codes and Cryptography, vol.30, pp.201-217, 2003. ,
Cache attacks and countermeasures: The case of AES, CT-RSA 2006, vol.3860, pp.1-20, 2006. ,
Just a little bit more, Topics in Cryptology -CT-RSA 2015, pp.3-21, 2015. ,
A hierarchy of polynomial time lattice basis reduction algorithms, Theoretical Computer Science, vol.53, issue.2-3, pp.201-224, 1987. ,
Block reduced lattice bases and successive minima, Combinatorics, Probability & Computing, vol.3, pp.507-522, 1994. ,
Lattice basis reduction: Improved practical algorithms and solving subset sum problems, Mathematical Programming, vol.66, issue.2, pp.181-199, 1994. ,
, The FPLLL development team: FPLLL, a lattice reduction library, 2016.
Just a little bit more, CT-RSA 2015, vol.9048, pp.3-21, 2015. ,
, Responses to NIST's proposals, 1992.
Attacking OpenSSL ECDSA with a small amount of sidechannel information, Science China Information Sciences, vol.61, issue.3, p.32105, 2017. ,
Recovering OpenSSL ECDSA nonces using the FLUSH+RELOAD cache side-channel attack. IACR Cryptology ePrint Archive, p.140, 2014. ,