The problem at the center of RSA is finding the eth root of.pdf
0 likes10 views
The document discusses the challenge of finding the eth root of ciphertext c modulo n, where n is the product of two distinct primes, p and q. It highlights the difficulty of this problem for large n without knowledge of the factors but states that it becomes manageable once p and q are known. The document requests the creation of a function, findroot(c,e,p,q), to solve the equation xe ≡ c mod n for x.
1 of 1
Download to read offline
More Related Content
More from adithvrc (20)
Ad
Recently uploaded (20)
Ad
The problem at the center of RSA is finding the eth root of.pdf
- 1. The problem at the center of RSA is finding the eth root of the ciphertext c modulo N where N = pq is a product of (distinct) primes. This is hard to do for large N if you dont know the factors p and q, but once you know p and q it becomes easy! Write a finction findRoot(c,e,p,q) which solves the equation xe c mod N for x where N = pq