all InfoSec news
A Fast Hash Family for Memory Integrity
Oct. 14, 2022, 1:36 p.m. |
IACR News www.iacr.org
ePrint Report: A Fast Hash Family for Memory Integrity
Qiming Li, Sampo Sovio
We give a first construction of an ϵ-balanced hash
family based on linear transformations of vectors in $\mathbb{F}_2$, where
ϵ = 1/(2n − 1) for n-bit hash values, regardless of the message
size. The parameter n is also the bit length of the input blocks
and the internal state, and can be chosen arbitrarily without
design changes, This hash family is fast, easily parallelized, and
requires no …
More from www.iacr.org / IACR News
ICMS ZKP Workshop: Foundations and Applications of Zero-Knowledge Proofs
1 day, 12 hours ago |
www.iacr.org
RWC 2025: Real World Crypto Symposium
1 day, 12 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
SOC 2 Manager, Audit and Certification
@ Deloitte | US and CA Multiple Locations
Team Lead, Security Operations Center, Cyber Risk
@ Kroll | United Kingdom
Cyber Security Risk Analyst
@ College Board | Remote - Virginia
Lead - IT Security Engineer
@ Bosch Group | BENGALURU, India
Project Cybersecurity Manager
@ Alstom | Bengaluru, KA, IN
Security Consultant
@ CloudSEK | Bengaluru, Karnataka, India