G. Simmons, Contemporary cryptology: The science of information integrity, IEEE Press, pp. 257--258, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....range of more advanced questions, ranging from the authorization of user access to computer systems over secure electronic voting schemes to the realization of untraceable electronic cash. Surveys of contemporary cryptography are available in a number of reference works [MvOV97, Sti95, Gol95, Sim91, Riv90] The roots of cryptography can be traced back to the invention of writing. The Roman emperor Caesar devised a simple encryption scheme that still bears his name today [Kah67] Cryptography as a science originates with the seminal work of Shannon that laid the foundations for information ....

Gustavus J. Simmons (ed.), Contemporary cryptology: The science of information integrity, IEEE Press, 1991.

....Elliptic Curve Cryptography While the 20 year history of public key cryptography has seen a diverse range of proposals for candidate hard problems, only two have stood the test of time. These problems are known as the discrete logarithm problem over a nite eld and integer factorization [44, 52]. In 1985, Neal Koblitz [28] and V.S. Miller [36] independently proposed using elliptic curves for public key cryptosystems. They did not invent a new cryptographic algorithm with elliptic curves over nite elds, but they implemented existing algorithms, like Di e Hellman, using elliptic curves ....

G.J. Simmons. Contemporary Cryptology - The Science of Information Integrity, 1992.

....proposed by Wegman and Carter [80] uses a special class of hash functions together with a one time pad of random numbers. This construction is discussed in more detail in Section 5. 3 Computationally secure systems The study of computationally secure A systems is relatively informal, cf. Simmons [67]. The basic framework is similar to unconditionally secure systems. A simple computationally secure A code can be obtained by considering S = GF(2 40 ) and M = GF(2 64 ) We use E to be the the collection of DES [51] encryption functions and so E = 2 56 . To construct the codeword ....

G. J. Simmons. A survey of information authentication. Contemporary Cryptology: The Science of Information Integrity, IEEE Press, 1992, pp. 379-419.

....how this attack can be blocked. V. A basic theory of steganography This leads naturally to the question of whether we can develop a comprehensive theory of information hiding, in the sense that Shannon provided us with a theory of secrecy systems [121] and Simmons of authentication systems [122]. Quite apart from intellectual curiosity, there is a strong practical reason to seek constructions whose security is mathematically provable. This is because copyright protection mechanisms may be subjected to attack over an extraordinarily long period of time. Copyright subsists for typically ....

....to contain short messages. This exploitation of existing randomness means that the message cannot even in principle be detected and so Simmons called the technique the subliminal channel . The history of the subliminal channel is described in [124] while further results may be found in [122], 125] 126] 127] In the general case of steganography, where Willie is allowed to modify the information flow between Alice and Bob, he is called an active warden; but if he can only observe it he is called a passive warden. Further studies showed that public key steganography is possible ....

G. J. Simmons, ed., Contemporary Cryptology -- The Science of Information Integrity . New York, New York, U.S.A.: IEEE Press, 1992.

....how this attack can be blocked. V. A BASIC THEORY OF STEGANOGRAPHY This leads naturally to the question of whether we can develop a comprehensive theory of information hiding, in the sense that Shannon provided us with a theory of secrecy systems [122] and Simmons of authentication systems [123]. Quite apart from intellectual curiosity, there is a strong practical reason to seek constructions whose security is mathematically provable. This is because copyright protection mechanisms may be subjected to attack over an extraordinarily long period of time. Copyright subsists for typically ....

....to contain short messages. This exploitation of existing randomness means that the message cannot even in principle be detected, and so Simmons called the technique the subliminal channel. The history of the subliminal channel is described in [125] while further results may be found in [123], 126] 128] In the general case of steganography, where Willie is allowed to modify the information flow between Alice and Bob, he is called an active warden; but if he can only observe it he is called a passive warden. Further studies showed that public key steganography is possible (in this ....

G. J. Simmons, Ed., Contemporary Cryptology---The Science of Information Integrity. New York: IEEE Press, 1992.

....bits of the binary string resulting from the substitution phase are permuted (for example, the block 011100 may become 100110 under a transposition transformation) 9 The same description applies to an iteration of D. An example of a symmetric cryptosystem is the Data Encryption Standard (DES) [48, 58, 60, 64]. Here, M and C are each 64 bits long, K has 56 bits, and one iteration consisting of 16 rounds is performed. Usually, the number of iterations (and hence the total number of rounds) depends on the length of the key. The longer is the key used, the larger is the number of iterations possible. For ....

....for more iterations of the encryption function E. A similar transformation is used to describe an iteration of D. The preceding description of an iteration of E is representative of asymmetric encryption and is inspired by the Rivest Shamir Adleman (RSA) cryptosystem, named after its inventors [48, 58, 60, 64]. Modern cryptography is founded on the principle that it should be computationally hard to obtain the plaintext from the ciphertext without knowledge of the decryption key. For most cryptosystems (symmetric and asymmetric) a necessary and often sufficient condition for achieving this goal is to ....

[Article contains additional citation context not shown here]

G.J. Simmons, Contemporary Cryptology: The Science of Information Integrity , IEEE Press, Piscataway, New Jersey, 1992.

....secrets, as a key, but only with public information. It checks that the card possesses a secret stored in it by an appropriate authority or by the service provider itself in case of a monopolistic system. Using known algorithms such as RSA [RSA78] DSS (Digital Signature Standard) or El Gamal (see [Sim92]) it is easy for the card to authenticate itself and to guarantee the integrity of the amount of money to pay. Unfortunately, the price to be paid is heavy computations involving large numbers, typically 512 or even 768 bits. To authenticate using RSA, for example, the card must sign a random ....

....To authenticate using RSA, for example, the card must sign a random number sent by the terminal with its secret key. It is equivalent to approximately 1; 600; 000 16 Theta 16 bit multiplications on 512 bit operands. Recent zero knowledge identification scheme such as the Fiat Shamir (FS) see [Sim92]) or the Guillou Quisquater (GQ) GQ90] schemes are much more suited for smart cards applications. Table 1 compares the different characteristics of these algorithms in terms of speed, amount of bits exchanged between the terminal and the card, size of the RAM for intermediate computations and ....

[Article contains additional citation context not shown here]

G. Simmons, editor. Contemporary cryptology: The Science of information Integrity. IEEE Press, New York, 1992.

....p and q, and which is defined as follows. Define J : X (p 1) 2 mod p) X (q 1) 2 mod q) If J = 1 or J = pq p q 1) then (X n) 1. Otherwise, X n) 1. Note that the Jacobi symbol can efficiently be computed without the prime factors of n (for example, see Informative Reference [5] in Annex G) xx Any value xxvi ICC Card Specification for Payment Systems June 30, 1996 THIS PAGE LEFT INTENTIONALLY BLANK Part I Electromechanical Characteristics, Logical Interface, and Transmission Protocols June 30, 1996 Part I Electromechanical Characteristics and Protocols I 1 1. ....

G. J. Simmons Ed., Contemporary Cryptology: The Science of Information Integrity, IEEE Press, Piscataway, N.J., 1992.

....(see Question 2.1.6) Surveys by Rivest [Riv90] and Brassard [Bra88] form an excellent introduction to modern cryptogra # 11 phy. Some textbook treatments are provided by Stinson [Sti95] and Stallings [Sta95] while Simmons provides an in depth coverage of the technical aspects of cryptography [Sim92]. A comprehensive review of modern cryptography can also be found in Applied Cryptography [Sch96] Ford [For94] provides detailed coverage of issues such as cryptography standards and secure communication. Frequently Asked Questions About Today s Cryptography Chapter 1 12 1.3 What are some of ....

....ways of constructing such schemes, based on which more advanced secret sharing schemes can be designed. The study of the combination of proactive techniques (see Question 7.16) with secret sharing schemes is an active area of research. For further information on secret sharing schemes, see [Sim92]. Frequently Asked Questions About Today s Cryptography Chapter 2 40 2.2 SIMPLE APPLICATIONS OF CRYPTOGRAPHY 2.2.1 What is privacy Privacy is perhaps the most obvious application of cryptography. Cryptography can be used to implement privacy simply by encrypting the information intended to ....

