- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
On the lower bound of cost of MDS matrices ; volume:2022 ; number:4 ; pages:266-290
IACR transactions on symmetric cryptology ; 2022, Heft 4, 266-290
- Klassifikation
-
Informatik
- Urheber
-
Venkateswarlu, Ayineedi
Kesarwani, Abhishek
Sarkar, Sumanta
- DOI
-
10.46586/tosc.v2022.i4.266-290
- URN
-
urn:nbn:de:hbz:294-ToSC-3061
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:00 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Venkateswarlu, Ayineedi
- Kesarwani, Abhishek
- Sarkar, Sumanta
Ähnliche Objekte (12)
Lower bound of four-dimensional Hausdorff matrices
MDS matrices with lightweight circuits
Lower bounds for the low-rank matrix approximation
On efficient constructions of lightweight MDS matrices
Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization
Exhaustive search for various types of MDS matrices
Shorter linear straight-line programs for MDS matrices
The cost of overcoming the zero lower-bound: A welfare analysis
The lower bounds for the rank of matrices and some sufficient conditions for nonsingular matrices
MDS
Proportionality’s Lower Bound
Constructing low latency involutory MDS matrices with lightweight circuits
Lower bound of four-dimensional Hausdorff matrices
MDS matrices with lightweight circuits
Lower bounds for the low-rank matrix approximation
On efficient constructions of lightweight MDS matrices
Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization
Exhaustive search for various types of MDS matrices
Shorter linear straight-line programs for MDS matrices
The cost of overcoming the zero lower-bound: A welfare analysis
The lower bounds for the rank of matrices and some sufficient conditions for nonsingular matrices
MDS
Proportionality’s Lower Bound
Constructing low latency involutory MDS matrices with lightweight circuits
Lower bound of four-dimensional Hausdorff matrices
MDS matrices with lightweight circuits
Lower bounds for the low-rank matrix approximation
On efficient constructions of lightweight MDS matrices
Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization
Exhaustive search for various types of MDS matrices
Shorter linear straight-line programs for MDS matrices
The cost of overcoming the zero lower-bound: A welfare analysis
The lower bounds for the rank of matrices and some sufficient conditions for nonsingular matrices
MDS
Proportionality’s Lower Bound