Analysis and construction of correctors

IEEE Transactions on Information Theory

Volumn 55, Issue 10, 2009, Pages 4742-4748

  Lacharme, Patrick ^a  

^a UNIVERSITÉ DE TOULON   (France)

Author keywords

Boolean functions; Cryptography; Dual codes; Physical random number generator; Resilient functions

Indexed keywords

DUAL CODES; OUTPUT FUNCTIONS; PHYSICAL RANDOM NUMBER GENERATOR; PHYSICAL RANDOM NUMBERS; POST PROCESSING; RESILIENT FUNCTIONS;

CRYPTOGRAPHY; NUMBER THEORY; RANDOM NUMBER GENERATION;

BOOLEAN FUNCTIONS;

EID: 70349620392     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2009.2027483     Document Type: Article

References (22)

1. J. von Neumann, "Various techniques for use in connection with random digits," J. Von Neumann's Collected Works, vol. 5, pp. 768-770, 1963.
2. M. Blum, "Independent unbiased coin flips from a correlated biased source: A finite markov chain," Combinatorica, vol. 6, no. 2, pp. 97-108, 1986.
3. B. Barak, R. Shaltiel, and U. Tromer, "True random generator in a changing environement," in Proc. CHES'03, LNCS 2779, 2003, pp. 166-180.
4. M. Dichtl, "Bad and good ways of post-processing biased physical random numbers," in Proc. FSE'07, 2007, vol. 4593, Lecture Notes in Computer Science, pp. 127-152.
5. P. Lacharme, "Post processing functions for a biased physical random number generator," in Proc. FSE'08, 2008, vol. 5086, Lecture Notes in Computer Science, pp. 334-342.
6. K. Suzuki and T. Iwata, "Bounds on fixed input/output length post-processing functions for biased physical random number generators," in Proc. SAC'08.
7. T. Sigenthaler, "Correlation-immunity of nonlinear combining functions for cryptographic applications," IEEE Trans. Inf. Theory, vol. 30, pp. 776-780, 1984.
8. B. Chor, O. Goldreich, J. Hastad, J. Freidmann, S. Rudich, and R. Smolensky, "The bit extraction problem or t-resilient functions," in Proc. 26th IEEE Symp. Found. Comput. Sci., 1985, pp. 396-407.
9. C. H. Bennett, G. Brassard, and J. M. Robert, "Privacy amplification by public discussion," SIAM J. Comput., vol. 17, no. 2, pp. 210-229, 1988.
10. D. Stinson and J. L. Massey, "An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions," J. Cryptol. vol. 8, pp. 167-173, 1995.
11. K.Kurosawa, T. Satoh, and K. Yamamoto, "Highly nonlinear t-resilient functions," J. Universal Comput. Sci., vol. 3, no. 6, pp. 721-729.
12. K. C. Gupta and P. Sarkar, "Improved constructions of nonlinear resilient S-boxes," in Proc. Asiacrypt'02, 2002, vol. 2501, Lecture Notes in Computer Science, pp. 466-483.
13. P. Charpin and E. Pasalic, "Highly nonlinear resilient functions through disjoint codes in projective spaces," Designs, Codes, Cryptogr., vol. 37, pp. 319-346, 2005.
14. C. Carlet, "Vectorials boolean functions for cryptography," in Chapter of Boolean Methods and Models, Y. Crama and P. Hammer, Eds. Cambridge, U.K.: Cambridge University Press.
15. T. Baignères, P. Junod, and S. Vaudenay, "How far can we go beyond linear cryptanalysis," in Proc. Asiacrypt'04, 2004, vol. 3329, Lecture Notes in Computer Science, pp. 432-450.
16. G. Xiao and J. L. Massey, "A spectral characterization of correlation immune functions," IEEE Trans. Inf. Theory, vol. 34, pp. 569-571, 1988.
17. D. Stinson, "Resilient functions and large sets of orthogonal arrays," Congressus Numeranitium, vol. 92, pp. 105-110, 1993.
18. P. Camion, C. Carlet, P. Charpin, and N. Sendrier, "On correlation-immune functions," in Proc. Crypto'91, 1992, vol. 576, Lecture Notes in Computer Science, pp. 424-452.
19. J. Bierbrauer, K. Gopalakrishnan, and D. Stinson, "Orthogonal arrays, resilient functions, error correcting codes and linear programming bounds," SIAM J. Discr. Math., vol. 9, no. 3, pp. 424-452, 1996.
20. F. J. Mac Williams and N. J. A. Sloane, The Theory of Error Correcting Codes. Amsterdam, The Netherlands: North Holland, 1977.
21. X. M. Zhang and Y. Zheng, "Cryptographically resilient functions," IEEE Trans. Inf. Theory, vol. 43, no. 5, pp. 1740-1747, 1997.
22. M. Matsui, "Linear cryptanalysis method of DES cipher," in Proc. Eurocrypt' 93, 1993, vol. 765, Lecture Notes in Computer Science, pp. 386-397.