By Song Y. Yan
The cryptosystems in line with the Integer Factorization challenge (IFP), the Discrete Logarithm challenge (DLP) and the Elliptic Curve Discrete Logarithm challenge (ECDLP) are primarily the single 3 forms of useful public-key cryptosystems in use. the safety of those cryptosystems is based seriously on those 3 infeasible difficulties, as no polynomial-time algorithms exist for them up to now. despite the fact that, polynomial-time quantum algorithms for IFP, DLP and ECDLP do exist, only if a pragmatic quantum machine exists.
Quantum assaults on Public-Key Cryptosystems presemts nearly all known quantum computing dependent assaults on public-key cryptosystems, with an emphasis on quantum algorithms for IFP, DLP, and ECDLP. It additionally discusses a few quantum resistant cryptosystems to interchange the IFP, DLP and ECDLP dependent cryptosystems.
This ebook is meant for use both as a graduate textual content in computing, communications and arithmetic, or as a easy reference within the field.