- We will send in 10–14 business days.
/images/books/3391718/9780387254647.jpg)
- Author: Serge Vaudenay
- Publisher: Springer
- ISBN-10: 0387254641
- ISBN-13: 9780387254647
- Format: 16.1 x 24.3 x 2.5 cm, kieti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
This book introduces the fundamentals of information and communication security by providing appropriate mathematical concepts to prove or break the security of cryptographic schemes. It covers conventional cryptographic primitives and cryptanalysis of these primitives; basic algebra and number theory for cryptologists; public key cryptography and cryptanalysis of these schemes; and other cryptographic protocols, e.g. secret sharing, zero-knowledge proofs and undeniable signature schemes.
A Classical Introduction to Cryptography: Applications for Communications Security is rich with algorithms, such as exhaustive search with time/memory tradeoffs; proofs, such as security proofs for DSA-like signature schemes; and classical attacks such as collision attacks on MD4. Hard-to-find standards, e.g. SSH2 and security in Bluetooth, are also included.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 21d.15:02:51
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Serge Vaudenay
- Publisher: Springer
- ISBN-10: 0387254641
- ISBN-13: 9780387254647
- Format: 16.1 x 24.3 x 2.5 cm, kieti viršeliai
- Language: English English
This book introduces the fundamentals of information and communication security by providing appropriate mathematical concepts to prove or break the security of cryptographic schemes. It covers conventional cryptographic primitives and cryptanalysis of these primitives; basic algebra and number theory for cryptologists; public key cryptography and cryptanalysis of these schemes; and other cryptographic protocols, e.g. secret sharing, zero-knowledge proofs and undeniable signature schemes.
A Classical Introduction to Cryptography: Applications for Communications Security is rich with algorithms, such as exhaustive search with time/memory tradeoffs; proofs, such as security proofs for DSA-like signature schemes; and classical attacks such as collision attacks on MD4. Hard-to-find standards, e.g. SSH2 and security in Bluetooth, are also included.
Reviews