http://iet.metastore.ingenta.com
1887

Generalisation of Hadamard matrix to generate involutory MDS matrices for lightweight cryptography

Generalisation of Hadamard matrix to generate involutory MDS matrices for lightweight cryptography

For access to this article, please select a purchase option:

Buy eFirst article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
— Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

In this study, the authors generalise Hadamard matrix over and propose a new form of Hadamard matrix, which they call generalised Hadamard (GHadamard) matrix. Then, they focus on generating lightweight (involutory) maximum distance separable (MDS) matrices. They also extend this idea to any matrix form, where k is not necessarily a power of 2. The new matrix form, GHadamard matrix, is used to generate new involutory MDS matrices over and , and involutory/non-involutory MDS matrices over by considering the minimum exclusive OR (XOR) count, which is a metric defined to estimate the hardware implementation cost. In this context, they improve the best-known results of XOR counts for involutory/non-involutory MDS matrices over .

http://iet.metastore.ingenta.com/content/journals/10.1049/iet-ifs.2017.0156
Loading

Related content

content/journals/10.1049/iet-ifs.2017.0156
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address