Public-key cryptosystems with very small key lengths

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

Volumn 658 LNCS, Issue , 1993, Pages 163-173

  Harper, Greg ^a   Menezes, Alfred ^a   Vanstone, Scott ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COST EFFECTIVENESS;

COST EFFECTIVE; ELLIPTIC CURVE CRYPTOSYSTEMS; KEY LENGTHS; KEY SIZES; PUBLIC KEY CRYPTOSYSTEMS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 85048643420     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47555-9_14     Document Type: Conference Paper

References (25)

1. G. Agnew, R. Mullin and S. Vanstone, “An implementation of elliptic cryptosystems over F2155”, preprint, 1992.
2. E. Berlekamp, Algebraic Coding Theory, McGraw-Hill, New York, 1968.
3. R. Brent, “An improved Monte Carlo factoring algorithm”, BIT, 20 (1980), 176–184.
4. R. Brent, “Parallel algorithms for integer factorisation”, in Number Theory and Cryptography, Cambridge University Press, 1990, 26–37.
5. E. Brickell, D. Gordon, K. McCurley and D. Wilson, “Fast exponentiation with precomputation”, preprint, 1992.
6. B. Chor and R. Rivest, “A knapsack-type public key cryptosystem based on arithmetic in finite fields”, IEEE Transactions on Information Theory, 34 (1988), 901–909.
7. W. Diffie and M. Hellman, “New directions in cryptography”, IEEE Transactions on Information Theory, 22 (1976), 644–654.
8. T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms”, IEEE Transactions on Information Theory, 31 (1985), 469–472.
9. D. Gordon and K. McCurley, “Computation of discrete logarithms in GF(2n)”, presentation at Crypto’ 91, Santa Barbara, 1991.
10. N. Koblitz, A Course in Number Theory and Cryptography, Springer-Verlag, New York, 1987.
11. N. Koblitz, “Elliptic curve cryptosystem”, Mathematics of Computation, 48 (1987), 203–209.
12. N. Koblitz, “Constructing elliptic curve cryptosystems in characteristic 2”, Advances in Cryptology: Proceedings of Crypto’ 90, Lecture Notes in Computer Science, 537 (1991), Springer-Verlag, 156–167.
13. N. Koblitz, “CM-Curves with good cryptographic properties”, Advances in Cryptology: Proceedings of Crypto’ 91, Lecture Notes in Computer Science, 576 (1992), Springer-Verlag, 279–287.
14. B. La Macchia and A. Odlyzko, “Computation of discrete logarithms in prime fields”, Designs, Codes and Cryptography, 1 (1991), 47–62.
15. A. Menezes, T. Okamoto and S. Vanstone, “Reducing elliptic curve logarithms to logarithms in a finite field”, Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, 80–89, 1991.
16. A. Menezes and S. Vanstone, “Elliptic curve cryptosystems and their implementation”, submitted to Journal of Cryptology, 1991.
17. m”, to appear in Mathematics of Computation, 1992.
18. V. Miller, “Uses of elliptic curves in cryptography”, Advances in Cryptology: Proceedings of Crypto’ 85, Lecture Notes in Computer Science, 218 (1986), Springer-Verlag, 417–426.
19. R. Mullin, I. Onyszchuk, S. Vanstone and R. Wilson, “Optimal normal bases in GF(p n)”, Discrete Applied Mathematics, 22 (1988/89), 149–161.
20. A. Odlyzko, “Discrete logarithms in finite fields and their cryptographic significance”, Advances in Cryptology — Proceedings of Eurocrypt’ 84, Lecture Notes in Computer Science, 209 (1985), Springer-Verlag, 224–314.
21. S. Pohlig and M. Hellman, “An improved algorithm for computing logarithms over GF (p) and its cryptographic significance”, IEEE Transactions on Information Theory, 24 (1978), 106–110.
22. J. Pollard, “Monte Carlo methods for index computation (mod p)”, Mathematics of Computation, 32 (1978), 918–924.
23. R. Rivest, A. Shamir and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems”, Communications of the ACM, 21 (1978), 120–126.
24. R. Schoof, “Elliptic curves over finite fields and the computation of square roots mod p”, Mathematics of Computation, 44 (1985), 483–494.
25. P. van Oorschot, “A comparison of practical public key cryptosystems”, in Contemporary Cryptology, IEEE Press, 1992, 289–322.