Cargando…

Quantum Attacks on Public-Key Cryptosystems

The cryptosystems based on the Integer Factorization Problem (IFP), the Discrete Logarithm Problem (DLP) and the Elliptic Curve Discrete Logarithm Problem (ECDLP) are essentially the only three types of practical public-key cryptosystems in use. The security of these cryptosystems relies heavily on...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Yan, Song Y. (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York, NY : Springer US : Imprint: Springer, 2013.
Edición:1st ed. 2013.
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-1-4419-7722-9
003 DE-He213
005 20220118093826.0
007 cr nn 008mamaa
008 130427s2013 xxu| s |||| 0|eng d
020 |a 9781441977229  |9 978-1-4419-7722-9 
024 7 |a 10.1007/978-1-4419-7722-9  |2 doi 
050 4 |a QA76.9.D35 
050 4 |a Q350-390 
072 7 |a UMB  |2 bicssc 
072 7 |a GPF  |2 bicssc 
072 7 |a COM031000  |2 bisacsh 
072 7 |a UMB  |2 thema 
072 7 |a GPF  |2 thema 
082 0 4 |a 005.73  |2 23 
082 0 4 |a 003.54  |2 23 
100 1 |a Yan, Song Y.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Quantum Attacks on Public-Key Cryptosystems  |h [electronic resource] /  |c by Song Y. Yan. 
250 |a 1st ed. 2013. 
264 1 |a New York, NY :  |b Springer US :  |b Imprint: Springer,  |c 2013. 
300 |a VIII, 207 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
505 0 |a Classic and Quantum Computation -- Quantum Attacks on IFP-Based Cryptosystems -- Quantum Attacks on DLP-Based Cryptosystems -- Quantum Attacks on ECDLP-Based Cryptosystems -- Quantum-Computing Resistant Cryptosystems. 
520 |a The cryptosystems based on the Integer Factorization Problem (IFP), the Discrete Logarithm Problem (DLP) and the Elliptic Curve Discrete Logarithm Problem (ECDLP) are essentially the only three types of practical public-key cryptosystems in use. The security of these cryptosystems relies heavily on these three infeasible problems, as no polynomial-time algorithms exist for them so far. However, polynomial-time quantum algorithms for IFP, DLP and ECDLP do exist, provided that a practical quantum computer exists. Quantum Attacks on Public-Key Cryptosystems presemts almost all known quantum computing based attacks on public-key cryptosystems, with an emphasis on quantum algorithms for IFP, DLP, and ECDLP. It also discusses some quantum resistant cryptosystems to replace the IFP, DLP and ECDLP based cryptosystems. This book is intended to be used either as a graduate text in computing, communications and mathematics, or as a basic reference in the field. 
650 0 |a Data structures (Computer science). 
650 0 |a Information theory. 
650 0 |a Cryptography. 
650 0 |a Data encryption (Computer science). 
650 0 |a Algorithms. 
650 0 |a Computer science-Mathematics. 
650 0 |a Computer networks . 
650 1 4 |a Data Structures and Information Theory. 
650 2 4 |a Cryptology. 
650 2 4 |a Algorithms. 
650 2 4 |a Mathematics of Computing. 
650 2 4 |a Symbolic and Algebraic Manipulation. 
650 2 4 |a Computer Communication Networks. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9781489997791 
776 0 8 |i Printed edition:  |z 9781441977212 
776 0 8 |i Printed edition:  |z 9781441977236 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-1-4419-7722-9  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)