Produkt mají v nabídce:
Primality Testing and Integer Factorization in Public-Key Cryptography - Yan, Song Y.
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).
