arXiv (All)
open access
Symmetric Cryptography via Dirichlet Convolution
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$. Suppose on
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Homomorphic encryption for privacy-preserving data aggregation in data spaces.#263139
- Stabilizer-Public-Key Authentication: Long Stabilizer Public Keys Resist Finite-Copy Forgery Attacks#1210049
- Generalized Attack Protection in the Kirchhoff-Law-Johnson-Noise Secure Key Exchanger#295569
- Practical leakage-resilient symmetric cryptography#384965
- Dataset for integrity attacks on time synchronized synchrophasor data#389807
Record · ID 1324641
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive