主講人：陳君明 教授 (臺灣大學數學系)

主題：Elliptic Curves and Number Field Sieve in Public-Key Cryptography

Abstract：
Public-key cryptosystems are widely adopted in our daily life. For example, websites on the internet are authenticated by browsers with RSA or ECC (Elliptic Curves Cryptosystems). The application of elliptic curves over finite fields in cryptography will be introduced. The security of RSA is determined by the efficiency of factoring large integers. So far the best algorithm is the number field sieve. We will see how algebraic number theory is involved. Also our implementation of factoring RSA-512 within 3 days on two supercomputers at NTU will be mentioned.

時間：2008 年 12 月 01 日13:20~14:10

地點：新生大樓202 室

茶會：14:20於舊數館201室