Listing 1 - 10 of 24 | << page >> |
Sort by
|
Choose an application
Choose an application
This book provides a comprehensive introduction to advanced topics in the computational and algorithmic aspects of number theory, focusing on applications in cryptography. Readers will learn to develop fast algorithms, including quantum algorithms, to solve various classic and modern number theoretic problems. Key problems include prime number generation, primality testing, integer factorization, discrete logarithms, elliptic curve arithmetic, conjecture and numerical verification. The author discusses quantum algorithms for solving the Integer Factorization Problem (IFP), the Discrete Logarithm Problem (DLP), and the Elliptic Curve Discrete Logarithm Problem (ECDLP) and for attacking IFP, DLP and ECDLP based cryptographic systems. Chapters also cover various other quantum algorithms for Pell's equation, principal ideal, unit group, class group, Gauss sums, prime counting function, Riemann's hypothesis and the BSD conjecture. Quantum Computational Number Theory is self-contained and intended to be used either as a graduate text in computing, communications and mathematics, or as a basic reference in the related fields. Number theorists, cryptographers and professionals working in quantum computing, cryptography and network security will find this book a valuable asset.
Computer Science --- Engineering & Applied Sciences --- Quantum computing. --- Number theory. --- Number study --- Numbers, Theory of --- Computation, Quantum --- Computing, Quantum --- Information processing, Quantum --- Quantum computation --- Quantum information processing --- Computer science. --- Computer security. --- Data encryption (Computer science). --- Coding theory. --- Computers. --- Computer Science. --- Theory of Computation. --- Systems and Data Security. --- Coding and Information Theory. --- Data Encryption. --- Electronic data processing --- Algebra --- Information theory. --- Cryptology. --- Data encoding (Computer science) --- Encryption of data (Computer science) --- Computer security --- Cryptography --- Data compression (Telecommunication) --- Digital electronics --- Information theory --- Machine theory --- Signal theory (Telecommunication) --- Computer programming --- Computer privacy --- Computer system security --- Computer systems --- Computers --- Cyber security --- Cybersecurity --- Electronic digital computers --- Protection of computer systems --- Security of computer systems --- Data protection --- Security systems --- Hacking --- Communication theory --- Communication --- Cybernetics --- Protection --- Security measures --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Calculators --- Cyberspace
Choose an application
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.
REFERENCE --- General --- Engineering & Applied Sciences --- Computer Science --- Computer networks --- Cryptography. --- Security measures. --- Cryptanalysis --- Cryptology --- Secret writing --- Steganography --- Computer network security --- Network security, Computer --- Security of computer networks --- Computer science. --- Computer communication systems. --- Data structures (Computer science). --- Data encryption (Computer science). --- Algorithms. --- Computer science --- Computer Science. --- Data Structures, Cryptology and Information Theory. --- Data Encryption. --- Algorithm Analysis and Problem Complexity. --- Mathematics of Computing. --- Symbolic and Algebraic Manipulation. --- Computer Communication Networks. --- Mathematics. --- Signs and symbols --- Symbolism --- Writing --- Ciphers --- Data encryption (Computer science) --- Computer security --- Data structures (Computer scienc. --- Computer software. --- Algebra --- Data Structures and Information Theory. --- Cryptology. --- Data processing. --- Informatics --- Science --- Software, Computer --- Computer systems --- Data encoding (Computer science) --- Encryption of data (Computer science) --- Cryptography --- Computer science—Mathematics. --- Communication systems, Computer --- Computer communication systems --- Data networks, Computer --- ECNs (Electronic communication networks) --- Electronic communication networks --- Networks, Computer --- Teleprocessing networks --- Data transmission systems --- Digital communications --- Electronic systems --- Information networks --- Telecommunication --- Cyberinfrastructure --- Electronic data processing --- Network computers --- Algorism --- Arithmetic --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- File organization (Computer science) --- Abstract data types (Computer science) --- Distributed processing --- Foundations --- Computer mathematics --- Mathematics
Choose an application
Although the Primality Testing Problem (PTP) has been proved to be solvable in deterministic polynomial-time (P) in 2002 by Agrawal, Kayal and Saxena, the Integer Factorization Problem (IFP) still remains unsolvable in P. The security of many practical Public-Key Cryptosystems and Protocols such as RSA (invented by Rivest, Shamir and Adleman) relies on the computational intractability of IFP. This monograph provides a survey of recent progress in Primality Testing and Integer Factorization, with implications to factoring-based Public Key Cryptography. Notable features of this second edition are the several new sections and more than 100 new pages that are added. These include a new section in Chapter 2 on the comparison of Rabin-Miller probabilistic test in RP, Atkin-Morain elliptic curve test in ZPP and AKS deterministic test in P; a new section in Chapter 3 on recent work in quantum factoring; and a new section in Chapter 4 on post-quantum cryptography. To make the book suitable as an advanced undergraduate and/or postgraduate text/reference, about ten problems at various levels of difficulty are added at the end of each section, making about 300 problems in total contained in the book; most of the problems are research-oriented with prizes ordered by individuals or organizations to a total amount over five million US dollars. Primality Testing and Integer Factorization in Public Key Cryptography is designed for practitioners and researchers in industry and graduate-level students in computer science and mathematics.
Computer security. --- Computers. --- Cryptography,. --- Computer security --- Cryptography --- Computer Science --- Engineering & Applied Sciences --- Cryptanalysis --- Cryptology --- Secret writing --- Steganography --- Computer privacy --- Computer system security --- Computer systems --- Computers --- Cyber security --- Cybersecurity --- Electronic digital computers --- Security of computer systems --- Security measures --- Protection of computer systems --- Protection --- Computer science. --- Data structures (Computer science). --- Data encryption (Computer science). --- Coding theory. --- Computer science --- Number theory. --- Computer Science. --- Data Encryption. --- Number Theory. --- Mathematics of Computing. --- Data Structures, Cryptology and Information Theory. --- Systems and Data Security. --- Coding and Information Theory. --- Mathematics. --- Number study --- Numbers, Theory of --- Algebra --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Data compression (Telecommunication) --- Digital electronics --- Information theory --- Machine theory --- Signal theory (Telecommunication) --- Computer programming --- Data encoding (Computer science) --- Encryption of data (Computer science) --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- File organization (Computer science) --- Abstract data types (Computer science) --- Data protection --- Security systems --- Hacking --- Informatics --- Science --- Mathematics --- Cryptography.
Choose an application
RSA is a public-key cryptographic system, and is the most famous and widely-used cryptographic system in today's digital world. Cryptanalytic Attacks on RSA, a professional book, covers almost all major known cryptanalytic attacks and defenses of the RSA cryptographic system and its variants. Since RSA depends heavily on computational complexity theory and number theory, background information on complexity theory and number theory is presented first. This is followed by an account of the RSA cryptographic system and its variants. Cryptanalytic Attacks on RSA is designed for a professional audience composed of practitioners and researchers in industry. This book is also suitable as a reference or secondary text book for advanced level students in computer science. .
Computer networks. --- Cryptography. --- Data encryption (Computer science). --- Electrical & Computer Engineering --- Engineering & Applied Sciences --- Telecommunications --- Computer Science --- Computer security. --- Data encryption (Computer science) --- Data encoding (Computer science) --- Encryption of data (Computer science) --- Computer privacy --- Computer system security --- Computer systems --- Computers --- Cyber security --- Cybersecurity --- Electronic digital computers --- Security of computer systems --- Security measures --- Protection of computer systems --- Protection --- Computer science. --- Data structures (Computer science). --- Coding theory. --- Number theory. --- Statistics. --- Computer Science. --- Data Encryption. --- Number Theory. --- Statistics, general. --- Data Structures, Cryptology and Information Theory. --- Systems and Data Security. --- Coding and Information Theory. --- Data protection --- Security systems --- Hacking --- Statistical analysis --- Statistical data --- Statistical methods --- Statistical science --- Mathematics --- Econometrics --- Number study --- Numbers, Theory of --- Algebra --- Data compression (Telecommunication) --- Digital electronics --- Information theory --- Machine theory --- Signal theory (Telecommunication) --- Computer programming --- Computer security --- Cryptography --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- Electronic data processing --- File organization (Computer science) --- Abstract data types (Computer science) --- Informatics --- Science --- Data structures (Computer scienc. --- Cryptology. --- Data Structures and Information Theory. --- Data structures (Computer science) --- Statistics . --- Information theory. --- Communication theory --- Communication --- Cybernetics
Choose an application
Although the Primality Testing Problem (PTP) has been proved to be solvable in deterministic polynomial-time (P) in 2002 by Agrawal, Kayal and Saxena, the Integer Factorization Problem (IFP) still remains unsolvable in P. The security of many practical Public-Key Cryptosystems and Protocols such as RSA (invented by Rivest, Shamir and Adleman) relies on the computational intractability of IFP. This monograph provides a survey of recent progress in Primality Testing and Integer Factorization, with implications to factoring-based Public Key Cryptography. Notable features of this second edition are the several new sections and more than 100 new pages that are added. These include a new section in Chapter 2 on the comparison of Rabin-Miller probabilistic test in RP, Atkin-Morain elliptic curve test in ZPP and AKS deterministic test in P; a new section in Chapter 3 on recent work in quantum factoring; and a new section in Chapter 4 on post-quantum cryptography. To make the book suitable as an advanced undergraduate and/or postgraduate text/reference, about ten problems at various levels of difficulty are added at the end of each section, making about 300 problems in total contained in the book; most of the problems are research-oriented with prizes ordered by individuals or organizations to a total amount over five million US dollars. Primality Testing and Integer Factorization in Public Key Cryptography is designed for practitioners and researchers in industry and graduate-level students in computer science and mathematics.
coderen --- cryptologie --- computernetwerken --- Computer architecture. Operating systems --- informatietheorie --- informatica --- database management --- Information systems --- Ergodic theory. Information theory --- programmatielogica --- Computer science --- DES (data encryption standard) --- computerbeveiliging --- Computer security. --- Cryptography. --- Sécurité informatique --- Cryptographie --- EPUB-LIV-FT LIVINFOR SPRINGER-B
Choose an application
This book provides the basic theory, techniques, and algorithms of modern cryptography that are applicable to network and cyberspace security. It consists of the following nine main chapters: Chapter 1 provides the basic concepts and ideas of cyberspace and cyberspace security, Chapters 2 and 3 provide an introduction to mathematical and computational preliminaries, respectively. Chapters 4 discusses the basic ideas and system of secret-key cryptography, whereas Chapters 5, 6, and 7 discuss the basic ideas and systems of public-key cryptography based on integer factorization, discrete logarithms, and elliptic curves, respectively. Quantum-safe cryptography is presented in Chapter 8 and offensive cryptography, particularly cryptovirology, is covered in Chapter 9. This book can be used as a secondary text for final-year undergraduate students and first-year postgraduate students for courses in Computer, Network, and Cyberspace Security. Researchers and practitioners working in cyberspace security and network security will also find this book useful as a reference.
Cryptography. --- Data encryption (Computer science) --- Data structures (Computer scienc. --- Data protection. --- Computer Communication Networks. --- Data Structures and Information Theory. --- Security. --- Data structures (Computer science) --- Data governance --- Data regulation --- Personal data protection --- Protection, Data --- Electronic data processing --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- File organization (Computer science) --- Abstract data types (Computer science) --- Data structures (Computer science). --- Computer communication systems. --- Communication systems, Computer --- Computer communication systems --- Data networks, Computer --- ECNs (Electronic communication networks) --- Electronic communication networks --- Networks, Computer --- Teleprocessing networks --- Data transmission systems --- Digital communications --- Electronic systems --- Information networks --- Telecommunication --- Cyberinfrastructure --- Network computers --- Distributed processing
Choose an application
Choose an application
Ergodic theory. Information theory --- Computer science --- Computer architecture. Operating systems --- Information systems --- coderen --- DES (data encryption standard) --- cryptologie --- informatica --- database management --- programmatielogica --- computerbeveiliging --- computernetwerken --- informatietheorie
Choose an application
Ergodic theory. Information theory --- Computer science --- Computer architecture. Operating systems --- Information systems --- coderen --- DES (data encryption standard) --- cryptologie --- informatica --- database management --- programmatielogica --- computerbeveiliging --- computernetwerken --- informatietheorie
Listing 1 - 10 of 24 | << page >> |
Sort by
|