all InfoSec news
On non-monomial APcN permutations over finite fields of even characteristic. (arXiv:2205.11418v3 [cs.IT] UPDATED)
June 27, 2022, 1:20 a.m. | Jaeseong Jeong, Namhun Koo, Soonhak Kwon
cs.CR updates on arXiv.org arxiv.org
Recently, a new concept called the $c$-differential uniformity was proposed
by Ellingsen et al. (2020), which allows to simplify some types of differential
cryptanalysis. Since then, finding functions having low $c$-differential
uniformity has attracted the attention of many researchers. However it seems
that, at this moment, there are not many non-monomial permutations having low
$c$-differential uniformity. In this paper, we propose new classes of almost
perfect $c$-nonlinear non-monomial permutations over a binary field.
More from arxiv.org / cs.CR updates on arXiv.org
Jobs in InfoSec / Cybersecurity
Information Technology Specialist II: Network Architect
@ Los Angeles County Employees Retirement Association (LACERA) | Pasadena, CA
Cybersecurity Skills Challenge -- Sponsored by DoD
@ Correlation One | United States
Security Operations Center (SOC) Analyst
@ GK Cybersecurity Group | Remote
Engineering Manager - Cloud Security team
@ SentinelOne | Prague, Czech Republic
Legal & Compliance Apprentice (H/F)
@ Novo Nordisk | Puteaux, Île-de-France, FR
Manager, Governance Risk & Compliance
@ Comcast | Virtual