1 / 73

Number-Theoretic Algorithms

Number-Theoretic Algorithms. Chapter 31, CLRS book. Modular Arithmetic. The Chinese Remainder Problem. A problem described in an ancient Chinese arithmetic book, Sun Tze Suan Ching , by Sun Tze (around 300AD, author of The Art of War ).

mahlah
Download Presentation

Number-Theoretic Algorithms

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Number-Theoretic Algorithms Chapter 31, CLRS book

  2. Modular Arithmetic

  3. The Chinese Remainder Problem • A problem described in an ancient Chinese arithmetic book, Sun TzeSuanChing, by Sun Tze (around 300AD, author of The Art of War). • Problem: We have a number of objects, but we do not know exactly how many. If we count them by threes we have two left over. If we count them by fives we have three left over. If we count them by sevens we have two left over. How many objects are there?

  4. Example: Chinese remainder theorem

  5. Algorithms

  6. The RSA Cryptosystem

  7. Attacks on RSA

  8. RSA-200 =27,997,833,911,221,327,870,829,467,638, 722,601,621,070,446,786,955,428,537,560, 009,929,326,128,400,107,609,345,671,052, 955,360,856,061,822,351,910,951,365,788, 637,105,954,482,006,576,775,098,580,557, 613,579,098,734,950,144,178,863,178,946, 295,187,237,869,221,823,983.

  9. Generating large primes To set up an RSA cryptosystem, we need two large primes p and q.

More Related