## 2.2 Standard CRT-RSA Scheme and Fault Cryptanalysis

by Unknown Authors

### BibTeX

@MISC{_2.2standard,

author = {},

title = {2.2 Standard CRT-RSA Scheme and Fault Cryptanalysis},

year = {}

}

### OpenURL

### Abstract

Let n = pq denote the RSA modulus with two primes p and q, e the public key and d the corresponding private key, so that ed ≡ 1 (mod ϕ(n)), where the Euler Totient of n is ϕ(n) = (p − 1)(q − 1). Let f(x) denote the faulty value on a variable x if an error occurs during the computation of x, and l(x) be the length of x in bits.