A Feebly Secure Trapdoor Function

DOI10.1007/978-3-642-03351-3_14zbMath1248.94069OpenAlexW2134739432WikidataQ57101107 ScholiaQ57101107MaRDI QIDQ3392948

Edward A. Hirsch, Sergey I. Nikolenko

Publication date: 18 August 2009

Published in: Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03351-3_14

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Cryptographic Analysis of All 4 × 4-Bit S-Boxes ⋮ Feebly secure cryptographic primitives ⋮ Circuit complexity of linear functions: gate elimination and feeble security ⋮ Gate Elimination for Linear Functions and New Feebly Secure Constructions ⋮ Algebraic cryptography: new constructions and their security against provable break

Cites Work

• A Boolean function requiring 3n network size
• One way functions and pseudorandom generators
• A Complete Public-Key Cryptosystem
• Foundations of Cryptography
• On Robust Combiners for Oblivious Transfer and Other Primitives
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Feebly Secure Trapdoor Function