## Abstract This paper discusses the complexity from the viewpoint of the number of circuit elements for the slice functions and the homogeneous function, which belong to the class of monotonic logic functions. The slice function is one of those functions in which the circuit complexity is almost e
One-way functions and circuit complexity
β Scribed by R.B. Boppana; J.C. Lagarias
- Book ID
- 113383825
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 897 KB
- Volume
- 74
- Category
- Article
- ISSN
- 0890-5401
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We introduce the notion of associative one-way functions and prove that they exist if and only if P # NP. As evidence of their utility, we present two novel protocols that apply strong forms of these functions to achieve secret-key agreement and digital signatures. @ 1997 Published by Elsevier Scien
Rabi and Sherman presented novel digital signature and unauthenticated secret-key agreement protocols, developed by themselves and by Rivest and Sherman. These protocols use strong, total, commutative (in the case of multiparty secret-key agreement), associative one-way functions as their key buildi