arXiv (All)
open access
Cyclic Equalizability Characterized by Parikh Vectors
Cyclic equalizability is a notion introduced by Shinagawa and Nuida in 2025, in the study of card-based cryptography. Informally, a collection of words is cyclically equalizable if, by inserting the same letters at the same positions in all words, they can be transformed into words that are cyclic s
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
- A Description of the MISTY1 Encryption Algorithm#134966
- A pseudo one-time-pad based security system#1020565
- Constructions of complete permutations over $\mathbb{F}_q^n$#972621
- New Ideas on a New Old Type of Cipher:The Mixed-Radix One-Time Pad#280124
- Fully homomorphic encryption on the ring of Gaussian periods#377567
Record · ID 1399842
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