Complexity Issues for Public Key Cryptography

This publication has 21 references indexed in Scilit:

• Fast evaluation of logarithms in fields of characteristic two
  IEEE Transactions on Information Theory, 1984
• Factorization and Primality Tests
  The American Mathematical Monthly, 1984
• Computing Logarithms in Finite Fields of Characteristic Two
  SIAM Journal on Algebraic Discrete Methods, 1984
• Primality testing and Jacobi sums
  Mathematics of Computation, 1984
• On a problem of Oppenheim concerning “factorisatio numerorum”
  Journal of Number Theory, 1983
• A Fast Modular Multiplication Algorithm with Application to Two Key Cryptography
  Published by Springer Nature ,1983
• Factoring large numbers with a quadratic sieve
  Mathematics of Computation, 1983
• On the Asymptotic Complexity of Matrix Multiplication
  SIAM Journal on Computing, 1982
• New directions in cryptography
  IEEE Transactions on Information Theory, 1976
• Shift-register synthesis and BCH decoding
  IEEE Transactions on Information Theory, 1969