First Page | Document Content | |
---|---|---|
Date: 1998-04-13 22:10:00Cryptography Finite fields Public-key cryptography Euclidean algorithm Factorization of polynomials over a finite field and irreducibility tests Mathematics Mathematical analysis Polynomials | Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme P. Delsarte Philips Research Laboratory, Avenue Van Becelaere, 2 B-1170 Brussels, Belgium Y. DesmedtAdd to Reading ListSource URL: www.dtc.umn.eduDownload Document from Source WebsiteFile Size: 19,88 KBShare Document on Facebook |