Cryptography. Principles and realization
type: Item
instance of: scholarly article
zbMATH Open document ID: 1254.94001
author: Pierre Barthélemy
author: Robert Rolland
author: Pascal Véron
publication date: 2012-06-06T00:00:00Z
Mathematics Subject Classification ID: 94-01
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 14G50
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 6043130
zbMATH Keywords: cryptography
zbMATH Keywords: information security
MaRDI profile type: Publication
title: Cryptography. Principles and realization
review text: People began to feel the need to hide information from one another a long time ago, but today cryptography means a lot more than just text encryption; it is based on mathematical problems and depends on their computational hardness. And since computers get more evolved and fast, the cryptographic algorithms also need to be improved, so the interest in this widely used field is constant and many books are written on this subject.NEWLINENEWLINEThis book, in a second edition, contains a detailed overview of cryptographic principles and their implementations. By following its content, a large variety of concepts covering information security can be identified. So, after an introductory chapter, the second chapter presents public-key cryptography. It explains the RSA, ElGamal and Rabin algorithms, giving for each of them the mathematical function they are based on, the encryption and decryption schemes (in words and sometimes also using figures), some possible types of attack and their rate of success influenced by the length of the keys. Next, digital signature schemes using ElGamal, RSA, DSA and its elliptic curve variant ECDSA are described. A main problem of public-keys management is the need of storing and administrating them. The book presents the Diffie-Hellman key exchange method, followed by the description of blind signature and authentication problems (zero-knowledge proof, Feige-Fiat-Shamir identification scheme, Schnorr identification, commitment scheme, secret sharing of the Shamir scheme).NEWLINENEWLINEChapter 3 presents private-key cryptography, also known as symmetric-key cryptography. There are two types of algorithms: stream ciphers and block ciphers. The DES and AES algorithms are described, along with possible methods of breaking them (brute force attack, last round attack, differential cryptanalysis, linear cryptanalysis, interpolation cryptanalysis). The hash functions and their usage (message authentication code, SHA) finalize the chapter.NEWLINEN…
reviewed by: Adrian Atanasiu
description: scientific article; zbMATH DE number 6043130