Cryptanalysis of RSA and Its VariantsCRC Press, 2009-07-21 - 272 psl. Thirty years after RSA was first publicized, it remains an active research area. Although several good surveys exist, they are either slightly outdated or only focus on one type of attack. Offering an updated look at this field, Cryptanalysis of RSA and Its Variants presents the best known mathematical attacks on RSA and its main variants, includin |
Turinys
Cryptanalysis of RSA | 49 |
Cryptanalysis of Variants of RSA | 137 |
Distribution of g gcdp 1 q 1 | 233 |
Geometrically Progressive Matrices | 235 |
Some Algorithms | 239 |
Further Reading | 241 |
Bibliography | 243 |
Kiti leidimai - Peržiūrėti viską
A Handbook of Statistical Analyses Using R, Second Edition Torsten Hothorn,Brian S. Everitt Ribota peržiūra - 2009 |
Pagrindiniai terminai ir frazės
addition algorithm approximation assume Assumptions balanced primes basis basis vectors Boneh bound candidate chapter ciphertext common common prime complexity Computer Science consider constant construct convergent corresponding private CRT-exponents CRT-RSA decryption editor efficiently enabling condition encryption example exists expected factor the modulus follows full sized given holds increasing instances instances of RSA integer key equation key exposure attacks known lattice least significant bits Lecture Notes method modular modulus with balanced multi-prime RSA multiple n-bit needed Notes in Computer Notice obtained original partial key exposure particular plaintext polynomial in log(N practice private exponent attacks problem proof public exponent public key recover reduced remainder requires result root RSA modulus satisfies shown simply small private exponent smaller smallest solutions solve Springer sufficiently Table Theorem unknown values variants vector volume yields