Security
CHAMP: Cayley HAshing with Matrix Products
arXiv cs.CR0 views
arXiv:2610.04442v2 Announce Type: replace Abstract: Cayley hash functions hash binary strings by representing the bits of the message as elements of a semigroup and multiplying the corresponding elements. This gives Cayley hash functions useful homomorphic properties. Here, we propose CHAMP, a Cayley hash function based on products of 2 by 2 matrices over a finite field, and discuss its security, implementation, and performance.
Source:https://arxiv.org/abs/2610.04442PreviousActions with Receipts: Jointly Binding Claims, Evidence, and Execution for Replayable Tool-Agent AuditingNextCT0: Cybersecurity Transformer
Related posts
CVE-2026-106074: a build-time randomness leak in Node.js snapshots
0dev.to Node
LanG 2.0: Energy-Efficient Agentic AI for Semi-Automated Security Operations at Scale
0arXiv cs.CR
Characterizing Recoverable Expert-Utilization Signatures in Fine-Tuned Mixture-of-Experts LLMs
0arXiv cs.CR
Mutipath TCP: Use and Detection, (Mon, Nov 2nd)
0SANS ISC
AI Vulnerability Finding
0Schneier on Security
[$] Managing the kernel CVE flood
0LWN.net