Proving hard-core predicates using list decoding

DOI10.1109/SFCS.2003.1238189MaRDI QIDQ7255170zbMATH OpenFDO

Authors Adi Akavia, Shafi Goldwasser, Shmuel Safra

Publication date 29 May 2026

Full work available at URL https://doi.org/10.1109/SFCS.2003.1238189

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(2)

• Public-key encryption from the MinRank problem
• Ranges of polynomials control degree ranks of Green and Tao over finite prime fields

This page was built for publication: Proving hard-core predicates using list decoding

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