Cryptography by Simon Rubinstein-Salzedo

Author:Simon Rubinstein-Salzedo
Language: eng
Format: epub, pdf
ISBN: 9783319948188
Publisher: Springer International Publishing

(9)Use the AKS algorithm to show that 161 is composite.

(10) (a)The number N is the product of two n-digit primes p and q, where the first more than n / 2 digits of p and q are the same. Explain how to factor N (and thus find p and q) given this knowledge.

(b)Factor 2130468073.

(11)We have seen various algorithms for attacking the discrete logarithm problem and integer factorization. Using big O notation, how many steps does it take for these algorithms to work, for a “typical” case? (For example, it might be that for certain special integers, it takes much longer to factor them than it does for most integers. If so, you can ignore them. Similarly, some of these algorithms involve some randomness, so you can assume that the random number generator isn’t conspiring against you unreasonably.)

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.