Elementary cryptanalysis
In this introduction, Professor Sinkov explains some of the fundamental techniques at the basis of cryptanalytic endeavour from which much more sophisticated techniques have evolved, especially since the advent of computers.
Read More ↓Title Statements
- Full title :Elementary cryptanalysis / by Abraham Sinkov.
Summary
In this introduction, Professor Sinkov explains some of the fundamental techniques at the basis of cryptanalytic endeavour from which much more sophisticated techniques have evolved, especially since the advent of computers.
Read More ↓Edition Statements
- Publication Date:2009.
- Edition:2nd ed
Publication Statements
- Publisher(s):Cambridge University Press [distributor], Mathematical Association of America
- Place of Publication:Washington, D.C
- Language:eng
- Publication Date:2009.
Notes
Previous edition: Cambridge: Cambridge University Press, 1998.
The Physical Object
- Description:xiv, 212 pages : : illustrations ; : 24 cm
Edition Identifiers
- ISBN:9780883856475, 0883856476
- oclc:on1081064852
- LC Classification:Z104
- Dewey Decimal:652.8/0151
Table of Contents
pt. 1. Monoalphabetic ciphers using additive alphabets. The Caesar cipher -- Modular arithmetic -- Additive alphabets -- Solution of additive alphabets -- Frequency considerations -- Multiplications -- Solution of multiplicative alphabets -- Affine ciphers -- pt. 2. General monoalphabetic substitution . Mixed alphabets -- Solution of mixed alphabet ciphers -- Solution of five-letter groupings -- Monoalphabets with symbols -- pt. 3. Polyalphabetic substitution. Polyalphabetic ciphers -- Recognition of polyalphabetic ciphers -- Determination of number of alphabets -- Solutions of additive subalphabets -- Mixed plain sequences -- Matching alphabets -- Reduction to a monoalphabet -- Mixed cipher sequences -- General comments
pt. 4. Polygraphic systems. Linear transformations -- Multiplication of matrices -- inverses -- Involutory transformations -- Recognition of digraphic ciphers -- Solution of a linear transformation -- How to make the Hill system more secure -- pt. 5. Transposition. Columnar transposition -- Completely filled rectangles -- Incompletely filled rectangles -- Probable word method -- General case -- Identical length messages -- pt. 6. RSA encryption. Public-key encryp…
Subjects
Writers
More from this Series
No reviews yet. Be the first to rate this work.
Related Works
more →
Next-generation cryptography algorithms explained: get to grips with new-age cryptography …
Bertaccini, Massimo
Discrete algebraic methods: arithmetic, cryptography, automata and …
Hertrampf, Ulrich
Files & Downloads
No downloadable files are registered for this work yet.
Rate & Review