A Survey of Digital Signature Schemes

Cryptography, in the computer context, is the act of storing information in a form which allows it to be revealed to those who have a need or a right to see it, while at the same time hiding it from all of those who have no right or need to see it. The state of the art method of accomplishing this today is by the use of a coherent "crypto system" which includes both encryption (cryptography) and decryption (cryptoanalysis). In both of these aspects, we are concerned with the original information -- referred to as "plaintext". When this plaintext is converted into hidden ciphers, then the text becomes known as "ciphertext."

The act of converting plain text into ciphertext is known as "encryption" and it works like this. Let us assume that we have the following plaintext message:

The simplest form of encryption would be to substitute a number for a letter using a basic number table.

Using this kind of grid, A = 11, B=21, U=33 and so on (Edwards, 2001; Shimover & Ball, 2002).

Using this system, "Good/ Morning/ America" would become

"71 62 62 41/ 42 62 92 52 91 52 62 11 42 51 92 91 31 11" When the phrase "Good Morning America" is encrypted in this example to "716262414262925291526211425192913111" the coded string is known as "ciphertext". This ciphertext could then be sent as an electronic signal to

. . .
create a global registry of public keys. PGP is one of the most common ways to protect messages on the Internet because it is effective, easy to use, and free. To encrypt a message using PGP, it is essential to have the PGP encryption package, which is available for free from a number of sources. The official repository is at the Massachusetts Institute of Technology (Brands, 2000). PGP is such an effective encryption tool that the U.S. government actually brought a lawsuit against Zimmerman (the inventor) for putting it in the public domain and hence making it available to enemies of the U.S. After a public outcry, the U.S. lawsuit was dropped, but it is still illegal to use PGP in many other countries. Relation Between Schemes and Primes Since all schemes for digital signatures rely on numbers and number combinations, then it follows that computer programmers who were searching for ways to create random and secure algorithms would turn to prime number theory(Crandall & Pomerance, 2001). Both mathematicians and programmers have an affinity for problem solving definitions. Definitions are made for two reasons. Sometimes a mathematician makes a definition in order to have a simple shorthand term for a more complicated obj
. . .

Some common words found in the essay are:
Crandall Pomerance, Using DH, Encryption Systems, Piper Murphy, Kideki Hartmanis, Algorithms Hash, Morning America, Forrester Research, Schemes Primes, Shamir Adelman, public key, pomerance 2001, digital signatures, crandall pomerance, na na, crandall pomerance 2001, encryption algorithm, piper murphy, 2 3, schneier 1995, signature schemes, piper murphy 2002, york john wiley, 1998 schneier 1995, john wiley sons,
Approximate Word count = 3006
Approximate Pages = 12 (250 words per page)

More Essays on A Survey of Digital Signature Schemes