Properties of constacyclic codes under the Schur product
From MaRDI portal
Publication:2182071
DOI10.1007/s10623-020-00720-3zbMath1448.94286arXiv1810.07630OpenAlexW3005311743MaRDI QIDQ2182071
Nadia Heninger, Michael Rudow, Brett Hemenway Falk
Publication date: 21 May 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.07630
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- On quasi-twisted codes over finite fields
- An efficient structural attack on NIST submission DAGS
- DAGS: key encapsulation using dyadic GS codes
- Recovering short secret keys of RLCE in polynomial time
- Squares of matrix-product codes
- Quasi-cyclic codes with cyclic constituent codes
- A generalization of quasi-twisted codes: multi-twisted codes
- How to mask the structure of codes for a cryptographic use
- On products and powers of linear codes under componentwise multiplication
- Squares of Random Linear Codes
- Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
- Algebraic Cryptanalysis of McEliece Variants with Compact Keys
- Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
- Lattice-based Cryptography
- Reducing Key Length of the McEliece Cryptosystem
- A public-key cryptosystem based on binary Reed-Muller codes
- On the algebraic structure of quasi-cyclic codes .I. Finite fields
- On Squares of Cyclic Codes
- A Toolkit for Ring-LWE Cryptography
- A Distinguisher for High-Rate McEliece Cryptosystems
- Efficient Encryption From Random Quasi-Cyclic Codes
- Cryptanalysis of the Sidelnikov Cryptosystem
- Secure Multiparty Computation and Secret Sharing
- The structure of 1-generator quasi-twisted codes and new linear codes
