Complete classification of bilinear hard-core functions

DOI10.1007/978-3-540-28628-8_5MaRDI QIDQ5311559zbMATH OpenOpenAlexDBLPFDO

Authors Thomas Holenstein, Ueli M. Maurer, Johan Sjödin

Publication date 23 August 2005

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

Full work available at URL https://doi.org/10.1007/b99099

zbMATH Keywords

Goldreich-Levin predicatehard-core functionsList-decoding

Mathematics Subject Classification ID

Cryptography (94A60) Decoding (94B35)

Recommendations

• scientific article; zbMATH DE number 782057
• Universal functions for classes of bilinear and polylinear Boolean functions
• scientific article; zbMATH DE number 4093649
• A survey of hard core functions
• Bilinear forms on vector Hardy spaces
• A bilipschitz version of Hardt's theorem
• Bipolynomial Hilbert functions
• scientific article; zbMATH DE number 3964046

Cited in

(5)

• A survey of hard core functions
• Universal hash functions \& hard core bits
• Quantum hardcore functions by complexity-theoretical quantum list decoding
• Complexity bounds on general hard-core predicates.
• On linear-size pseudorandom generators and hardcore functions

This page was built for publication: Complete classification of bilinear hard-core functions

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