LEADER 00000cam 2200829Mi 4500
001 ocn972159290
003 OCoLC
005 20210605051553.4
006 m o d
007 cr |n|||||||||
008 160405s2017 njua ob 001 0 eng d
020 1400885620|q(ebk)
020 9781400885626
020 9780691184555|q(electronic book)
020 0691184550|q(electronic book)
020 |z0691141754
020 |z9780691141756
024 7 10.1515/9781400885626|2doi
024 8 99974545040
035 (OCoLC)972159290|z(OCoLC)967393172|z(OCoLC)971594292
|z(OCoLC)971914236|z(OCoLC)972138720|z(OCoLC)972289002
|z(OCoLC)972426978|z(OCoLC)972573030|z(OCoLC)972743122
|z(OCoLC)973896979|z(OCoLC)974034290|z(OCoLC)974331501
|z(OCoLC)974462901|z(OCoLC)976306431|z(OCoLC)979756664
|z(OCoLC)986667845|z(OCoLC)986851510|z(OCoLC)991214663
|z(OCoLC)992868640|z(OCoLC)993448199|z(OCoLC)993652387
|z(OCoLC)1013775515|z(OCoLC)1024109396|z(OCoLC)1030802197
|z(OCoLC)1035645604|z(OCoLC)1036096783|z(OCoLC)1042475879
|z(OCoLC)1050718744|z(OCoLC)1076566075
040 IDEBK|beng|erda|epn|cIDEBK|dOCLCO|dOCLCQ|dYDX|dN$T|dEBLCP
|dMERUC|dIDEBK|dUAB|dOCLCA|dOCLCQ|dIHT|dDEGRU|dOCLCA
|dOCLCQ|dOCLCO|dOCLCA|dINT|dOCLCQ|dTKN|dYDXIT|dJSTOR
|dOCLCQ|dMM9|dUKAHL|dOCLCQ
049 MAIN
050 4 Z103|b.H664 2017eb
082 04 005.8/2|223
100 1 Holden, Joshua,|d1970-|eauthor.
245 14 The mathematics of secrets :|bcryptography from Caesar
ciphers to digital encryption /|cJoshua Holden.
264 1 Princeton :|bPrinceton University Press,|c[2017]
300 1 online resource (xiv, 373 pages) :|billustrations
336 text|btxt|2rdacontent
337 computer|bc|2rdamedia
338 online resource|bcr|2rdacarrier
347 text file|bPDF|2rda
505 00 |tIntroduction to ciphers and substitution.|tAlice and Bob
and Carl and Julius: terminology and Caesar Cipher ;|tThe
key to the matter: generalizing the Caesar Cipher ;
|tMultiplicative ciphers ;|tAffine ciphers ;|tAttack at
dawn: cryptanalysis of sample substitution ciphers ;|tJust
to get up that hill: polygraphic substitution ciphers ;
|tKnown-plaintext attacks ;|tLooking forward --
|tPolyalphabetic substitution ciphers.|tHomophonic ciphers
;|tCoincidence or conspiracy? ;|tAlberti ciphers ;|tIt's
hip to be square: Tabula Recta or Vigenère Square ciphers
;|tHow many is many? ;|tDetermining the number of
alphabets ;|tSuperman is staying for dinner:
superimposition and reduction ;|tProducts of
polyalphabetic ciphers ;|tPinwheel machines and rotor
machines ;|tLooking forward --|tTransposition ciphers.
|tThis is Sparta! The Scytale ;|tRails and routes:
geometric transposition ciphers ;|tPermutations and
permutation ciphers ;|tPermutation products ;|tKeyed
columnar transposition ciphers ;|tDetermining the width of
the rectangle ;|tAnagramming ;|tLooking forward --
|tCiphers and computers.|tBringing home the bacon:
polyliteral ciphers and binary numerals ;|tFractionating
ciphers ;|tHow to design a digital cipher: SP-networks and
feistel networks ;|tThe data encryption standard ;|tThe
advanced encryption standard ;|tLooking forward --|tStream
ciphers.|tRunning-key ciphers ;|tOne-time pads ;|tBaby you
can drive my car: autokey ciphers ;|tLinear feedback shift
registers ;|tAdding nonlinearity to LFSRs ;|tLooking
forward --|tCiphers involving exponentiation.|tEncrypting
using exponentiation ;|tFermat's little theorem ;
|tDecrypting using exponentiation ;|tThe discrete
logarithm problem ;|tComposite moduli ;|tThe Euler Phi
function ;|tDecryption with composite moduli ;|tLooking
forward --|tPublic-key ciphers.|tRight out in public: the
idea of public-key ciphers ;|tDiffie-Hellman key agreement
;|tAsymmetric-key cryptography ;|tRSA ;|tPriming the pump:
primality testing ;|tWhy is RSA a (Good) public-key
system? ;|tCryptanalysis of RSA ;|tLooking forward --
|tOther public-key systems.|tThe three-pass protocol ;
|tElGamal ;|tElliptic curve cryptography ;|tDigital
signatures ;|tLooking forward --|tThe future of
cryptography.|tQuantum computing ;|tPostquantum
cryptogaphy ;|tQuantum cryptography ;|tLooking forward.
546 In English.
650 0 Cryptography|xMathematics.
650 0 Ciphers.
650 0 Computer security.
776 08 |iPrint version:|z9781400885626
856 40 |uhttps://hull.idm.oclc.org/login?url=https://
www.jstor.org/stable/10.2307/j.ctvc775xv
921 .
936 JSTOR-E-2020/21
