Back to Results
First PageMeta Content
General number field sieve / RSA Factoring Challenge / RSA / Arjen Lenstra / Prime number / Factorization / Integer factorization records / Lattice sieving / Polynomial / Integer factorization algorithms / Cryptography / Mathematics


Factorization of a 512–Bit RSA Modulus Stefania Cavallar3, Bruce Dodson8 , Arjen K. Lenstra1 , Walter Lioen3 , Peter L. Montgomery10 , Brian Murphy2 , Herman te Riele3 , Karen Aardal13 ,
Add to Reading List

Document Date: 2002-07-30 11:33:08

Open Document

File Size: 208,50 KB

Share Result on Facebook

City

Cambridge / Mendham / Ottawa / /

Company

Paul Zimmermann7 1 Citibank / Microsoft Research Ltd / Computer Sciences Laboratory / Entrust Technologies Ltd. / /

Country

United States / United Kingdom / Canada / /

/

Facility

Utrecht University / Lehigh University / /

IndustryTerm

polynomial search / polynomial search time / search time corresponding / polynomial selection algorithm / secure Internet communication / e - commerce / longer search / handshake protocols / polynomial search effort / search time / search effort / increased polynomial search time / electronic commerce / /

Organization

Ecole Polytechnique / USA government / Centre of IT / Lehigh University / Utrecht University / U.S. Department of Commerce Bureau of Export Administration / /

Person

Arjen Lenstra / Russell Ruby / Peter Montgomery / Stefania Cavallar / Marije Elkenbracht-Huizing / Hudson / /

/

Position

representative / /

ProvinceOrState

Ontario / New Jersey / /

PublishedMedium

Extrapolation / /

Technology

encryption / cryptography / polynomial selection algorithm / handshake protocols / factoring algorithms / iterative block Lanczos algorithm / SSL / /

URL

http /

SocialTag