all InfoSec news
A New Algorithm for Computing Branch Number of Non-Singular Matrices over Finite Fields
May 14, 2024, 4:11 a.m. | P. R. Mishra, Yogesh Kumar, Susanta Samanta, Atul Gaur
cs.CR updates on arXiv.org arxiv.org
Abstract: The notion of branch numbers of a linear transformation is crucial for both linear and differential cryptanalysis. The number of non-zero elements in a state difference or linear mask directly correlates with the active S-Boxes. The differential or linear branch number indicates the minimum number of active S-Boxes in two consecutive rounds of an SPN cipher, specifically for differential or linear cryptanalysis, respectively. This paper presents a new algorithm for computing the branch number of …
algorithm arxiv computing cryptanalysis cs.cr linear non notion numbers singular state transformation
More from arxiv.org / cs.CR updates on arXiv.org
Proactive Detection of Voice Cloning with Localized Watermarking
2 days, 21 hours ago |
arxiv.org
NFT Wash Trading: Direct vs. Indirect Estimation
2 days, 21 hours ago |
arxiv.org
Backdoor Attack with Sparse and Invisible Trigger
2 days, 21 hours ago |
arxiv.org
Jobs in InfoSec / Cybersecurity
CyberSOC Technical Lead
@ Integrity360 | Sandyford, Dublin, Ireland
Cyber Security Strategy Consultant
@ Capco | New York City
Cyber Security Senior Consultant
@ Capco | Chicago, IL
Senior Security Researcher - Linux MacOS EDR (Cortex)
@ Palo Alto Networks | Tel Aviv-Yafo, Israel
Sr. Manager, NetSec GTM Programs
@ Palo Alto Networks | Santa Clara, CA, United States
SOC Analyst I
@ Fortress Security Risk Management | Cleveland, OH, United States