On the Use of Interconnection Networks in Cryptography

  • Michael Portz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 547)


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.

8 Literature

  1. [BBS]
    L. Blum, M. Blum, M. Shub: “A simple unpredictable pseudo-random number generator”, SIAM Journal on Computing, Vol. 15, 1986, pp. 364–383zbMATHCrossRefMathSciNetGoogle Scholar
  2. [Bene65]
    V.E. Benes: “Mathematical theory of connecting networks and telephone traffic”, Academic Press, New York, 1965zbMATHGoogle Scholar
  3. [BHP91]
    T. Beth, P. Horster, M. Portz: “Verbindungsnetzwerke in der Kryptologie”; to appear as report of the European Institute for System Security (E.I.S.S.)Google Scholar
  4. [Feng81]
    Tse-yun Feng: “A survey of interconnection networks”; Computer: IE3; Dec 1981, pp. 12–27Google Scholar
  5. [GGM86]
    O. Goldreich, S. Goldwasser, S. Micali: “How to construct random functions”; Journal of the ACM, Vol. 33, No. 4, Oct. 1986, pp. 792–807CrossRefMathSciNetGoogle Scholar
  6. [Lloy90]
    S. Lloyd: “Counting Functions satisfying a higher order strict avalanche criterion”; Advances in Cryptology-EUROCRYPT’ 89, Lecture Notes in Computer Science 434, Springer Verlag, 1990Google Scholar
  7. [LuRa86]
    M. Luby, C. Rackoff: “Pseudo-random permutation generators and cryptographic composition”; Proceedings of the 18th ACM Symposium on the Theory of Computing, ACM, 1986, pp. 356–363Google Scholar
  8. [LuRa88]
    M. Luby, C. Rackoff: “How to construct pseudo-random permutations from pseudorandom functions”; SIAM Journal of Computing, Vol. 17(2), 1988, pp. 373–386zbMATHCrossRefMathSciNetGoogle Scholar
  9. [OpTs71]
    D.C. Opferman, N.T. Tsao-Wu: “On a class of rearrangeable switching networks” “Part I: Control Algorithm”; The Bell System Technical Journal, Vol. 50, No. 5, May–June 1971, pp. 1579–1600; “Part II: Enumeration Studies and Fault Diagnosis”; The Bell System Technical Journal, Vol. 50, No. 5, May–June 1971, pp. 1601–1618MathSciNetGoogle Scholar
  10. [Ohni88]
    Y. Ohnishi: “A study on data security”; Master Thesis (in Japanese); Tohoku University, Japan, 1988Google Scholar
  11. [Piep90]
    J. Pieprzyk: “How to construct pseudorandom permutations from single pseudorandom functions”; Advances in Cryptology-EUROCRYPT’ 90, Lecture Notes in Computer Science 473, Springer Verlag, 1991Google Scholar
  12. [Port91]
    M. Portz: “A new class of cryptosystems based on interconnection networks”; Aachener Informatik-Berichte, Nr. 91-4, RWTH Aachen, Fachgruppe Informatik; ISSN 0935-3232, 1991Google Scholar
  13. [Schn88]
    C.P. Schnorr: “On the construction of random number generators and random function generators”; Advances in Cryptology-EUROCRYPT’ 88, Lecture Notes in Computer Science 330, Springer Verlag, 1989Google Scholar
  14. [Waks68]
    A. Waksman: “A permutation network”; Journal of the ACM, Vol. 15, No. 1, Jan. 1968, pp. 159–163CrossRefGoogle Scholar
  15. [ZMI89]
    Y. Zheng, T. Matsumoto, H. Imai: “On the construction of block ciphers provably secure and not relying on any unproved hypothesis”; Advances in Cryptology-CRYPTO 89; Lecture Notes in Computer Science 435; Springer; 1990CrossRefGoogle Scholar
  16. [Yao91]
    A.C. Yao: “Theory and application of trapdoor functions”; Proceedings of the 23rd IEEE Symposium on Foundation of Computer Science, New York, 1982Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Michael Portz
    • 1
  1. 1.Lehrstuhl für angewandte Mathematik insb. InformatikRWTH AachenAachen

Personalised recommendations