On the Minimal Hardware Complexity of Pseudorandom Function Generators
- 16 March 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 419-430
- https://doi.org/10.1007/3-540-44693-1_37
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Computing Boolean functions by polynomials and threshold circuitscomputational complexity, 1998
- On the computational power of depth-2 circuits with threshold and modulo gatesTheoretical Computer Science, 1997
- Variation ranks of communication matrices and lower bounds for depth-two circuits having nearly symmetric gates with unbounded fan-inTheory of Computing Systems, 1995
- A note on read-$k$ times branching programsRAIRO - Theoretical Informatics and Applications, 1995
- Cryptographic limitations on learning Boolean formulae and finite automataJournal of the ACM, 1994
- On lower bounds for read-k-times branching programscomputational complexity, 1993
- Simulating threshold circuits by majority circuitsPublished by Association for Computing Machinery (ACM) ,1993
- Majority gates vs. general weighted threshold gatescomputational complexity, 1992
- Harmonic Analysis of Polynomial Threshold FunctionsSIAM Journal on Discrete Mathematics, 1990
- How to construct random functionsJournal of the ACM, 1986