Cryptanalysis of RSA and Its Variants

Regular price €132.99
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=M. Jason Hinek
advanced RSA cryptanalysis strategies
algebraic attacks
Author_M. Jason Hinek
balanced
Balanced Primes
Basis Vectors
Category=PB
Chinese Remainder Theorem
Common Modulus
Continued Fraction Expansion
Continued Fractions
coppersmith's methods
cryptanalysis
cryptographic security analysis
Decryption Costs
Enabling Condition
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
exponent
exponents
graduate level mathematics
Jason M. Hinek
Key Generation Algorithm
lattice reduction methods
mathematical attack techniques
mathematical proof
Modular Exponentiations
modulus
Modulus Size
number theory
Partial Decryptions
Plaintext Messages
polynomial
prime
private
Private Exponent
Private Key
public
Public Exponent
Public Key
public key cryptography
RSA
RSA Cryptosystem
RSA Modulus
RSA Prime
small
Small Public Exponents
Small Vectors
Target Vector
time
Time Polynomial
Vector Matrix Equation

Product details

  • ISBN 9781420075182
  • Weight: 635g
  • Dimensions: 156 x 234mm
  • Publication Date: 21 Jul 2009
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Product Form: Hardback
Secure checkout Fast Shipping Easy returns

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, including CRT-RSA, multi-prime RSA, and multi-power RSA.

Divided into three parts, the book first introduces RSA and reviews the mathematical background needed for the majority of attacks described in the remainder of the text. It then brings together all of the most popular mathematical attacks on RSA and its variants. For each attack presented, the author includes a mathematical proof if possible or a mathematical justification for attacks that rely on assumptions. For the attacks that cannot be proven, he gives experimental evidence to illustrate their practical effectiveness.

Focusing on mathematical attacks that exploit the structure of RSA and specific parameter choices, this book provides an up-to-date collection of the most well-known attacks, along with details of the attacks. It facilitates an understanding of the cryptanalysis of public-key cryptosystems, applications of lattice basis reduction, and the security of RSA and its variants.

M. Jason Hinek is an adjunct research fellow in the iCORE Information Security Lab at the University of Calgary. He earned his Ph.D. in computer science from the University of Waterloo, where his research focused on the security of variants of RSA.

More from this author