Order computations in generic groups (2007)

by Andrew V. Sutherland
Venue:PHD THESIS MIT, SUBMITTED JUNE 2007. RESOURCES
Citations:9 - 3 self

Active Bibliography

1 Computational Methods in Public Key Cryptology – Arjen K. Lenstra - 2002
Small Base Groups, Large Base Groups and the Case of Giants – Jonathan Cohen
A Survey of Elliptic Curve Cryptosystems, Part I: Introductory – San C. Vo - 2003
Cryptographic Primitives – Paul Garrett - 2007
369 Guide to Elliptic Curve Cryptography – Aleksandar Jurisic, Alfred J. Menezes - 2004
1 STRUCTURE COMPUTATION AND DISCRETE LOGARITHMS IN FINITE ABELIAN p-GROUPS – Andrew V. Sutherland
147 Software Implementation of Elliptic Curve Cryptography Over Binary Fields – Darrel Hankerson, Julio Lopez Hernandez, Alfred Menezes - 2000
29 An Overview of Elliptic Curve Cryptography – Julio López, Ricardo Dahab - 2000
41 Parallel Algorithms for Integer Factorisation – Richard P. Brent
121 Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes – Jan Camenisch, Markus Michels - 1998
6 Efficient implementation of cryptosystems based on non-maximal imaginary quadratic orders – Detlef Hühnlein
Studies on High-Speed Hardware . . . – Kimmo Järvinen - 2008
2 On the Insecurity of Some Server-Aided RSA Protocol – Phong Q. Nguyen, Igor E. Shparlinski
4 On the insecurity of a server-aided RSA protocol – Phong Q. Nguyen, Igor E. Shparlinski - 2001
1 A GENERIC APPROACH TO SEARCHING FOR JACOBIANS – Andrew V. Sutherland - 2009
Codes -- The Guide to Secrecy . . . – Richard A. Mollin
189 Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack – Ronald Cramer, Victor Shoup - 2001
68 Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms – R. Gallant, R. Lambert, S. Vanstone - 2001
Discrete logarithms: The past and the future – Andrew Odlyzko Att, Andrew Odlyzko - 2000