Primality Testing and Integer Factorization in Public-Key Cryptography

Primality Testing and Integer Factorization in Public-Key Cryptography

by Song Y. Yan
2/5
(3 votes)

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 polynomi.

First published
2010
Publishers
Springer
Language
English

Books

Similar books