Buscar recursos académicos

As we draw near to closing out the twentieth century, we see quite clearly that the information-processing and telecommunications revolutions now underway will continue vigorously into the twenty-first. We interact and t...

Two kinds of contemporary developments in cryptography are examined. Widening applications of teleprocessing have given rise to a need for new types of cryptographic systems, which minimize the need for secure key distri...

Practical application of the generalized Bell's theorem in the so-called key distribution process in cryptography is reported. The proposed scheme is based on the Bohm's version of the Einstein-Podolsky-Rosen gedanken ex...

blic Keys Schemes usually generate two pairs of keys that bear some mathematical relation-usually, a relation of the field known as Number Theory. Identifying a key from another that is given is a problem of great diffic...

"A new class of linear sequence generators based on cellular automata is here introduced in order to model several nonlinear keystream generators with practical applications in symmetric cryptography. The output sequence...

THE problems of cryptography and secrecy systems furnish an interesting application of communication theory. 1 In this paper a theory of secrecy systems is developed. The approach is on a theoretical level and is intende...

All our former experience with application of quantum theory seems to say that what is predicted by quantum formalism must occur in the laboratory. But the essence of quantum formalism---entanglement, recognized by Einst...

An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: (1) Couriers or other sec...

An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: Couriers or other secure ...

A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a cost in computation time of at most a polynomial factor: It is not...

In this paper we show how to divide data D into n pieces in such a way that D is easily reconstructable from any k pieces, but even complete knowledge of k - 1 pieces reveals absolutely no information about D . This tech...

Public key cryptosystems can well become void with the advent of incredibly high performance quantum computers. The underlying principles of these computers themselves, namely quantum mechanics, provide the solution to t...

A valid Calderbank-Shor-Steane (CSS) error correction code requires two classical linear codes for the preparation of the initial state (codewords). This code allow to correct for certain errors caused by an unwanted int...