Cryptography Demystified
John Hershey
- 出版商: McGraw-Hill Education
- 出版日期: 2002-09-13
- 售價: $2,190
- 貴賓價: 9.5 折 $2,081
- 語言: 英文
- 頁數: 356
- 裝訂: Paperback
- ISBN: 0071406387
- ISBN-13: 9780071406383
-
相關分類:
資訊安全
海外代購書籍(需單獨結帳)
買這商品的人也買了...
-
$855Digital Systems Design Using VHDL
-
$400$316 -
$650$553 -
$490$417 -
$780$624 -
$1,850$1,758 -
$199$179 -
$380$342 -
$690$587 -
$490$382 -
$490$382 -
$945Head First EJB: Passing the Sun Certified Business Component Developer Exam
-
$720$569 -
$650$553 -
$650$553 -
$590$531 -
$650$553 -
$1,650$1,568 -
$620$558 -
$420$328 -
$650$553 -
$860$731 -
$560$442 -
$450$383 -
$650$553
商品描述
Cryptography is not just for specialists. Now every wireless message,
wireless phone call, online transaction, and email is encrypted at one end and
decrypted at the other. “Crypto” is part of the job description for network
designers, network engineers, and telecom developers. If you need cryptography
basics—but dread the thick tomes that are your only other option—help is at
hand. Cryptography Demystified puts the fundamentals into a 35-module,
learn-by-doing package that’s actually fun to use.
You must read this book if—
* You prefer your
simplifications from an expert who understands the complexities
* 6
years of success as a short course for students and professionals works for
you
* you enjoy hearing the phrase “nothing to memorize”
*
ecommerce, email, network security, or wireless communications is part of your
bailiwick
* cracking cryptography means a jump up the career
ladder
* the words “public-key cryptography,” “channel-based
cryptography,” and “prime numbers” pique your interest
* best-practices
cryptography is the only secure way for you—and your company—to go
One of the most complex subjects in Information Technology, cryptography
gets its due in this down-to-earth, self-teaching tutorial—the first to make the
basics of the science truly accessible.
Contents
Part I: INTRODUCTION TO SYMMETRIC
CRYPTOGRAPHY
Module 1 First
Considerations
Exercise 1
Module 2 Plaintext
Exercise
2
Module 3 Digitization of
Plaintext
Exercise 3
Module
4 Toward a Cryptographic Paradigm
Exercise
4
Module 5 What We Want from the
Keytext
Exercise 5
Module 6
Randomness I
Exercise 6
Module 7 Finite State Sequential Machines
Exercise
7 Transition Matrix
Module 8
m-sequences
Exercise 8
Module 9 The Paradigm Attempted
Exercise
9
Module 10 The Block Cipher Function - A Modern
Keystone
to the Paradigm
Exercise
10
Module 11 Confidentiality Modes: ECB and
CTR
Exercise 11
Module 12
Confidentiality Mode: Output Feedback (OFB)
Exercise 12
Module 13 Confidentiality Modes: Cipher
Feedback (CFB)
and Cipher Block Chaining (CBC)
Exercise 13
Part II NUMBER THEORY WE WILL
NEED
Module 14 Prime Numbers
I
Exercise 14
Module 15
Congruences
Exercise 15
Module 16 Euler-Fermat Theorem
Exercise
16
Module 17 The Euler Phi (f)
Function
Exercise 17
Module
18 The Binary Exponentiation Algorithm
Exercise
18
Module 19 The Extended Euclidean
Algorithm
Exercise 19
Module
20 Primitive Roots
Exercise
20
Module 21 Chinese Remainder
Theorem
Exercise 21
Part III
INTRODUCTION TO PUBLIC KEY CRYPTOGRAPHY
Module 22
Merkles Puzzle
Exercise 22
Module 23 The Diffie-Hellman Public Key Cryptographic
System
Exercise 23
Module 24
Split Search
Exercise 24
Module 25 A Variant of the Diffie-Hellman System
Exercise 25
Module 26 The RSA Public Key Cryptographic
System
Exercise 26
Module 27
Prime Numbers II
Exercise 27
Part
IV KEYING VARIABLES
Module 28 Keying Variable
Distribution
Exercise 28
Module 29 Secret Sharing
Exercise
29
Module 30 Randomness II
Exercise 30
Module 31
Cryptovariables
Exercise 31
Part V
CRYPTO-OBSOLESCENCE
Module 32 The Aging
Cryptoalgorithm
Exercise 32
Module 33 SUPERDES(tm