Discrete logarithms in finite fields and their cryptographic significance
- 1 December 2000
- book chapter
- Published by Springer Nature
- p. 224-314
- https://doi.org/10.1007/3-540-39757-4_20
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- Fast evaluation of logarithms in fields of characteristic twoIEEE Transactions on Information Theory, 1984
- Computing Logarithms in Finite Fields of Characteristic TwoSIAM Journal on Algebraic Discrete Methods, 1984
- Evaluating logarithms in GF(2n)Published by Association for Computing Machinery (ACM) ,1984
- Primality Testing and Jacobi SumsMathematics of Computation, 1984
- An Efficient Parallel Algorithm for the Solution of Large Sparse Linear Matrix EquationsIEEE Transactions on Computers, 1983
- On Distinguishing Prime Numbers from Composite NumbersAnnals of Mathematics, 1983
- A New Algorithm for Factoring Polynomials Over Finite FieldsMathematics of Computation, 1981
- A subexponential algorithm for the discrete logarithm problem with applications to cryptographyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Sparse Matrix TechniquesPublished by Springer Nature ,1977
- Factoring Polynomials Over Large Finite FieldsMathematics of Computation, 1970