Constructions of feebly-one-way families of permutations

  • Alain P. L. Hiltgen
Conference paper

DOI: 10.1007/3-540-57220-1_80

Part of the Lecture Notes in Computer Science book series (LNCS, volume 718)
Cite this paper as:
Hiltgen A.P.L. (1993) Constructions of feebly-one-way families of permutations. In: Seberry J., Zheng Y. (eds) Advances in Cryptology — AUSCRYPT '92. AUSCRYPT 1992. Lecture Notes in Computer Science, vol 718. Springer, Berlin, Heidelberg

Abstract

The unrestricted circuit complexity C(.) over the basis of all logic 2-input/1-output gates is considered. It is proved that certain explicitly defined families of permutations {fn} are feebly-one-way of order 2, i.e., the functions fn satisfy the property that, for increasing n, C(fn−1) approaches 2 · C(fn) while C(fn) tends to infinity. Both these functions and their corresponding complexities are derived by a method that exploits certain graphs called (n−1,s)-stars.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Alain P. L. Hiltgen
    • 1
  1. 1.Swiss Federal Institute of TechnologySignal and Information Processing LaboratoryZürichSwitzerland

Personalised recommendations