How to construct random functions
Journal of the ACM (JACM)
Pseudo-random permutation generators and cryptographic composition
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A simple unpredictable pseudo random number generator
SIAM Journal on Computing
How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
Counting functions satisfying a higher order strict avalanche criterion
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Journal of the ACM (JACM)
A Survey of Interconnection Networks
Computer
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Controlled Operations as a Cryptographic Primitive
MMM-ACNS '01 Proceedings of the International Workshop on Information Assurance in Computer Networks: Methods, Models, and Architectures for Network Security
| Hi-index | 0.00 |
Cryptosystems can be viewed as sets of permutations from which one permutation is chosen as cryptofunction by specifying a key. Interconnection networks have been widely studied in the field of parallel processing. They have one property that makes them very interesting for cryptology, i.e. they give the opportunity to access and perform permutations at the same time. This paper presents two examples of how cryptology can benefit from the use of interconnection networks. One is a new construction of a pseudo-random permutation (generator) from one single pseudo-random function (generator). The search for such constructions has been of major interest since Luby and Rackoff gave the first construction in 1986. The second example presents a cryptosystem based on interconnection networks and a certain class of boolean functions. Some arguments for its security are given. Although there is a relation between the two examples they complement each other in using different properties of interconnection networks. This can be regarded as an argument that exploiting the full potential of interconnection networks can establish completely new techniques in cryptology.