Author： Hast Gustav
Publisher： Springer Publishing Company
ISSN： 0933-2790
Source： Journal of Cryptology, Vol.17, Iss.3, 2004-06, pp. : 209-229
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
We study statistical tests with binary output that rarely outputs one, which we call nearly one-sided statistical tests. We provide an efficient reduction establishing improved security for the Goldreich–Levin hard-core bit against nearly one-sided tests. The analysis is extended to prove the security of the Blum–Micali pseudo-random generator combined with the Goldreich–Levin bit. Finally, some applications where nearly one-sided tests occur naturally are discussed.
Related content
Access to resources
Recommend
Foliations with One-Sided Branching
By Calegari D.
Geometriae Dedicata, Vol. 96, Iss. 1, 2003-02 ,pp. :
Bulletin of the Australian Mathematical Society, Vol. 34, Iss. 1, 1986-08 ,pp. :
ON PARTIALLY ONE-SIDED UNIT-REGULARITY
By Chen Huanyin
Communications in Algebra, Vol. 30, Iss. 12, 2002-01 ,pp. :