Squares of random linear codes

IEEE Transactions on Information Theory

Volumn 61, Issue 3, 2015, Pages 1159-1173

  Cascudo, Ignacio ^a,b   Cramer, Ronald ^a,c   Mirandola, Diego ^a,c,d   Zémor, Gilles ^d  

^a CWI   (Netherlands)

^b AARHUS UNIVERSITY   (Denmark)

^c LEIDEN UNIVERSITY   (Netherlands)

^d UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Error correcting codes; Quadratic forms; Random codes; Schur product codes

Indexed keywords

CODES (SYMBOLS); NUMBER THEORY;

COMPONENTWISE; CONVERGENCE SPEED; ERROR CORRECTING CODE; PRODUCT CODE; QUADRATIC FORM; RANDOM CODES; RANDOM CODING; RANDOM LINEAR CODES;

C (PROGRAMMING LANGUAGE);

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

References (32)

1. 2," J. Complex., vol. 27, no. 2, pp. 230-245, 2011.
2. A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-Regular Graphs. Berlin, Germany: Springer-Verlag, 1989.
3. I. Cascudo, H. Chen, R. Cramer, and C. Xing, "Asymptotically good ideal linear secret sharing with strong multiplication over any finite field," in Proc. 29th Annu. IACR CRYPTO, vol. 5677. Santa Barbara, CA, USA, Aug. 2009, pp. 466-486.
4. I. Cascudo, R. Cramer, and C. Xing, "The torsion-limit for algebraic function fields and its application to arithmetic secret sharing," in Proc. 31st Annu. IACR CRYPTO, vol. 6841. Santa Barbara, CA, USA, Aug. 2011, pp. 685-705.
5. I. Cascudo, R. Cramer, and C. Xing, "The arithmetic codex," in Proc. IEEE Inf. Theory Workshop (ITW), Sep. 2012, pp. 75-79.
6. I. Cascudo, R. Cramer, and C. Xing, "Torsion limits and Riemann-Roch systems for function fields and applications," IEEE Trans. Inf. Theory, vol. 60, no. 7, pp. 3871-3888, Jul. 2014.
7. I. Cascudo, R. Cramer, C. Xing, and A. Yang, "Asymptotic bound for multiplication complexity in the extensions of small finite fields," IEEE Trans. Inf. Theory, vol. 58, no. 7, pp. 4930-4935, Jul. 2012.
8. H. Chen and R. Cramer, "Algebraic geometric secret sharing schemes and secure multi-party computations over small fields," in Proc. 26th Annu. IACR CRYPTO, vol. 4117. Santa Barbara, CA, USA, Aug. 2006, pp. 521-536.
9. H. Chen, R. Cramer, S. Goldwasser, R. de Haan, and V. Vaikuntanathan, "Secure computation from random error correcting codes," in Proc. 27th Annu. IACR EUROCRYPT, vol. 4515. Barcelona, Spain, 2007, pp. 291-310.
10. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, 3rd ed. New York, NY, USA: Springer-Verlag, 1999.
11. A. Couvreur, P. Gaborit, V. Gauthier-Umaña, A. Otmani, and J.-P. Tillich, "Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes," in Designs, Codes and Cryptography, vol. 73. New York, NY, USA: Springer-Verlag, Nov. 2014, pp. 641-666.
12. A. Couvreur, A. Otmani, and J.-P. Tillich, "New identities relating wild Goppa codes," Finite Fields Appl., vol. 29, pp. 178-197, Sep. 2014.
13. A. Couvreur, A. Otmani, and J.-P. Tillich, "Polynomial time attack on wild McEliece over quadratic extensions," in Proc. 33rd Annu. IACR EUROCRYPT, vol. 8441. Copenhagen, Denmark, May 2014, pp. 17-39.
14. R. Cramer, I. Damgård, and U. Maurer, "General secure multi-party computation from any linear secret-sharing scheme," in Proc. 19th Annu. IACR EUROCRYPT, vol. 1807. Bruges, Belgium, May 2000, pp. 316-334.
15. R. Cramer, I. Damgård, and J. B. Nielsen, Secure Multiparty Computation and Secret Sharing. Cambridge, U.K.: Cambridge Univ. Press, 2015.
16. J. Dieudonné, La Géométrie des Groupes Classiques, 2nd ed. New York, NY, USA: Springer-Verlag, 1963.
17. R. H. Dye, "On the Arf invariant," J. Algebra, vol. 53, no. 1, pp. 36-39, 1978.
18. Y. Egawa, "Association schemes of quadratic forms," J. Combinat. Theory, Ser. A, vol. 38, no. 1, pp. 1-14, 1985.
19. J.-C. Faugère, V. Gauthier-Umaña, A. Otmani, L. Perret, and J.-P. Tillich, "A distinguisher for high-rate McEliece cryptosystems," in Proc. IEEE Inf. Theory Workshop, Paraty, Brazil, Oct. 2011, pp. 282-286.
20. W. Cary Huffman and V. Pless, Fundamentals of Error-Correcting Codes. Cambridge, U.K.: Cambridge Univ. Press, 2003.
21. Y. Ishai, E. Kushilevitz, R. Ostrovsky, M. Prabhakaran, A. Sahai, and J. Wullschleger, "Constant-rate oblivious transfer from noisy channels," in Advances in Cryptology (Lecture Notes in Computer Science), vol. 6841. Berlin, Germany: Springer-Verlag, 2011, pp. 667-684.
22. Y. Ishai, E. Kushilevitz, R. Ostrovsky, and A. Sahai, "Zero-knowledge proofs from secure multiparty computation," SIAM J. Comput., vol. 39, no. 3, pp. 1121-1152, 2009.
23. W. Kositwattanarerk and F. Oggier, "Connections between construction D and related constructions of lattices," Designs, Codes, Cryptogr., vol. 73, no. 2, pp. 441-455, Nov. 2014.
24. T. Y. Lam, Introduction to Quadratic Forms Over Fields (Graduate Studies in Mathematics), vol. 67. Providence, RI, USA: AMS, 2005.
25. R. Lidl and H. Niederreiter, Finite Fields. Reading, MA, USA: Addison-Wesley, 1983.
26. F. J. McWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North Holland, 1977.
27. F. Oggier and G. Zémor, "Coding constructions for efficient oblivious transfer from noisy channels," in preparation.
28. R. Pellikaan, "On decoding by error location and dependent sets of error positions," Discrete Math., vols. 106-107, pp. 369-381, Sep. 1992.
29. H. Randriambololona, "Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method," J. Complex., vol. 28, no. 4, pp. 489-517, 2012.
30. H. Randriambololona, "Asymptotically good binary linear codes with asymptotically good self-intersection spans," IEEE Trans. Inf. Theory, vol. 59, no. 5, pp. 3038-3045, May 2013.
31. H. Randriambololona. "On products and powers of linear codes under componentwise multiplication." [Online]. Available: http://arxiv.org/abs/1312.0022
32. J.-P. Serre, A Course in Arithmetic (Graduate Texts in Mathematics), vol. 7. New York, NY, USA: Springer-Verlag, 1973.