How to fake an RSA signature by encoding modular root finding as a SAT problem
Authors:
- 1 August 2003
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 130 (2) , 101-127
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- The Taming of the (X)ORLecture Notes in Computer Science, 2000
- An RNS Montgomery modular multiplication algorithmIEEE Transactions on Computers, 1998
- Breaking RSA may not be equivalent to factoring1998
- Finding hard instances of the satisfiability problem: A survey1997
- Small Solutions to Polynomial Equations, and Low Exponent RSA VulnerabilitiesJournal of Cryptology, 1997
- Experimental results on the crossover point in random 3-SATArtificial Intelligence, 1996
- Privacy Enhancement for Internet Electronic Mail: Part III: Algorithms, Modes, and Identifiers1993
- A VLSI modulo m multiplierIEEE Transactions on Computers, 1991
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- A machine program for theorem-provingCommunications of the ACM, 1962