Please use this identifier to cite or link to this item:
http://hdl.handle.net/10263/7421
Title: | Design and analysis of MDS and Near-MDS Matrices and their application to lightweight cryptography |
Authors: | Samanta, Susanta |
Keywords: | MDS matrix Recursive MDS matrix Near-MDS matrix Lightweight Block Cipher |
Issue Date: | Dec-2023 |
Publisher: | Indian Statistical Institute, Kolkata |
Citation: | 282p. |
Series/Report no.: | ISI Ph. D Thesis;TH580 |
Abstract: | In this thesis, 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. |
Description: | This thesis is under the supervision of Prof. Kishan Chand Gupta |
URI: | http://hdl.handle.net/10263/7421 |
Appears in Collections: | Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Thesis_Susanta.pdf | Thesis | 1.63 MB | Adobe PDF | View/Open |
Form17_Susanta.pdf | Form 17 | 1.55 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.