2013年11月13日
****ural 1141. RSA Attack（RSA加密，扩展欧几里得算法）
摘要： 1141. RSA AttackTime limit: 1.0 secondMemory limit: 64 MBThe RSA problem is the following: given a positive integer n that is a product of two distinct odd primes p and q, a positive integer e such that gcd(e, (p-1)*(q-1)) = 1, and an integer c, find an integer m such that me= c (mod n).InputOne num 阅读全文
posted @ 2013-11-13 15:52 秋心无波 阅读(976) 评论(0) 推荐(0)