Cryptanalysis of Number Theoretic Ciphers: Computational Mathematics
Autor Sam Wagstaff, Samuel S. Jr. Wagstaffen Limba Engleză Hardback – 30 noi 2002
First, the book provides the mathematical background needed in cryptography as well as definitions and simple examples from cryptography. It includes summaries of elementary number theory and group theory, as well as common methods of finding or constructing large random primes, factoring large integers, and computing discrete logarithms. Next, it describes a selection of cryptographic algorithms, most of which use number theory. Finally, the book presents methods of attack on the cryptographic algorithms and assesses their effectiveness. For each attack method the author lists the systems it applies to and tells how they may be broken with it.
Computational number theorists are some of the most successful cryptanalysts against public key systems. Cryptanalysis of Number Theoretic Ciphers builds a solid foundation in number theory and shows you how to apply it not only when breaking ciphers, but also when designing ones that are difficult to break.
Preț: 1019.99 lei
Preț vechi: 1243.89 lei
-18% Nou
Puncte Express: 1530
Preț estimativ în valută:
180.47€ • 210.24$ • 157.59£
180.47€ • 210.24$ • 157.59£
Carte tipărită la comandă
Livrare economică 17-31 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781584881537
ISBN-10: 1584881534
Pagini: 336
Ilustrații: 7 b/w images, 1 table and 500 equations
Dimensiuni: 172 x 231 x 24 mm
Greutate: 0.64 kg
Ediția:2003.
Editura: Chapman & Hall
Seria Computational Mathematics
ISBN-10: 1584881534
Pagini: 336
Ilustrații: 7 b/w images, 1 table and 500 equations
Dimensiuni: 172 x 231 x 24 mm
Greutate: 0.64 kg
Ediția:2003.
Editura: Chapman & Hall
Seria Computational Mathematics
Public țintă
Undergraduate and graduate students in mathematics and computer science; Scientists at NSA and other national laboratories; Administrators of the Internet and computer centers; Practitioners of electronic commerceCuprins
MATHEMATICAL FOUNDATIONS OF CRYPTANALYSIS
Terminology of Cryptography
Probability Theory
Divisibility and Arithmetic
Primes
Congruences
Euler's Theorem and Its Consequences
Second Degree Congruences
Information Theory
Groups, Rings and Fields
Finding Large Primes
Exponential Methods of Factoring Integers
Elliptic Curves
Subexponential Factoring Algorithms
Computing Discrete Logarithms
Random Number Generation
THE CRYPTOGRAPHIC ALGORITHMS
Private Key Algorithms
Public Key Algorithms
Signature Algorithms
Key Exchange Algorithms
Simple Protocols
Complicated Protocols
Complete Systems
METHODS OF ATTACK
Direct Attacks
Exploiting a User Error
Active Attacks
References
Terminology of Cryptography
Probability Theory
Divisibility and Arithmetic
Primes
Congruences
Euler's Theorem and Its Consequences
Second Degree Congruences
Information Theory
Groups, Rings and Fields
Finding Large Primes
Exponential Methods of Factoring Integers
Elliptic Curves
Subexponential Factoring Algorithms
Computing Discrete Logarithms
Random Number Generation
THE CRYPTOGRAPHIC ALGORITHMS
Private Key Algorithms
Public Key Algorithms
Signature Algorithms
Key Exchange Algorithms
Simple Protocols
Complicated Protocols
Complete Systems
METHODS OF ATTACK
Direct Attacks
Exploiting a User Error
Active Attacks
References