2 papers
cs.CR2026
0-Cyclic Equalizability of Binary Words Characterized by Hamming Weight
Sarunyu Thongjarast
The random cut is one of the most fundamental shuffles in card-based cryptography: it rotates a sequence of face-down cards by a secret amount. Under this shuffle, two sequences of…
math.CO2026
Cyclic Equalizability Characterized by Parikh Vectors
Sarunyu Thongjarast, Sarit Pasiphol, Suthee Ruangwises
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…