Skip to main content alibris logo

Primality Testing and Integer Factorization in Public-Key Cryptography

by

Write The First Customer Review
Primality Testing and Integer Factorization in Public-Key Cryptography - Yan, Song Y.
Filter Results
Item Condition
Seller Rating
Other Options
Change Currency

The Primality Testing Problem (PTP) has now proved to be solvable in deterministic polynomial-time (P) by the AKS (Agrawal-Kayal-Saxena) algorithm, whereas the Integer Factorization Problem (IFP) still remains unsolvable in (P). There is still no polynomial-time algorithm for IFP. Many practical public-key cryptosystems and protocols such as RSA (Rivest-Shamir-Adleman) rely their security on computational intractability of IFP. Primality Testing and Integer Factorization in Public Key Cryptography, Second Edition, provides ...

loading
Primality Testing and Integer Factorization in Public-Key Cryptography 2010, Springer-Verlag New York Inc., New York, NY

ISBN-13: 9781441945860

Softcover reprint of hardcover 2nd edition 2009

Paperback

Primality Testing and Integer Factorization in Public-Key Cryptography 2008, Springer, New York, NY

ISBN-13: 9780387772677

2nd edition

Hardcover

Primality Testing and Integer Factorization in Public-Key Cryptography 2004, Springer, Boston, MA

ISBN-13: 9781402076497

Hardcover