English
Related papers

Related papers: Exhaustive Search for Small Dimension Recursive MD…

200 papers

MDS matrices allow to build optimal linear diffusion layers in block ciphers. However, MDS matrices cannot be sparse and usually have a large description, inducing costly software/hardware implementations. Recursive MDS matrices allow to…

Cryptography and Security · Computer Science 2014-12-16 Daniel Augot , Matthieu Finiasz

The optimal branch number of MDS matrices makes them a preferred choice for designing diffusion layers in many block ciphers and hash functions. However, in lightweight cryptography, Near-MDS (NMDS) matrices with sub-optimal branch numbers…

Cryptography and Security · Computer Science 2023-08-15 Kishan Chand Gupta , Sumit Kumar Pandey , Susanta Samanta

Many recent block ciphers use Maximum Distance Separable (MDS) matrices in their diffusion layer. The main objective of this operation is to spread as much as possible the differences between the outputs of nonlinear Sboxes. So they…

Cryptography and Security · Computer Science 2014-03-06 Thierry P. Berger

The optimal branch number of MDS matrices makes them a preferred choice for designing diffusion layers in many block ciphers and hash functions. Consequently, various methods have been proposed for designing MDS matrices, including search…

Information Theory · Computer Science 2026-04-10 Kishan Chand Gupta , Sumit Kumar Pandey , Susanta Samanta

In recent years, the Substitution-Permutation Network has emerged as a crucial structure for constructing symmetric key ciphers. Composed primarily of linear matrices and nonlinear S-boxes, it offers a robust foundation for cryptographic…

Cryptography and Security · Computer Science 2024-09-06 Yu Tian , Xiutao Feng , Guangrong Li

Ciphers get their strength from the mathematical functions of confusion and diffusion, also known as substitution and permutation. These were the basics of classical cryptography and they are still the basic part of modern ciphers. In block…

Cryptography and Security · Computer Science 2011-09-01 Muhammad Yasir Malik , Jong-Seon No

In this paper, through considering lightweight cryptography, we present a comparative realization of MDS matrices used in the VLSI implementations of lightweight cryptography. We verify the MixColumn/MixNibble transformation using MDS…

Cryptography and Security · Computer Science 2018-04-19 Anita Aghaie , Mehran Mozaffari Kermani , Reza Azarderakhsh

In symmetric cryptography, maximum distance separable (MDS) matrices with computationally simple inverses have wide applications. Many block ciphers like AES, SQUARE, SHARK, and hash functions like PHOTON use an MDS matrix in the diffusion…

Cryptography and Security · Computer Science 2025-01-03 Tapas Chatterjee , Ayantika Laha

MDS matrices play a critical role in the design of diffusion layers for block ciphers and hash functions due to their optimal branch number. Involutory and orthogonal MDS matrices offer additional benefits by allowing identical or nearly…

Cryptography and Security · Computer Science 2026-01-23 Yogesh Kumar , Susanta Samanta , Atul Gaur

Maximum-distance-separable (MDS) codes are a class of erasure codes that are widely adopted to enhance the reliability of distributed storage systems (DSS). In (n, k) MDS coded DSS, the original data are stored into n distributed nodes in…

Information Theory · Computer Science 2017-06-16 Sheng Guan , Haibin Kan , Xin Wang

In this paper, we propose a novel approach for optimizing the linear layer used in symmetric cryptography. It is observed that these matrices often have circulant structure. The basic idea of this work is to utilize the property to…

Cryptography and Security · Computer Science 2026-05-26 Buji Xu , Xiaoming Sun

In AES-like ciphers, diffusion layers are commonly instantiated using MDS matrices, since their optimal branch number yields strong diffusion guarantees and underpins classical resistance arguments against differential and linear…

Cryptography and Security · Computer Science 2026-05-28 Yogesh Kumar , Akshay Ankush Yadav , Susanta Samanta

A cumbersome operation in many scientific fields, is inverting large full-rank matrices. In this paper, we propose a coded computing approach for recovering matrix inverse approximations. We first present an approximate matrix inversion…

Information Theory · Computer Science 2022-12-21 Neophytos Charalambides , Mert Pilanci , Alfred Hero

Differentiable architecture search (DARTS) is successfully applied in many vision tasks. However, directly using DARTS for Transformers is memory-intensive, which renders the search process infeasible. To this end, we propose a multi-split…

Machine Learning · Computer Science 2021-06-01 Yuekai Zhao , Li Dong , Yelong Shen , Zhihua Zhang , Furu Wei , Weizhu Chen

Compressive sensing(CS) has drawn much attention in recent years due to its low sampling rate as well as high recovery accuracy. As an important procedure, reconstructing a sparse signal from few measurement data has been intensively…

Information Theory · Computer Science 2018-06-25 Yicong He , Fei Wang , Shiyuan Wang , Badong Chen

Masked Diffusion Models (MDMs) offer a promising alternative to autoregressive language models by enabling parallel token generation and bidirectional context modeling. However, their inference speed is significantly limited by the…

Machine Learning · Computer Science 2026-04-08 Satyam Goyal , Kushal Patel , Tanush Mittal , Arjun Laxman

In this paper, we present a diffusion multi-rate least-mean-square (LMS) algorithm, named DMLMS, which is an effective solution for distributed estimation when two or more observation sequences are available with different sampling rates.…

Systems and Control · Computer Science 2020-03-31 Lu Lu , Xiaomin Yang , Rongzhu Zhang

Linear detectors such as zero forcing (ZF) or minimum mean square error (MMSE) are imperative for large/massive MIMO systems for both the downlink and uplink scenarios. However these linear detectors require matrix inversion which is…

Information Theory · Computer Science 2016-11-15 Vipul Gupta , Abhay Kumar Sah , A. K. Chaturvedi

Maximum distance separable (MDS) matrices play a crucial role not only in coding theory but also in the design of block ciphers and hash functions. Of particular interest are involutory MDS matrices, which facilitate the use of a single…

Cryptography and Security · Computer Science 2024-06-18 Yogesh Kumar , P. R. Mishra , Susanta Samanta , Atul Gaur

Diffusion models have recently shown remarkable generation ability, achieving state-of-the-art performance in many tasks. However, the high computational cost is still a troubling problem for diffusion models. To tackle this problem, we…

Computer Vision and Pattern Recognition · Computer Science 2023-11-17 Siao Tang , Xin Wang , Hong Chen , Chaoyu Guan , Yansong Tang , Wenwu zhu
‹ Prev 1 2 3 10 Next ›