Journal ArticleDOI
Generators for Certain Alternating Groups with Applications to Cryptography
Don Coppersmith,Edna Grossman +1 more
Reads0
Chats0
TLDR
The subgroup of permutations generated by any one of these ciphers is shown to be the alternating group, in all cases of interest, suggesting that such systems have a high level of security.Abstract:
A set of block ciphers is described which can readily be adapted for computer encipherment of data. The subgroup of permutations generated by any one of these ciphers is shown to be the alternating group, in all cases of interest, suggesting that such systems have a high level of security.read more
Citations
More filters
Journal ArticleDOI
Mixed State Entanglement and Quantum Error Correction
Charles H. Bennett,Charles H. Bennett,Charles H. Bennett,David P. DiVincenzo,David P. DiVincenzo,David P. DiVincenzo,John A. Smolin,John A. Smolin,John A. Smolin,William K. Wootters,William K. Wootters,William K. Wootters +11 more
TL;DR: It is proved that an EPP involving one-way classical communication and acting on mixed state M (obtained by sharing halves of Einstein-Podolsky-Rosen pairs through a channel) yields a QECC on \ensuremath{\chi} with rate Q=D, and vice versa, and it is proved Q is not increased by adding one- way classical communication.
Journal ArticleDOI
Elementary gates for quantum computation.
Adriano Barenco,Charles H. Bennett,Richard Cleve,David P. DiVincenzo,Norman Margolus,Peter W. Shor,Tycho Sleator,John A. Smolin,Harald Weinfurter +8 more
TL;DR: U(2) gates are derived, which derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number of unitary operations on arbitrarily many bits.
BookDOI
Applied cryptography, second edition : protocols, algorithms,and source code in C
TL;DR: Part I—Cryptographic Protocols Chapter 2—Protocol Building Blocks 2.
Journal ArticleDOI
Privacy and authentication: An introduction to cryptography
TL;DR: The basic information theoretic and computational properties of classical and modern cryptographic systems are presented, followed by cryptanalytic examination of several important systems and an examination of the application of cryptography to the security of timesharing systems and computer networks.
Journal ArticleDOI
Time/space trade-offs for reversible computation
TL;DR: Using a pebbling argument, this paper shows that, for any $\varepsilon > 0$, ordinary multitape Turing machines using time T and space S can be simulated by reversible ones using time $O(T^{1 + \varpsilon } )$ and space $O (S\log T)$ or in linear time and space$O(ST^\varePSilon )$.
References
More filters