arXiv (All)
open access
A Class of Shift-Invariant Permutations and Their Algebraic Structure
Shift-invariant permutations of $\mathbb F_2^n$ are attractive in symmetric cryptography because of their regularity and implementation efficiency. Constructing such permutations with an explicit algebraic structure remains a challenging problem. In this paper, we study a family of shift-invariant t
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
- Stabilizer-Public-Key Authentication: Partial Prediction Bounds and Limits of Key Reuse#1034851
- Basis Rigidity of the AES S-box and Generic Rigidity of Inversion under Affine Transformations#1071413
- Locus: A Framework for Exploring and Optimizing Point Addition Hardware for Zero-Knowledge Proofs#1013004
- Locus: A Framework for Exploring and Optimizing Point Addition Hardware for Zero-Knowledge Proofs#965328
- Digital Authentication for Wireless Domain Using Variable Marking of Multiple Secret Signatures and its Practical Implication in E-Stamp Authentication#704914
Record · ID 1105732
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