Symmetric Cryptography via Dirichlet Convolution

Reported by arXiv cs.CR (Artur Sowa, Elias Hassani Sangani, Francis Bui, Grant Harris, Jonathan Norton)

Summary by Cyber Security News14 Oct 2026, 06:00 CET

About this summary. This is a short excerpt from the description that arXiv cs.CR published with its article. Cyber Security News did not report or verify the underlying story. Read the original: https://arxiv.org/abs/2610.14040

arXiv:2610.14040v1 Announce Type: new Abstract: We discuss a new symmetric-key cipher for digital data encryption. Its implementation is fast, memory efficient, and resilient against classical, AI-assisted, and quantum attacks. Let $x$, $k$, and $c$ be elements of a finite abelian group $G$ with operation $+$ and neutral element $0$.

Read the full article at arXiv cs.CR →

Source attribution: headline and facts are from arXiv cs.CR (arxiv.org). Summary method: excerpt of the source description. See our source attribution policy.

Related coverage

Hiding Capabilities in AI Models

Holo-NN: Holographic Nearest Neighbor Search via Compressive Sensing

Bridging Number-Theoretic Primality Testing And Algorithmic Optimization: An Adaptive Cryptographic Framework

Teradata expands AI data security with post-quantum protection and immutable backups

Cryptography Rarely Fails Because of the Math

Quoting Matthew Green