0 ratings 0% found this document useful (0 votes) 272 views 1 page

, and let a ∈ {0, ..., n − 1} such that (a, n) = 1. Then by the extended

Original Title: How RSA Works

Uploaded by laundrevity

Description: A brief algebraic overview of the RSA encryption scheme, including a proof of Euler's theorem (via Lagrange's theorem). Full description