Cryptography Reference
In-Depth Information
chapter. Most mathematical introductions to cryptography such as Menezes,
van Oorschot and Vanstone [123] and Stinson [185] provide more technical
details including, for example, details of the Extended Euclidean Algorithm.
Several mathematical introductions to cryptography such as Pipher, Hoffstein and
Silverman [100] and Smart [178] have a particular focus on public-key cryptography.
All these topics also provide information on how to generate large primes for use in
practical public-key cryptosystems, which is a topic that we have not discussed.
The paper by Diffie and Hellman [59] that first introduced the world to
the idea of public-key cryptography is quite accessible. Also fascinating from a
historical perspective is Diffie's personal account of the first ten years of public-
key cryptography [58]. The idea behind RSA was first published by Rivest, Shamir
and Adleman [163] in 1978. A survey of attacks on RSA is provided by Boneh [39].
Further technical details on how to implement RSA are provided by the Public-Key
Cryptography Standards (PKCS) [115]. The first of these standards PKCS#1 includes
details of RSA-OAEP, which is one of the most popular methods of implementing
RSA. ISO/IEC 18033 [12] includes public-key encryption and standards for hybrid
encryption. Dent and Mitchell [55] include a good overview of these and other
relevant standards.
The ElGamal cryptosystem was published by ElGamal [68]. The background
mathematics behind elliptic curve cryptography can be found in many general texts
such asMollin [125] and Stinson [185], however, Koblitz [109] andWashington [196]
have very detailed introductions. Those seeking information about implementing
elliptic curve cryptography should consult Hankerson, Menezes and Vanstone [96].
An alternative source of information is the ECC Tutorial from Certicom [45].
Commercial standards for elliptic curve cryptography are developed by the
Standards for Efficient Cryptography Group (SECG) [172] and are also defined in
ISO/IEC 15946 [10].
A portal for comparing advice on key lengths for public-key cryptosystems is
provided by Giry [89]. Moses [126] is a short position paper on the likely impact
of quantum computing on the future of cryptography. A more technical survey of
public-key cryptosystems that are resistant to quantum computers is Perlner and
Cooper [156]. One such scheme called NTRU is described in the draft standard IEEE
P1363.1 [147]. CrypTool [52] has an implementation of RSA and a good simulation
of hybrid encryption.
5.8 Activities
1 . The briefcase protocol depicted in Figure 5.1 shows that it is possible to
exchange a confidential message between two entities who have not shared
a key.
(a) Design a cryptographic analogy of the briefcase protocol that uses
symmetric encryption instead of locking the briefcase with a padlock.
 
Search WWH ::




Custom Search