Back to Results
First PageMeta Content
Mathematical analysis / Prime-counting function / Prime number theorem / Prime number / Elliptic curve / Riemann hypothesis / Smooth number / Elliott–Halberstam conjecture / Algebraic number field / Mathematics / Analytic number theory / Number theory


Smooth Orders and Cryptographic Applications Carl Pomerance1 and Igor E. Shparlinski2 1 Department of Fundamental Mathematics, Bell Laboratories Murray Hill, NJ[removed], USA
Add to Reading List

Document Date: 2005-03-02 15:21:08

Open Document

File Size: 164,27 KB

Share Result on Facebook

City

Berlin / Boca Raton / Granville / Springer-Verlag / Melbourne / London / New York / Oxford / /

Company

Cambridge University Press / Introduction We / CRC Press / /

/

Facility

Macquarie University / /

IndustryTerm

rigorous unconditional algorithm / cryptographic applications / mind applications / polynomial factorization algorithm / eld sieve algorithm / type algorithms / /

Organization

Cambridge University / Department of Computing / Macquarie University Sydney / Department of Fundamental Mathematics / /

Person

H. W. Lenstra / Jr. / Sophie Germain / Carl Pomerance / Igor E. Shparlinski / Simon Stevin / Murray Hill / /

ProvinceOrState

Florida / New York / /

Technology

cryptography / public key / Hellman algorithm / squaring type algorithms / rigorous unconditional algorithm / secret key / Digital Signature / eld sieve algorithm / polynomial factorization algorithm / /

SocialTag