Cryptanalysis of Number Theoretic Ciphers: Computational Mathematics
Autor Jr. Samuel S. Wagstaffen Limba Engleză Hardback – 10 dec 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ț: 1024.66 lei
Preț vechi: 1249.59 lei
-18%
Puncte Express: 1537
Preț estimativ în valută:
181.21€ • 212.65$ • 157.17£
181.21€ • 212.65$ • 157.17£
Carte tipărită la comandă
Livrare economică 09-23 martie
Specificații
ISBN-13: 9781584881537
ISBN-10: 1584881534
Pagini: 334
Ilustrații: 7 b/w images, 1 table and 500 equations
Dimensiuni: 156 x 234 x 24 mm
Greutate: 0.78 kg
Ediția:2003.
Editura: CRC Press
Colecția Chapman and Hall/CRC
Seria Computational Mathematics
ISBN-10: 1584881534
Pagini: 334
Ilustrații: 7 b/w images, 1 table and 500 equations
Dimensiuni: 156 x 234 x 24 mm
Greutate: 0.78 kg
Ediția:2003.
Editura: CRC Press
Colecția Chapman and Hall/CRC
Seria Computational Mathematics
Public țintă
UndergraduateCuprins
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.
Notă biografică
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.
Recenzii
"This book contains a nice introduction to modern cryptography, with emphasis laid on the ciphers based on computational number theory. … The reader learns to deal with large numbers in a computer and to analyze the complexity of the most basic algorithms. … [T]he reader is not just confronted with a list of algorithms, but he/she is given the clues to assimilate the ideas behind the results … . The book contains more than 200 interesting exercises that test the reader's understanding of the text."
- Zentralblatt MATH, 1045
"The book provides an excellent text concerning cryptanalysis. … masterly and carefully written. As the proofs are given with full details … I can recommend it also to students."
- Monatshefte fur Mathematik
- Zentralblatt MATH, 1045
"The book provides an excellent text concerning cryptanalysis. … masterly and carefully written. As the proofs are given with full details … I can recommend it also to students."
- Monatshefte fur Mathematik
Descriere
At the heart of modern cryptographic algorithms lies computational number theory. Written by a number theorist and practicing cryptographer, this book takes readers from basic number theory through the inner workings of ciphers and protocols, to their strengths and weaknesses.