Nearly one-sided tests and the Goldreich-Levin predicate

DOI10.1007/S00145-003-0141-4zbMath1089.94019OpenAlexW2090128154MaRDI QIDQ1882570

Gustav Hast

Publication date: 1 October 2004

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-003-0141-4

zbMATH Keywords

Provable securityGoldreich-Levin predicateList decoding of Hadamard codeNearly one-sided statistical testPseudo-random generator

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Random number generation in numerical analysis (65C10) Decoding (94B35)

This page was built for publication: Nearly one-sided tests and the Goldreich-Levin predicate