Cryptanalysis of Number Theoretic Ciphers
Regular price
€192.20
14 days return policy
Shipping & Delivery
A01=Samuel S. Wagstaff
advanced algebraic structures
Algebraic Integers
Alice's Public Key
Alice’s Public Key
Author_Samuel S. Wagstaff
Bob's Public Key
Bob’s Public Key
Category=PBC
Category=PBK
Category=URY
Chinese Remainder Theorem
computational mathematics
computing discrete logarithms
cryptographic algorithms
cryptographic security analysis
Diffie Hellman Key Exchange Protocol
Discrete Logarithm
Discrete Logarithm Problem
elementary number theory
Elliptic Curve
Elliptic Curve Method
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Euler's theorem
Extended Euclidean Algorithm
group theory applications
integer factorization methods
Jacobi Symbol
Jr.
Large Prime Factor
Number Field Sieve
Odd Prime
Prime Divisor
Primitive Root Modulo
probability in cryptography
Public Key
Public Key Cipher
public key cryptosystem vulnerabilities
Quadratic Nonresidue Modulo
Quadratic Residue
Quadratic Residue Modulo
random primes
RSA Key
Square Root Modulo
Stream Ciphers
Synchronous Stream Cipher
Product details
- ISBN 9781584881537
- Weight: 780g
- Dimensions: 156 x 234mm
- Publication Date: 10 Dec 2002
- Publisher: Taylor & Francis Inc
- Publication City/Country: US
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
At the heart of modern cryptographic algorithms lies computational number theory. Whether you're encrypting or decrypting ciphers, a solid background in number theory is essential for success. Written by a number theorist and practicing cryptographer, Cryptanalysis of Number Theoretic Ciphers takes you from basic number theory to the inner workings of ciphers and protocols.
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.
Samuel S. Wagstaff, Jr. is a professor at the Purdue University Center for Education and Research in Information Assurance and Security (CERIAS) in West Lafayette, Indiana.
