RSA Private Key Reconstruction from Random Bits Using SAT Solvers

Provided by: Technische Universität Chemnitz
Topic: Security
Format: PDF
SAT solvers are being used more and more in cryptanalysis. Their efficiency varies depending on the structure of the algorithm they are applied to. However, when it comes to integer factorization, or more specially the RSA problem, SAT solvers prove to be at least inefficient. The running times are too long to be compared with any well known integer factorization algorithm, even when it comes to small RSA moduli numbers. The recent paper on cold boot attacks has sparkled again the interest on partial key exposure attacks and RSA key reconstruction.

Find By Topic