Réseaux Euclidiens et Algorithmique, une liste de références

Preuves de sécurité reposant sur les réseaux

Retour à la page principale

Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes, Boneh D. and Venkatesan R. (1996)
Rounding in Lattices and its Cryptographic Applications, Boneh D. and Venkatesan R. (1997)
On the security of Diffie-Hellman bits, González Vasco M. and Shparlinski I. (1999)
On the generalised hidden number problem and bit security of XTR, Shparlinski I. (2001)
Security of the most significant bits of the Shamir message passing scheme, González Vasco M. and Shparlinski I. (2002)
Security of most significant bits of g^{x^2} Shparlinski I. (2002)
Exponential sums and lattice reduction: Applications to cryptography Shparlinski I. (2002)
Security Proof for Partial-Domain Hash Signature Schemes, Coron J.S. (2002)
Hidden Number Problem with the Trace and Bit Security of XTR and LUC, Li W.-C. and Näslund M. and Shparlinski I. (2002)
Hidden number problem with hidden multipliers, timed-release crypto and noisy exponentiation Howgrave-Graham N. and Nguyen P. and Shparlinski I. (2003)

Dernière mise à jour le 31/10/2003. Page maintenue par Damien Stehlé: damien.stehle@loria.fr