Primality Testing and Integer Factorization in Public Key Cryptography

Primality Testing and Integer Factorization in Public Key Cryptography

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)....
fra 1 739,-
Tilgjengelig i 1 butikker

Produktinformasjon

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

Spesifikasjon

Produkt
ProduktnavnPrimality Testing and Integer Factorization in Public Key Cryptography
MerkeOther Brand
book typSamfunnsvitenskap

Pris og prishistorikk

Akkurat nå er 1 739,- den billigste prisen for Primality Testing and Integer Factorization in Public Key Cryptography blant 1 butikker hos Prisradar. Sjekk også vår topp 5-rangering av beste bøker for å være sikker på at du gjør det beste kjøpet.