買這商品的人也買了...
-
$931Invitation to Cryptography -
$1,274Fundamentals of Computer Security (Hardcover) -
$931Security in Computing, 3/e (平裝） -
$931Internet Security: Cryptographic Principles, Algorithms and Protocols (Hardcover) -
Information Theory, Coding and Cryptography (Paperback)$680$666 -
Linux 指令詳解辭典$650$553 -
Java 認證 SCJP 5.0 猛虎出閘$650$514 -
Complexity and Cryptography: An Introduction (Paperback)$1,150$1,127 -
Foundations of Computer Security$1,400$1,372 -
ASP.NET 2.0 深度剖析範例集$650$507 -
Microsoft SQL Server 2005 管理實務$680$578 -
SQL 語法範例辭典$550$468 -
聖殿祭司的 ASP.NET 2.0 專家技術手冊－使用VB, 2/e$720$569 -
Linux 作業系統之奧義$480$379 -
深入淺出物件導向分析與設計 (Head First Object-Oriented Analysis and Design)$880$695 -
Risks, Controls, and Security : Concepts and Applications$2,780$2,641 -
鳥哥的 Linux 伺服器架設篇, 2/e & 鳥哥的 Linux 私房菜基礎學習篇, 2/e$1,560$1,326 -
A Classical Introduction to Cryptography: Applications for Communications Security (Hardcover)$1,200$1,176 -
Protecting Information: From Classical Error Correction to Quantum Cryptography$820$804 -
ActionScript 3.0 精緻範例辭典$550$468 -
JavaScript 大全 (JavaScript: The Definitive Guide, 5/e)$1,200$948 -
現代嵌入式系統開發專案實務－菜鳥成長日誌與專案經理的私房菜$600$480 -
ASP.NET 問題解決實戰$580$493 -
Flash CS3 ActionScript 3.0 打造互動網頁的力與美$480$379 -
程式設計師的自我修養－連結、載入、程式庫$580$458
相關主題
商品描述
Description
Gain the skills and knowledge needed to create effective data security systemsThis book updates readers with all the tools, techniques, and concepts needed to understand and implement data security systems. It presents a wide range of topics for a thorough understanding of the factors that affect the efficiency of secrecy, authentication, and digital signature schema. Most importantly, readers gain hands-on experience in cryptanalysis and learn how to create effective cryptographic systems.
The author contributed to the design and analysis of the Data Encryption Standard (DES), a widely used symmetric-key encryption algorithm. His recommendations are based on firsthand experience of what does and does not work.
Thorough in its coverage, the book starts with a discussion of the history of cryptography, including a description of the basic encryption systems and many of the cipher systems used in the twentieth century. The author then discusses the theory of symmetric- and public-key cryptography. Readers not only discover what cryptography can do to protect sensitive data, but also learn the practical limitations of the technology. The book ends with two chapters that explore a wide range of cryptography applications.
Three basic types of chapters are featured to facilitate learning:
- Chapters that develop technical skills
- Chapters that describe a cryptosystem and present a method of analysis
- Chapters that describe a cryptosystem, present a method of analysis, and provide problems to test your grasp of the material and your ability to implement practical solutions
With consumers becoming increasingly wary of identity theft and companies struggling to develop safe, secure systems, this book is essential reading for professionals in e-commerce and information technology. Written by a professor who teaches cryptography, it is also ideal for students.
Table of Contents
FOREWORD.PREFACE.
ABOUT THE AUTHOR.
CHAPTER 1: APERITIFS.
1.1 The Lexicon of Cryptography.
1.2 Cryptographic Systems.
1.3 Cryptanalysis.
1.4 Side Information.
1.5 Thomas Jefferson and the M-94.
1.6 Cryptography and History.
1.7 Cryptography and Computers.
1.8 The National Security Agency.
1.9 The Giants.
1.10 No Sex, Money, Crime or . . . Love.
1.11 An Example of the Inference Process in Cryptanalysis.
1.12 Warning!
CHAPTER 2: COLUMNAR TRANSPOSITION.
2.1 Shannon’s Classification of Secrecy Transformations.
2.2 The Rules of Columnar Transposition Encipherment.
2.3 Cribbing.
2.4 Examples of Cribbing.
2.5 Plaintext Language Models.
2.6 Counting k-Grams.
2.7 Deriving the Parameters of a Markov Model from Sliding Window Counts.
2.8 Markov Scoring.
2.9 The ADFGVX Transposition System.
2.10 CODA.
2.11 Columnar Transposition Problems.
CHAPTER 3: MONOALPHABETIC SUBSTITUTION.
3.1 Monoalphabetic Substitution.
3.2 Caesar’s Cipher.
3.3 Cribbing Using Isomorphs.
3.4 The x2-Test of a Hypothesis.
3.5 Pruning from the Table of Isomorphs.
3.6 Partial Maximum Likelihood Estimation of a Monoalphabetic Substitution.
3.7 The Hidden Markov Model (HMM).
3.8 Hill Encipherment of ASCII N-Grams.
3.9 Gaussian Elimination.
3.10 Monoalphabetic Substitution Problems.
CHAPTER 4: POLYALPHABETIC SUBSTITUTION.
4.1 Running Keys.
4.2 Blaise de Vigene're.
4.3 Gilbert S. Vernam.
4.4 The One-Time Pad.
4.5 Finding the Key of Vernam–Vigene're Ciphertext with Known Period by Correlation.
4.6 Coincidence.
4.7 Venona.
4.8 Polyalphabetic Substitution Problems.
CHAPTER 5: STATISTICAL TESTS.
5.1 Weaknesses in a Cryptosystem.
5.2 The Kolmogorov–Smirnov Test.
5.3 NIST’s Proposed Statistical Tests.
5.4 Diagnosis.
5.5 Statistical Tests Problems.
CHAPTER 6: THE EMERGENCE OF CIPHER MACHINES.
6.1 The Rotor.
6.2 Rotor Systems.
6.3 Rotor Patents.
6.4 A Characteristic Property of Conjugacy.
6.5 Analysis of a 1-Rotor System: Ciphertext Only.
6.6 The Displacement Sequence of a Permutation.
6.7 Arthur Scherbius.
6.8 Enigma Key Distribution Protocol.
6.9 Cryptanalysis of the Enigma.
6.10 Cribbing Enigma Ciphertext.
6.11 The Lorenz Schlu¨sselzusatz.
6.12 The SZ40 Pin Wheels.
6.13 SZ40 Cryptanalysis Problems.
6.14 Cribbing SZ40 Ciphertext.
CHAPTER 7: THE JAPANESE CIPHER MACHINES.
7.1 Japanese Signaling Conventions.
7.2 Half-Rotors.
7.3 Components of the RED Machine.
7.4 Cribbing RED Ciphertext.
7.5 Generalized Vowels and Consonants.
7.6 “Climb Mount Itaka” – War!
7.7 Components of the PURPLE Machine.
7.8 The PURPLE Keys.
7.9 Cribbing PURPLE: Finding the V-Stepper.
7.10 Cribbing PURPLE: Finding the C-Steppers.
CHAPTER 8: STREAM CIPHERS.
8.1 Stream Ciphers.
8.2 Feedback Shift Registers.
8.3 The Algebra of Polynomials over Z2.
8.4 The Characteristic Polynomial of a Linear Feedback Shift Register.
8.5 Properties of Maximal Length LFSR Sequences.
8.6 Linear Equivalence.
8.7 Combining Multiple Linear Feedback Shift Registers.
8.8 Matrix Representation of the LFSR.
8.9 Cribbing of Stream Enciphered ASCII Plaintext.
8.10 Nonlinear Feedback Shift Registers.
8.11 Nonlinear Key Stream Generation.
8.12 Irregular Clocking.
8.13 RC4.
8.14 Stream Encipherment Problems.
CHAPTER 9: BLOCK-CIPHERS: LUCIFER, DES, AND AES.
9.1 LUCIFER.
9.2 DES.
9.3 The DES S-Boxes, P-Box, and Initial Permutation (IP).
9.4 DES Key Schedule.
9.5 Sample DES Encipherment.
9.6 Chaining.
9.7 Is DES a Random Mapping?
9.8 DES in the Output-Feedback Mode (OFB).
9.9 Cryptanalysis of DES.
9.10 Differential Cryptanalysis.
9.11 The EFS DES-Cracker.
9.12 What Now?
9.13 The Future Advanced Data Encryption Standard.
9.14 And the Winner Is!
9.15 The Rijndael Operations.
9.16 The Rijndael Cipher.
9.17 Rijndael’s Strength: Propagation of Patterns.
9.18 When is a Product Block-Cipher Secure?
9.19 Generating the Symmetric Group.
9.20 A Class of Block Ciphers.
9.21 The IDEA Block Cipher.
CHAPTER 10: THE PARADIGM OF PUBLIC KEY CRYPTOGRAPHY.
10.1 In the Beginning. . . .
10.2 Key Distribution.
10.3 E-Commerce.
10.4 Public-Key Cryptosystems: Easy and Hard Computational Problems.
10.5 Do PKCS Solve the Problem of Key Distribution?
10.6 P.S.
CHAPTER 11: THE KNAPSACK CRYPTOSYSTEM.
11.1 Subset Sum and Knapsack Problems.
11.2 Modular Arithmetic and the Euclidean Algorithm.
11.3 A Modular Arithmetic Knapsack Problem.
11.4 Trap-Door Knapsacks.
11.5 Knapsack Encipherment and Decipherment of ASCII-Plaintext.
11.6 Cryptanalysis of the Merkle–Hellman Knapsack System (Modular Mapping).
11.7 Diophantine Approximation.
11.8 Short Vectors in a Lattice.
11.9 Knapsack-Like Cryptosystems.
11.10 Knapsack Cryptosystem Problems.
CHAPTER 12: THE RSA CRYPTOSYSTEM.
12.1 A Short Number-Theoretic Digression.
12.2 RSA.
12.3 The RSA Encipherment and Decipherment of ASCII-Plaintext.
12.4 Attack on RSA.
12.5 Williams Variation of RSA.
12.6 Multiprecision Modular Arithmetic.
CHAPTER 13: PRIME NUMBERS AND FACTORIZATION.
13.1 Number Theory and Cryptography.
13.2 Prime Numbers and the Sieve of Eratosthenes.
13.3 Pollard’s p 2 1 Method.
13.4 Pollard’s r-Algorithm.
13.5 Quadratic Residues.
13.6 Random Factorization.
13.7 The Quadratic Sieve (QS).
13.8 Testing if an Integer is a Prime.
13.9 The RSA Challenge.
13.10 Perfect Numbers and the Mersenne Primes.
13.11 Multiprecision Arithmetic.
13.12 Prime Number Testing and Factorization Problems.
CHAPTER 14: THE DISCRETE LOGARITHM PROBLEM.
14.1 The Discrete Logarithm Problem Modulo p.
14.2 Solution of the DLP Modulo p Given a Factorization of p - 1.
14.3 Adelman’s Subexponential Algorithm for the Discrete Logarithm Problem.
14.4 The Baby-Step, Giant-Step Algorithm.
14.5 The Index-Calculus Method.
14.6 Pollard’s ρ-Algorithm.
14.7 Extension Fields.
14.8 The Current State of Discrete Logarithm Research.
CHAPTER 15: ELLIPTIC CURVE CRYPTOGRAPHY.
15.1 Elliptic Curves.
15.2 The Elliptic Group over the Reals.
15.3 Lenstra’s Factorization Algorithm.
15.4 The Elliptic Group over Zp ( p > 3).
15.5 Elliptic Groups over the Field Zm,2.
15.6 Computations in the Elliptic Group EZm,2(a, b).
15.7 Supersingular Elliptic Curves.
15.8 Diffie–Hellman Key Exchange Using an Elliptic Curve.
15.9 The Menezes–Vanstone Elliptic Curve Cryptosystem.
15.10 The Elliptic Curve Digital Signature Algorithm.
15.11 The Certicom Challenge.
15.12 NSA and Elliptic Curve Cryptography.
CHAPTER 16: KEY EXCHANGE IN A NETWORK.
16.1 Key Distribution in a Network.
16.2 U.S. Patent ’770.
16.3 Spoofing.
16.4 El Gamal’s Extension of Diffie–Hellman.
16.5 Shamir’s Autonomous Key Exchange.
16.6 X9.17 Key Exchange Architecture.
16.7 The Needham–Schroeder Key Distribution Protocol.
CHAPTER 17: DIGITAL SIGNATURES AND AUTHENTICATION.
17.1 The Need for Signatures.
17.2 Threats to Network Transactions.
17.3 Secrecy, Digital Signatures, and Authentication.
17.4 The Desiderata of a Digital Signature.
17.5 Public-Key Cryptography and Signature Systems.
17.6 Rabin’s Quadratic Residue Signature Protocol.
17.7 Hash Functions.
17.8 MD5.
17.9 The Secure Hash Algorithm.
17.10 NIST’s Digital Signature Algorithm.
17.11 El Gamal’s Signature Protocol.
17.12 The Fiat–Shamir Identification and Signature Schema.
17.13 The Oblivious Transfer.
CHAPTER 18: APPLICATIONS OF CRYPTOGRAPHY.
18.1 UNIX Password Encipherment.
18.2 Magnetic Stripe Technology.
18.3 Protecting ATM Transactions.
18.4 Keyed-Access Cards.
18.5 Smart Cards.
18.6 Who Can You Trust?: Kohnfelder’s Certificates.
18.7 X.509 Certificates.
18.8 The Secure Socket Layer (SSL).
18.9 Making a Secure Credit Card Payment on the Web.
CHAPTER 19: CRYPTOGRAPHIC PATENTS.
19.1 What is a Patent?
19.2 Patentability of Ideas.
19.3 The Format of a Patent.
19.4 Patentable versus Nonpatentable Subjects.
19.5 Infringement.
19.6 The Role of Patents in Cryptography.
19.7 U.S. Patent 3,543,904.
19.8 U.S. Patent 4,200,770.
19.9 U.S. Patent 4,218,582.
19.10 U.S. Patent 4,405,829.
19.11 PKS/RSADSI Litigation.
19.12 Leon Stambler.
INDEX.
商品描述(中文翻譯)
**描述**
**獲得創建有效數據安全系統所需的技能和知識**
本書更新了讀者所需的所有工具、技術和概念，以理解和實施數據安全系統。它涵蓋了廣泛的主題，以徹底理解影響保密性、身份驗證和數位簽名方案效率的因素。最重要的是，讀者獲得了密碼分析的實踐經驗，並學會如何創建有效的加密系統。
作者參與了數據加密標準（Data Encryption Standard, DES）的設計和分析，這是一種廣泛使用的對稱密鑰加密算法。他的建議基於對有效和無效方法的第一手經驗。
本書內容全面，首先討論密碼學的歷史，包括基本加密系統的描述以及二十世紀使用的許多密碼系統。然後，作者討論對稱密鑰和公鑰密碼學的理論。讀者不僅會發現密碼學如何保護敏感數據，還會了解該技術的實際限制。本書以兩章結束，探討各種密碼學應用。
為了促進學習，本書包含三種類型的章節：
- 發展技術技能的章節
- 描述密碼系統並提供分析方法的章節
- 描述密碼系統、提供分析方法並提供問題以測試您對材料的掌握和實施實際解決方案能力的章節
隨著消費者對身份盜竊的警惕性日益提高，企業也在努力開發安全的系統，本書對於電子商務和信息技術專業人士來說是必讀之作。由一位教授撰寫，他教授密碼學，這本書對學生也非常理想。
**目錄**
前言
序言
關於作者
第一章：開胃菜
1.1 密碼學詞彙
1.2 密碼系統
1.3 密碼分析
1.4 側面信息
1.5 湯瑪斯·傑佛遜與 M-94
1.6 密碼學與歷史
1.7 密碼學與計算機
1.8 國家安全局
1.9 巨人
1.10 無性、金錢、犯罪或……愛
1.11 密碼分析中的推理過程示例
1.12 警告！
第二章：列轉置
2.1 香農的保密變換分類
2.2 列轉置加密的規則
2.3 竊取
2.4 竊取示例
2.5 明文語言模型
2.6 計算 k-grams
2.7 從滑動窗口計數中推導馬爾可夫模型的參數
2.8 馬爾可夫評分
2.9 ADFGVX 轉置系統
2.10 CODA
2.11 列轉置問題
第三章：單字母替換
3.1 單字母替換
3.2 凱薩密碼
3.3 使用同構體的竊取
3.4 假設的 x² 測試
3.5 從同構體表中修剪
3.6 單字母替換的部分最大似然估計
3.7 隱馬爾可夫模型（HMM）
3.8 ASCII N-grams 的希爾加密
3.9 高斯消元
3.10 單字母替換問題
第四章：多字母替換
4.1 運行密鑰
4.2 布萊茲·德·維根爾
4.3 吉爾伯特·S·維納姆
4.4 一次性密碼本
4.5 通過相關性找到已知周期的維納姆-維根爾密文的密鑰
4.6 重合
4.7 Venona
4.8 多字母替換問題
第五章：統計測試
5.1 密碼系統中的弱點
5.2 科爾莫哥洛夫-斯米爾諾夫測試
5.3 NIST 提出的統計測試
5.4 診斷
5.5 統計測試問題
第六章：密碼機的出現
6.1 轉子
6.2 轉子系統
6.3 轉子專利
6.4 共軛的特徵性質
6.5 1-轉子系統的分析：僅密文
6.6 排列的位移序列
6.7 亞瑟·謝比烏斯
6.8 恩尼格瑪密鑰分配協議
6.9 恩尼格瑪的密碼分析
6.10 竊取恩尼格瑪密文
6.11 洛倫茲密鑰附加
6.12 SZ40 鈕輪
6.13 SZ40 密碼分析問題
6.14 竊取 SZ40 密文
第七章：日本密碼機
7.1 日本信號約定
7.2 半轉子
7.3 RED 機的組件
7.4 竊取 RED 密文
7.5 一般化的元音和輔音
7.6 “攀登伊塔卡山”——戰爭！
7.7 PURPLE 機的組件
7.8 PURPLE 鍵
7.9 竊取 PURPLE：尋找 V-步進器
7.10 竊取 PURPLE：尋找 C-步進器
第八章：流密碼
8.1 流密碼
8.2 反饋移位寄存器
8.3 Z₂ 上的多項式代數
8.4 線性反饋移位寄存器的特徵多項式
8.5 最大長度 LFSR 序列的性質
8.6 線性等價
8.7 組合多個線性反饋移位寄存器
8.8 LFSR 的矩陣表示
8.9 竊取流加密的 ASCII 明文
8.10 非線性反饋移位寄存器
8.11 非線性密鑰流生成
8.12 不規則時鐘
8.13 RC4
8.14 流加密問題
第九章：區塊密碼：LUCIFER、DES 和 AES
9.1 LUCIFER
9.2 DES
9.3 DES 的 S-盒、P-盒和初始置換（IP）
9.4 DES 密鑰排程
9.5 DES 加密示例
9.6 鏈接
9.7 DES 是隨機映射嗎？
9.8 DES 在輸出反饋模式（OFB）中的應用
9.9 DES 的密碼分析
9.10 差分密碼分析
9.11 EFS DES 破解器
9.12 現在該怎麼辦？
9.13 未來的高級數據加密標準
9.14 獲勝者是！
9.15 Rijndael 操作
9.16 Rijndael 密碼
9.17 Rijndael 的強度：模式的傳播
9.18 什麼時候產品區塊密碼是安全的？
9.19 生成對稱群
9.20 一類區塊密碼
9.21 IDEA 區塊密碼
第十章：公鑰密碼學的範式
10.1 在開始時……
10.2 密鑰分配
10.3 電子商務
10.4 公鑰密碼系統：簡單和困難的計算問題
10.5 PKCS 是否解決了密鑰分配問題？
10.6 附註
第十一章：背包密碼系統
11.1 子集和背包問題
11.2 模運算和歐幾里得算法
11.3 一個模運算背包問題
11.4 陷門背包
11.5 背包加密和 ASCII 明文的解密
11.6 Merkle-Hellman 背包系統的密碼分析（模映射）
11.7 迪奧方近似
11.8 格中的短向量
11.9 類似背包的密碼系統
11.10 背包密碼系統問題
第十二章：RSA 密碼系統
12.1 簡短的數論插曲
12.2 RSA
12.3 RSA 對 ASCII 明文的加密和解密
12.4 對 RSA 的攻擊
12.5 威廉斯變體的 RSA
12.6 多精度模運算
第十三章：質數和因式分解
13.1 數論與密碼學
13.2 質數和埃拉托斯特尼篩法
13.3 波拉德的 p²-1 方法
13.4 波拉德的 r-算法
13.5 二次剩餘
13.6 隨機因式分解
13.7 二次篩法（QS）
13.8 測試整數是否為質數
13.9 RSA 挑戰
13.10 完美數和梅森質數
13.11 多精度算術
13.12 質數測試和因式分解問題
第十四章：離散對數問題
14.1 模 p 的離散對數問題
14.2 給定 p-1 的因式分解，DLP 模 p 的解
14.3 阿德爾曼的次指數算法解決離散對數問題
14.4 嬰兒步驟、巨人步驟算法
14.5 指數微積分法
14.6 波拉德的 ρ-算法
14.7 擴展域
14.8 離散對數研究的當前狀態
第十五章：橢圓曲線密碼學
15.1 橢圓曲線
15.2 實數上的橢圓群
15.3 蓮斯特拉的因式分解算法
15.4 Zp 上的橢圓群（p > 3）
15.5 Zm,2 上的橢圓群
15.6 在橢圓群 EZm,2(a, b) 中的計算
15.7 超奇異橢圓曲線
15.8 使用橢圓曲線的迪菲-赫爾曼密鑰交換
15.9 梅內茲-范斯通橢圓曲線密碼系統
15.10 橢圓曲線數位簽名算法
15.11 Certicom 挑戰
15.12 NSA 和橢圓曲線密碼學
第十六章：網絡中的密鑰交換
16.1 網絡中的密鑰分配
16.2 美國專利 '770
16.3 偽造
16.4 El Gamal 的迪菲-赫爾曼擴展
16.5 Shamir 的自主密鑰交換
16.6 X9.17 密鑰交換架構
16.7 Needham-Schroeder 密鑰分配協議
第十七章：數位簽名和身份驗證
17.1 簽名的必要性
17.2 對網絡交易的威脅
17.3 保密性、數位簽名和身份驗證
17.4 數位簽名的期望
17.5 公鑰密碼學和簽名系統
17.6 拉賓的二次剩餘簽名協議
17.7 哈希函數
17.8 MD5
17.9 安全哈希算法
17.10 NIST 的數位簽名算法
17.11 El Gamal 的簽名協議
17.12 Fiat-Shamir 身份驗證和簽名方案
17.13 遺忘轉移
第十八章：密碼學的應用
18.1 UNIX 密碼加密
18.2 磁條技術
18.3 保護 ATM 交易
18.4 鍵控訪問卡
18.5 智能卡
18.6 誰可以信任你？：Kohnfelder 的證書
18.7 X.509 證書
18.8 安全套接字層（SSL）
18.9 在網上進行安全的信用卡支付
第十九章：密碼學專利
19.1 什麼是專利？
19.2 想法的專利性
19.3 專利的格式
