On the minimal hardware complexity of pseudorandom function generators

DOI10.1007/3-540-44693-1_37MaRDI QIDQ2762792zbMATH OpenFDO

Authors Matthias Krause, Stefan Lucks

Publication date 9 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44693-1_37

zbMATH Keywords

pseudorandom function generator

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• The complexity of constructing pseudorandom generators from hard functions
• On linear-size pseudorandom generators and hardcore functions
• On linear-size pseudorandom generators and hardcore functions
• scientific article; zbMATH DE number 7650416
• Pseudorandom generators, typically-correct derandomization, and circuit lower bounds
• On the complexity of binary floating point pseudorandom generation
• Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
• Pseudorandom generators for space-bounded computation
• Practical construction and analysis of pseudo-randomness primitives

Cited in

(6)

• Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
• Efficient amplification of the security of weak pseudo-random function generators
• Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
• scientific article; zbMATH DE number 1788110 (Why is no real title available?)
• The communication complexity of addition
• scientific article; zbMATH DE number 7650416 (Why is no real title available?)

This page was built for publication: On the minimal hardware complexity of pseudorandom function generators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2762792)