No file available
To read the file of this research,
you can request a copy directly from the author.
On squares of cyclic codes
Preprints and early-stage research may not have been peer reviewed yet.
Abstract
The square of a linear error correcting code C is the linear code spanned by the component-wise products of every pair of (non-necessarily distinct) words in C. Squares of codes have gained attention for several applications mainly in the area of cryptography, and typically in those applications one is concerned about some of the parameters (dimension, minimum distance) of both and C. In this paper, motivated mostly by the study of this problem in the case of linear codes defined over the binary field, squares of cyclic codes are considered. General results on the minimum distance of the squares of cyclic codes are obtained and constructions of cyclic codes C with relatively large dimension of C and minimum distance of the square are discussed. In some cases, the constructions lead to codes C such that both C and simultaneously have the largest possible minimum distances for their length and dimensions.
ResearchGate has not been able to resolve any citations for this publication.
We present a polynomial-time structural attack against the McEliece system based on Wild Goppa codes defined over a quadratic finite field extension. We show that such codes can be efficiently distinguished from random codes. The attack uses this property to compute a filtration, that is to say, a family of nested subcodes which will reveal their secret algebraic description.
An overwhelming variety of different constructions for (t, m, s)-nets and (t, s)-sequences are known today. Propagation rules as well as connections to other mathematical objects make it a difficult task
to determine the best net available in a given setting.
We present the web-based database system MinT for querying best known (t, m, s)-net and (t, s)-sequence parameters. This new system provides a number of hitherto unavailable services to the research community.
We construct the first UC commitment scheme for binary strings with the optimal properties of rate approaching 1 and linear time complexity (in the amortised sense, using a small number of seed OTs). On top of this, the scheme is additively homomorphic, which allows for applications to maliciously secure 2-party computation. As tools for obtaining this, we make three contributions of independent interest: we construct the first (binary) linear time encodable codes with non-trivial distance and rate approaching 1, we construct the first almost universal hash function with small seed that can be computed in linear time, and we introduce a new primitive called interactive proximity testing that can be used to verify whether a string is close to a given linear code.
We present a new constant round additively homomorphic commitment scheme with (amortized) computational and communication complexity linear in the size of the string committed to. Our scheme is based on the non-homomorphic commitment scheme of Cascudo et al. presented at PKC 2015. However, we manage to add the additive homomorphic property, while at the same time reducing the constants. In fact, when opening a large enough batch of commitments we achieve an amortized communication complexity converging to the length of the message committed to, i.e., we achieve close to rate 1 as the commitment protocol by Garay et al. from Eurocrypt 2014. A main technical improvement over the scheme mentioned above, and other schemes based on using error correcting codes for UC commitment, we develop a new technique which allows to based the extraction property on erasure decoding as opposed to error correction. This allows to use a code with significantly smaller minimal distance and allows to use codes without efficient decoding.
Our scheme only relies on standard assumptions. Specifically we require a pseudorandom number generator, a linear error correcting code and an ideal oblivious transfer functionality. Based on this we prove our scheme secure in the Universal Composability (UC) framework against a static and malicious adversary corrupting any number of parties.
On a practical note, our scheme improves significantly on the non-homomorphic scheme of Cascudo et al. Based on their observations in regards to efficiency of using linear error correcting codes for commitments we conjecture that our commitment scheme might in practice be more efficient than all existing constructions of UC commitment, even non-homomorphic constructions and even constructions in the random oracle model. In particular, the amortized price of computing one of our commitments is less than that of evaluating a hash function once.
Given a linear code C, one can define the dth power of C as the span of all componentwise products of d elements of C. A power of C may quickly fill the whole space. Our purpose is to answer the following question: does the square of a code typically fill the whole space? We give a positive answer, for codes of dimension k and length roughly (1/2)k2 or smaller. Moreover, the convergence speed is exponential if the difference k(k+1)/2-n is at least linear in k. The proof uses random coding and combinatorial arguments, together with algebraic tools involving the precise computation of the number of quadratic forms of a given rank, and the number of their zeros.
We characterize Product-MDS pairs of linear codes, i.e.\ pairs of codes C,D
whose product under coordinatewise multiplication has maximum possible minimum
distance as a function of the code length and the dimensions .
We prove in particular, for C=D, that if the square of the code C has
minimum distance at least 2, and (C,C) is a Product-MDS pair, then either
C is a generalized Reed-Solomon code, or C is a direct sum of self-dual
codes. In passing we establish coding-theory analogues of classical theorems of
additive combinatorics.
In this text we develop the formalism of products and powers of linear codes
under componentwise multiplication. As an expanded version of the author's talk
at AGCT-14, focus is put mostly on basic properties and descriptive statements
that could otherwise probably not fit in a regular research paper. On the other
hand, more advanced results and applications are only quickly mentioned with
references to the literature. We also point out a few open problems.
Our presentation alternates between two points of view, which the theory
intertwines in an essential way: that of combinatorial coding, and that of
algebraic geometry.
In an appendix that can be read independently, we also establish a criterion,
over a finite field, for a symmetric multilinear map to admit a symmetric
algorithm, or equivalently, for a symmetric tensor to decompose as a sum of
elementary symmetric tensors.
We give an upper bound that relates the minimum weight of a nonzero
componentwise product of codewords from some given number of linear codes, with
the dimensions of these codes. Its shape is a direct generalization of the
classical Singleton bound.
The Ihara limit (or -constant) A(q) has been a central problem of study in
the asymptotic theory of global function fields (or equivalently, algebraic
curves over finite fields). It addresses global function fields with many
rational points and, so far, most applications of this theory do not require
additional properties. Motivated by recent applications, we require global
function fields with the additional property that their zero class divisor
groups contain at most a small number of d-torsion points. We capture this by
the torsion limit, a new asymptotic quantity for global function fields. It
seems that it is even harder to determine values of this new quantity than the
Ihara constant. Nevertheless, some non-trivial lower- and upper bounds are
derived. Apart from this new asymptotic quantity and bounds on it, we also
introduce Riemann-Roch systems of equations. It turns out that this type of
equation system plays an important role in the study of several other problems
in areas such as coding theory, arithmetic secret sharing and multiplication
complexity of finite fields etc. Finally, we show how our new asymptotic
quantity, our bounds on it and Riemann-Roch systems can be used to improve
results in these areas.
If C is a binary linear code, let C^2 be the linear code spanned by
intersections of pairs of codewords of C. We construct an asymptotically good
family of binary linear codes such that, for C ranging in this family, the C^2
also form an asymptotically good family. For this we use algebraic-geometry
codes, concatenation, and a fair amount of bilinear algebra.
More precisely, the two main ingredients used in our construction are, first,
a description of the symmetric square of an odd degree extension field in terms
only of field operations of small degree, and second, a recent result of
Garcia-Stichtenoth-Bassa-Beelen on the number of points of curves on such an
odd degree extension field.
We generalize the existing decoding algorithms by error location for BCH and algebraic-geometric codes to arbitrary linear codes. We investigate the number of dependent sets of error positions. A received word with an independent set of error positions can be corrected.
We present a new approach to the theory of cyclic and constacyclic codes and generalize the theory to cover the family of additive (not necessarily linear) cyclic codes. The approach is based on the action of the Galois group (cyclotomic cosets). The conventional representation of cyclic codes as ideals in a factor ring of the polynomial ring is not needed.
A general decoding method for linear codes is investigated for
cyclic codes. The decoding consists of solving two systems of linear
equations. All but four binary cyclic codes of length less than 63 can
so be decoded up to their actual distance. A new family of codes is
given for which the decoding needs only O(n2)
operations
Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
- Ignacio Cascudo
- Hao Chen
- Ronald Cramer
- Chaoping Xing
Ignacio Cascudo, Hao Chen, Ronald Cramer, and Chaoping Xing. Asymptotically Good Ideal
Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field. In Advances
in Cryptology -CRYPTO 2009, 29th Annual International Cryptology Conference, Santa
Barbara, CA, USA, August 16-20, 2009. Proceedings, pages 466-486, 2009.
Additively Homomorphic UC Commitments with Optimal Amortized Overhead
- Ignacio Cascudo
- Ivan Damgård
- Bernardo Machado David
- Irene Giacomelli
- Jesper Buus Nielsen
- Roberto Trifiletti
Ignacio Cascudo, Ivan Damgård, Bernardo Machado David, Irene Giacomelli, Jesper Buus
Nielsen, and Roberto Trifiletti. Additively Homomorphic UC Commitments with Optimal
Amortized Overhead. In Public-Key Cryptography -PKC 2015 -18th IACR International
Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA,
March 30 -April 1, 2015, Proceedings, pages 495-515, 2015.
General secure multi-party computation from any linear secret-sharing scheme
- Ronald Cramer
- Ivan Damgård
- Ueli M Maurer
Ronald Cramer, Ivan Damgård, and Ueli M. Maurer. General secure multi-party computation
from any linear secret-sharing scheme. In Advances in Cryptology -EUROCRYPT 2000,
International Conference on the Theory and Application of Cryptographic Techniques, Bruges,
Belgium, May 14-18, 2000, Proceeding, pages 316-334, 2000.
The tinytable protocol for 2-party secure computation, or: Gate-scrambling revisited
- Ivan Damgård
- Jesper Buus Nielsen
- Michael Nielsen
- Samuel Ranellucci
Ivan Damgård, Jesper Buus Nielsen, Michael Nielsen, and Samuel Ranellucci. The tinytable
protocol for 2-party secure computation, or: Gate-scrambling revisited. In Advances in Cryptology -CRYPTO 2017 -37th Annual International Cryptology Conference, Santa Barbara,
CA, USA, August 20-24, 2017, Proceedings, Part I, pages 167-187, 2017.
Constant-overhead secure computation of boolean circuits using preprocessing
- Ivan Damgård
- Sarah Zakarias
Ivan Damgård and Sarah Zakarias. Constant-overhead secure computation of boolean circuits
using preprocessing. In Theory of Cryptography -10th Theory of Cryptography Conference,
TCC 2013, Tokyo, Japan, March 3-6, 2013. Proceedings, pages 621-641, 2013.
On the complexity of UC commitments
- Juan A Garay
- Yuval Ishai
- Ranjit Kumaresan
- Hoeteck Wee
Juan A. Garay, Yuval Ishai, Ranjit Kumaresan, and Hoeteck Wee. On the complexity of
UC commitments. In Advances in Cryptology -EUROCRYPT 2014 -33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen,
Denmark, May 11-15, 2014. Proceedings, pages 677-694, 2014.
New Applications of Secret-Sharing in Cryptography
- Irene Giacomelli
Irene Giacomelli. New Applications of Secret-Sharing in Cryptography. PhD thesis, Aarhus
University, Denmark, October 2016.
A unified description of an error locating procedure for linear codes
- Ralf Kötter
Ralf Kötter. A unified description of an error locating procedure for linear codes. In Proceedings of Algebraic and Combinatorial Coding Theory, Voneshta Voda, Bulgaria, pages 113-117,
1992.
Schur products of linear codes: a study of parameters
- Diego Mirandola
Diego Mirandola. Schur products of linear codes: a study of parameters. Master's thesis,
Université de Bordeaux 1 and Stellenbosch University, 2012.
Curves with many points and multiplication in finite fields
- Igor E Shparlinski
- Michael A Tsfasman
- Serge G Vladut
Igor E. Shparlinski, Michael A. Tsfasman, and Serge G. Vladut. Curves with many points
and multiplication in finite fields. Proceedings of the International Workshop held in Luminy,
France, June 1721, 1991. In Coding Theory and Algebraic Geometry., pages 145-169, 1992.