Abstract
Abstract The RSA and Rabin encryption functions are respectively defined as EN(X) = xe mod N and EN(X) = x2 mod N, where N is a product of two large random primes p, q and e is relatively prime to
Cite
CITATION STYLE
APA
Fischlin, R., & Schnorr, C. P. (2000). Stronger security proofs for RSA and rabin bits. Journal of Cryptology, 13(2), 221–244. https://doi.org/10.1007/S001459910008
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free