[Article contains additional citation context not shown here]

G.J. Simmons, editor, Contemporary Cryptology -- The Science of Information Integrity, IEEE Press, 1992.

....as will be described. 2. Cryptography General notions Cryptography is a vast science with long tradition in military and state affair fields. During the past decades cryptography has grown in many directions and nowadays it can be found in nearly all information systems. Cryptographic methods [3] may be divided in two main categories: conventional encryption and public key encryption systems. Conventional encryption system has been used for centuries from ancient Rome up to the present. Both encryption and decryption are done using the same key. This key is the core of the system ....

Simmons, Gustavus J., "Contemporary Cryptology- The Science of Information Integrity", IEEE Press, 1992

....12.8 2,048 bits 232 1471 233 bits 59,648 bytes 11.4 Although, as explained in the next sub section, the first three instances (512, 640 and 768) are only given for illustrative purpose. 1.2. 3 The size of p M must be sufficiently large (we recommend at least n 160) to prevent birthday search [20] through two lists of 2 n=2 elements to find a couple of sets such that : Y i2set[1] v i = 8 : Y i2set[2] v i 9 ; Gamma1 c mod p M and I can be increased by combining the following strategies : ffl Represent m in a non binary base (m = n P i=0 r i m i ; 0 m i r) and let p ....

G. Simmons, Contemporary cryptology : The science of information integrity, IEEE Press, pp. 257--258, 1992.

....system, and on the banking community over the last two decades to handle interbank automatic teller machine transactions. See [MM82] for a description of basic banking cryptography, and [And94] for its failure history. Further information on cryptography can be found in [Sch95] cited above, and [Sim92]. As discussed above, we assume that the distributor is responsible for installing the meters, and that the i th meter is furnished with key KD i . When the customer makes a contract with a supplier, the supplier will notify the distributor, who will issue a delegation message: TDS = fKS i ; PgKD ....

GJ Simmons, `Contemporary Cryptology: The Science of Information Integrity', IEEE Press, 1992

....the problem into two components. The first component produces the actual copyright code and a random sequence of locations for embedding the code in the image. This component is designed with the intention of implementing it, using existing encryption and pseudo random number generation techniques [11,12]. In fact, In: Proc. of 1995 IEEE Workshop on Nonlinear Signal and Image Processing (Neos Marmaras, Greece, June 20 22, 1995) 3 these methods are only discussed to establish a framework for developing a novel technique for embedding data in images. The second component actually embeds the code ....

G. J. Simmons, Contemporary Cryptology: The Science of Information Integrity, IEEE Press, New York, 1994.

No context found.

G. Simmons, Contemporary cryptology: The science of information integrity, IEEE Press, pp. 257--258, 1992.

No context found.

G. Simmons, Contemporary cryptology: The science of information integrity, IEEE Press, pp. 257--258, 1992.

No context found.

G. Simmons, Contemporary cryptology: The science of information integrity, IEEE Press, pp. 257--258, 1992.

No context found.

G.J. Simmons, Contemporary Cryptology: The Science of Information Integrity , IEEE Press, Piscataway, New Jersey, 1992.

No context found.

G. Simmons, editor. Contemporary Cryptology: The Science of Information Integrity. IEEE Press, 1992.

No context found.

G.J. Simmons, editor. Contemporary cryptology: The science of information integrity. IEEE Press, 1992.

No context found.

Gustavus J. Simmons, (ed), Contemporary Cryptology: The Science of Information Integrity, IEEE Press, Piscataway, NJ, 1991.

No context found.

G. Simmons, ed., Contemporary Cryptology -- The Science of Information Integrity, IEEE Press, 1992.

No context found.

G.J. Simmons, Contemporary Cryptology: The Science of Information Integrity , IEEE Press, Piscataway, New Jersey, 1992.

No context found.

G. Simmons. Contemporary Cryptology : The Science of Information Integrity, IEEE Press New York, 1992.

No context found.

Gustavus J. Simmons, editor, "Contemporary Cryptology: The Science of Information Integrity", IEEE Press, 1992.

No context found.

G.J. Simmons, editor. Contemporary cryptology: The science of information integrity. IEEE Press, 1992.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC