scientific article; zbMATH DE number 1088223

MaRDI QIDQ4364539zbMATH OpenFDO

Authors Mikael Goldmann, Mats Näslund

Publication date 17 March 1998

zbMATH Keywords

one-way functionspseudo-randomnesssmall-depth circuit

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Data encryption (aspects in computer science) (68P25)

Recommendations

• Complexity bounds on general hard-core predicates.
• scientific article; zbMATH DE number 1500548
• On the Complexity of Hard-Core Set Constructions
• scientific article; zbMATH DE number 3990863

Cited in

(13)

• Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents
• Hardness assumptions in the foundations of theoretical computer science
• Hard-core predicates for a Diffie-Hellman problem over finite fields
• A new hard-core predicate of Paillier's trapdoor function
• Hard-core theorems for complexity classes
• scientific article; zbMATH DE number 4095440 (Why is no real title available?)
• scientific article; zbMATH DE number 1306886 (Why is no real title available?)
• scientific article; zbMATH DE number 1500548 (Why is no real title available?)
• On the complexity of computation of rudimentary predicates
• scientific article; zbMATH DE number 2201364 (Why is no real title available?)
• On the computational complexity of finding hard tautologies
• On the Complexity of Hard-Core Set Constructions
• Complexity bounds on general hard-core predicates.

This page was built for publication:

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