scholarly journals On additive MDS codes over small fields

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Simeon Ball ◽  
Guillermo Gamboa ◽  
Michel Lavrauw

<p style='text-indent:20px;'>Let <inline-formula><tex-math id="M1">\begin{document}$ C $\end{document}</tex-math></inline-formula> be a <inline-formula><tex-math id="M2">\begin{document}$ (n,q^{2k},n-k+1)_{q^2} $\end{document}</tex-math></inline-formula> additive MDS code which is linear over <inline-formula><tex-math id="M3">\begin{document}$ {\mathbb F}_q $\end{document}</tex-math></inline-formula>. We prove that if <inline-formula><tex-math id="M4">\begin{document}$ n \geq q+k $\end{document}</tex-math></inline-formula> and <inline-formula><tex-math id="M5">\begin{document}$ k+1 $\end{document}</tex-math></inline-formula> of the projections of <inline-formula><tex-math id="M6">\begin{document}$ C $\end{document}</tex-math></inline-formula> are linear over <inline-formula><tex-math id="M7">\begin{document}$ {\mathbb F}_{q^2} $\end{document}</tex-math></inline-formula> then <inline-formula><tex-math id="M8">\begin{document}$ C $\end{document}</tex-math></inline-formula> is linear over <inline-formula><tex-math id="M9">\begin{document}$ {\mathbb F}_{q^2} $\end{document}</tex-math></inline-formula>. We use this geometrical theorem, other geometric arguments and some computations to classify all additive MDS codes over <inline-formula><tex-math id="M10">\begin{document}$ {\mathbb F}_q $\end{document}</tex-math></inline-formula> for <inline-formula><tex-math id="M11">\begin{document}$ q \in \{4,8,9\} $\end{document}</tex-math></inline-formula>. We also classify the longest additive MDS codes over <inline-formula><tex-math id="M12">\begin{document}$ {\mathbb F}_{16} $\end{document}</tex-math></inline-formula> which are linear over <inline-formula><tex-math id="M13">\begin{document}$ {\mathbb F}_4 $\end{document}</tex-math></inline-formula>. In these cases, the classifications not only verify the MDS conjecture for additive codes, but also confirm there are no additive non-linear MDS codes which perform as well as their linear counterparts. These results imply that the quantum MDS conjecture holds for <inline-formula><tex-math id="M14">\begin{document}$ q \in \{ 2,3\} $\end{document}</tex-math></inline-formula>.</p>

2019 ◽  
Vol 65 (6) ◽  
pp. 3692-3701 ◽  
Author(s):  
Ryan Gabrys ◽  
Eitan Yaakobi ◽  
Mario Blaum ◽  
Paul H. Siegel
Keyword(s):  

Author(s):  
Ryan Gabrys ◽  
Eitan Yaakobi ◽  
Mario Blaum ◽  
Paul H. Siegel
Keyword(s):  

Author(s):  
Chun Guo ◽  
François-Xavier Standaert ◽  
Weijia Wang ◽  
Xiao Wang ◽  
Yu Yu

Motivated by the recent trend towards low multiplicative complexity blockciphers (e.g., Zorro, CHES 2013; LowMC, EUROCRYPT 2015; HADES, EUROCRYPT 2020; MALICIOUS, CRYPTO 2020), we study their underlying structure partial SPNs, i.e., Substitution-Permutation Networks (SPNs) with parts of the substitution layer replaced by an identity mapping, and put forward the first provable security analysis for such partial SPNs built upon dedicated linear layers. For different instances of partial SPNs using MDS linear layers, we establish strong pseudorandom security as well as practical provable security against impossible differential attacks. By extending the well-established MDS code-based idea, we also propose the first principled design of linear layers that ensures optimal differential propagation. Our results formally confirm the conjecture that partial SPNs achieve the same security as normal SPNs while consuming less non-linearity, in a well-established framework.


2000 ◽  
Vol 213 (1-3) ◽  
pp. 55-65 ◽  
Author(s):  
S.M Dodunekov ◽  
I.N Landjev
Keyword(s):  

2013 ◽  
Vol 11 (03) ◽  
pp. 1350027 ◽  
Author(s):  
MARTIANUS FREDERIC EZERMAN ◽  
SOMPHONG JITMAN ◽  
HAN MAO KIAH ◽  
SAN LING

Using the Calderbank–Shor–Steane (CSS) construction, pure q-ary asymmetric quantum error-correcting codes attaining the quantum Singleton bound are constructed. Such codes are called pure CSS asymmetric quantum maximum distance separable (AQMDS) codes. Assuming the validity of the classical maximum distance separable (MDS) Conjecture, pure CSS AQMDS codes of all possible parameters are accounted for.


Sign in / Sign up

Export Citation Format

Share Document