Cryptography: Theory and Practice,Second Edition
Douglas R. Stinson
Abstract
Douglas R. Stinson
Abstract
From the Publisher: The Advanced Encryption Standard (AES), elliptic curve DSA, the secure hash algorithm these and other major advances over that last five years demanded this comprehensive revision of the standard-setting text and reference, Cryptography: Theory and Practice. Now more tightly focused on the core areas, it contains many new topics as well as thoroughly updated treatments of topics presented in the first edition. There is increased emphasis on general concepts, but the outstanding features that first made this a bestseller all remain, including its mathematical rigor, numerous examples, pseudocode descriptions of algorithms, and clear, precise explanations.New in the Second Edition:· Explains the latest Federal Information Processing Standards , including the Advanced Encryption Standard (AES), the Secure Has Algorithm (SHA-1), and the Elliptic Curve Digital Signature Algorithm (ECDSA)· Uses substitution-permutation networks to introduce block cipher design and analysis concepts· Explains both linear and differential cryptanalysis· Presents the Random Oracle model for hash functions· Addresses semantic security of RSA and Optional Asymmetric Encryption Padding· Discusses Wiener's attach on low decryption exponent RSA Overwhelmingly popular and relied upon in its first edition, now, more than ever, Cryptography: Theory and Practice provides an introduction to the field ideal for upper-level students in both mathematics and computer science.More highlights of the Second Edition:· Provably secure signature schemes: Full Domain Hash· Universal hash families· Expanded treatment of message authentication codes· More discussions on elliptic curves· Lower bounds for thecomplexity of generic algorithms for the discrete logarithm problem· Expanded treatment of factoring algorithms· Security definitions for signature schemes
OpenAlex reports 263 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
From the Publisher: The Advanced Encryption Standard (AES), elliptic curve DSA, the secure hash algorithm these and other major advances over that last five years demanded this comprehensive revision of the standard-setting text and reference, Cryptography: Theory and Practice. Now more tightly focused on the core areas, it contains many new topics as well as thoroughly updated treatments of topics presented in the first edition. There is increased emphasis on general concepts, but the outstanding features that first made this a bestseller all remain, including its mathematical rigor, numerous examples, pseudocode descriptions of algorithms, and clear, precise explanations.New in the Second Edition:· Explains the latest Federal Information Processing Standards , including the Advanced Encryption Standard (AES), the Secure Has Algorithm (SHA-1), and the Elliptic Curve Digital Signature Algorithm (ECDSA)· Uses substitution-permutation networks to introduce block cipher design and analysis concepts· Explains both linear and differential cryptanalysis· Presents the Random Oracle model for hash functions· Addresses semantic security of RSA and Optional Asymmetric Encryption Padding· Discusses Wiener's attach on low decryption exponent RSA Overwhelmingly popular and relied upon in its first edition, now, more than ever, Cryptography: Theory and Practice provides an introduction to the field ideal for upper-level students in both mathematics and computer science.More highlights of the Second Edition:· Provably secure signature schemes: Full Domain Hash· Universal hash families· Expanded treatment of message authentication codes· More discussions on elliptic curves· Lower bounds for thecomplexity of generic algorithms for the discrete logarithm problem· Expanded treatment of factoring algorithms· Security definitions for signature schemes
Key concepts: Computer science, Hash function, Cryptography, Random oracle, Theoretical computer science, Elliptic Curve Digital Signature Algorithm, Encryption, Cryptanalysis