The Difficulty with Difficulty (A Guide to the Transparencies from the EUROCRYPT '96 IACR Distinguished Lecture) (1996)
| Citations: | 2 - 0 self |
BibTeX
@MISC{Massey96thedifficulty,
author = {James L. Massey},
title = {The Difficulty with Difficulty (A Guide to the Transparencies from the EUROCRYPT '96 IACR Distinguished Lecture)},
year = {1996}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper. Transparency 2 indicates the kind of provable security that I would like to see eventually reached in cryptography. By way of contrast, transparency 3 indicates the kind of provable security that most people talk about today. From a complexity viewpoint, transparency 2 deals with a non-uniform complexity measure while transparency 3 deals with a uniform complexity measure #i.e., the same algorithm must compute all instances of the function#. In the former case, it makes sense to talk about a function #i.e., one and only one instance of a #function"# being di#cult, whereas in the latter case one must always talk about the di#culty of an in#nite sequence of functions. My lecture was aimed at the former kind of di#culty.
Citations
| 115 | The synthesis of two terminal switching circuits - Shannon - 1949 |
| 25 | A boolean function requiring 3n network size - Blum - 1984 |
| 10 | One-way functions and circuit complexity - Boppana, Lagarias - 1987 |
| 6 | Constructions of feebly-one-way families of permutations - Hiltgen - 1992 |
| 4 | Cryptographically relevant contributions to combinatorial complexity theory - Hiltgen - 1994 |
| 4 | Combinational Complexity of Some Monotone Functions - Lamagna - 1974 |
| 1 | On the Existence of Speci c Complexity{Asymmetric Permutations - Hiltgen, Ganz - 1992 |
