Massively Parallel Computation of Discrete Logarithms
- 18 May 2001
- book chapter
- Published by Springer Nature
- p. 312-323
- https://doi.org/10.1007/3-540-48071-4_22
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Solving Large Sparse Linear Systems Over Finite FieldsPublished by Springer Nature ,2001
- Discrete logarithms in finite fields and their cryptographic significancePublished by Springer Nature ,2000
- Sparse Matrix Computations on Parallel Processor ArraysSIAM Journal on Scientific Computing, 1993
- An efficient parallel algorithm for matrix-vector multiplicationPublished by Office of Scientific and Technical Information (OSTI) ,1993
- Factoring with two large primesPublished by Springer Nature ,1991
- An application of factoringJournal of Symbolic Computation, 1985
- 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
- New directions in cryptographyIEEE Transactions on Information Theory, 1976