Analysis of Bernstein’s Factorization Circuit
- 8 November 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Unbelievable Security Matching AES Security Using Public Key SystemsLecture Notes in Computer Science, 2001
- Selecting Cryptographic Key SizesJournal of Cryptology, 2001
- Factoring Integers Using SIMD SievesPublished by Springer Nature ,2001
- Packet Routing in Fixed-Connection Networks: A SurveyJournal of Parallel and Distributed Computing, 1998
- Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems (extended abstract)Published by Association for Computing Machinery (ACM) ,1997
- A Block Lanczos Algorithm for Finding Dependencies over GF(2)Lecture Notes in Computer Science, 1995
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann AlgorithmMathematics of Computation, 1994
- Modifications to the Number Field SieveJournal of Cryptology, 1993
- An optimal sorting algorithm for mesh connected computersPublished by Association for Computing Machinery (ACM) ,1986
- Solving sparse linear equations over finite fieldsIEEE Transactions on Information Theory, 1986