Two results on the bit extraction problem

Discrete Applied Mathematics

Volumn 99, Issue 1-3, 2000, Pages 443-454

  Friedl, Katalin ^a   Tsai, Shi Chun ^b  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b NATIONAL CHI NAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347934576     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00150-X     Document Type: Article

References (8)

1. E. Bannai, T. Ito, Algebraic Combinatorics I, Benjamin / Cummings Menlo Park, CA, 1984.
2. Bennett C., Brassard G., Robert J. Privacy amplification by public discussion. SIAM J. Comput. 17:1988;210-229.
3. K. Bierbrauer, K. Gopalakrishnan, D.R. Stinson, Bounds for resilient functions and orthogonal arrays, Advances in Cryptology-CRYPTO'94, Lecture Notes in Computer Science, vol. 839, Springer, Berlin, 1994, pp. 247-256.
4. B. Chor, J. Friedman, O. Goldreich, J. Hastad, S. Rudich, R. Smolensky, The bit extraction problem or t -resilient functions, 26th FOCS, 1985, pp. 396-407.
5. J. Friedman, On the bit extraction problem, 33rd FOCS, 1992, pp. 314-319.
6. Gopalakrishnan K., Hoffman D., Stinson D. A note on a conjecture concerning symmetric resilient functions. Inform. Processing Lett. 47:1993;139-143.
7. F.J. McWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
8. Stinson D., Massey J. An infinite class of counterexamples to a conjecture concerning non-linear resilient functions. J. Cryptol. 8:1995;167-173.