- ホーム
- > 洋書
- > 英文書
- > Science / Mathematics
基本説明
RSA暗号系の暗号解読攻撃と防御をほぼ網羅する専門書。
Contents- Feasible and Infeasible Computation.- RSA Public-Key Cryptography.- Brute-Force Integer Factorization Attack.- Brute-Force Discrete Logarithm Attack.- Elementary Number-Theoretic Attack.- Diophantine and Lattice Attacks.- Implementation Attacks.- Bibliography.- Index.
Full Description
RSA is the first workable and practicable public-key cryptographic system, based on the use of large prime numbers. It is also the most popular and widely-used cryptographic system in today's digital world, for which its three inventors Rivest, Shamir and Adleman received the year 2002 Turing Award, the equivalent Nobel Prize in Computer Science.
Cryptanalytic Attacks on RSA covers almost all major known cryptanalytic attacks and defenses of the RSA cryptographic system and its variants. Since RSA depends heavily on computational complexity theory and number theory, background information on complexity theory and number theory is presented first. This is followed by an account of the RSA cryptographic system and its variants.
Cryptanalytic Attacks on RSA is designed for a professional audience of practitioners and researchers in industry and academia and as a reference or secondary text for advanced level students in computer science, applied mathematics, electrical & communication engineering.
Contents
Computational/Mathematical Preliminaries.- RSA Public-Key Cryptography.- Integer Factorization Attacks.- Discrete Logarithm Attacks.- Quantum Computing Attacks.- Simple Elementary Attacks.- Public Exponent Attacks.- Private Exponent Attacks.- Side-Channel Attacks.- The Road Ahead.