all InfoSec news
On the Direct Construction of MDS and Near-MDS Matrices
April 9, 2024, 4:12 a.m. | Kishan Chand Gupta, Sumit Kumar Pandey, Susanta Samanta
cs.CR updates on arXiv.org arxiv.org
Abstract: 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 and direct methods. While exhaustive search is suitable for small order MDS matrices, direct constructions are preferred for larger orders due to the vast search space involved. In the literature, there has been extensive research on the direct construction of …
arxiv block ciphers construction cs.cr cs.it functions hash hash functions math.it mds near order search suitable
More from arxiv.org / cs.CR updates on arXiv.org
Jobs in InfoSec / Cybersecurity
Sr. Cloud Security Engineer
@ BLOCKCHAINS | USA - Remote
Network Security (SDWAN: Velocloud) Infrastructure Lead
@ Sopra Steria | Noida, Uttar Pradesh, India
Senior Python Engineer, Cloud Security
@ Darktrace | Cambridge
Senior Security Consultant
@ Nokia | United States
Manager, Threat Operations
@ Ivanti | United States, Remote
Lead Cybersecurity Architect - Threat Modeling | AWS Cloud Security
@ JPMorgan Chase & Co. | Columbus, OH, United States