Design and analysis of MDS and Near-MDS Matrices and their application to lightweight cryptography

Date of Submission

December 2023

Date of Award

12-1-2024

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Doctoral Thesis

Degree Name

Doctor of Philosophy

Subject Name

Computer Science

Department

Applied Statistics Unit (ASU-Kolkata)

Supervisor

Gupta, Kishan Chand (ASU-Kolkata; ISI)

Abstract (Summary of the Work)

we focus on studying MDS and Near-MDS (NMDS) matrices and explore their construction in both recursive and nonrecursive settings. We present several theoretical results and analyze the hardware efficiency of MDS and NMDS matrix constructions. We begin by providing a comprehensive study of MDS matrices over finite fields. This study not only summarizes existing results but also reveals deep and nontrivial connections among various constructions of MDS matrices. Next, we delve into the study of various sparse matrix structures for the construction of both MDS and NMDS matrices in recursive settings. Additionally, we explore various structures for the nonrecursive construction of NMDS matrices, including circulant and left-circulant matrices, as well as their generalizations such as Toeplitz and Hankel matrices. Whenever possible, we also make comparisons between the results of NMDS and MDS matrices. Next, we present various techniques for direct constructions of MDS and NMDS matrices in both recursive and nonrecursive approaches. In the recursive approach, we derive recursive MDS and NMDS matrices from companion matrices, while direct constructions of nonrecursive MDS and NMDS matrices are obtained by using two generalized Vandermonde matrices. Furthermore, we propose a direct method for constructing involutory MDS and NMDS matrices. Finally, we introduce FUTURE, a new SPN-based lightweight block cipher designed with minimal latency and low hardware implementation cost in mind. To achieve the best diffusion in the linear layer, FUTURE incorporates an MDS matrix in its round function. While the use of MDS matrices in lightweight block ciphers is typically avoided due to their high implementation cost. The MDS matrix in FUTURE is composed of four sparse matrices, striking a balance between diffusion property and implementation cost. In addition, FUTURE adopts a lightweight yet cryptographically significant Sbox, which is formed by combining four different Sboxes. By combining these design choices, FUTURE successfully combines lightweight implementation with the desirable properties of MDS matrices, offering an effective solution for designing lightweight block ciphers

Comments

ProQuest Collection ID: https://www.proquest.com/pqdtlocal1010185/dissertations/fromDatabasesLayer?accountid=27563

Control Number

ISILib-TH

Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

DOI

http://dspace.isical.ac.in:8080/jspui/handle/10263/2146

Link to Full Text

Share

COinS