2014
DOI: 10.1007/978-3-319-06320-1_40
|View full text |Cite
|
Sign up to set email alerts
|

On the Recursive Construction of MDS Matrices for Lightweight Cryptography

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…The other function is MixFunc that used for bit permutation to provide diffusion via multiplication with constant matrix A given in (1). This matrix is MDS (Maximum Distance Separable) matrix that ensures perfect diffusion and maximum branch number [31]. Multiplication with matrix elements is in GF (2 4 ) using the irreducible polynomial x 4 +x+1.…”
Section: A New Key Schedule Proposalmentioning
confidence: 99%
“…The other function is MixFunc that used for bit permutation to provide diffusion via multiplication with constant matrix A given in (1). This matrix is MDS (Maximum Distance Separable) matrix that ensures perfect diffusion and maximum branch number [31]. Multiplication with matrix elements is in GF (2 4 ) using the irreducible polynomial x 4 +x+1.…”
Section: A New Key Schedule Proposalmentioning
confidence: 99%