Search papers, labs, and topics across Lattice.
Department of Computer Engineering, Faculty of Engineering, Chulalongkorn University, Bangkok, Thailand
2
0
1
9
Cyclic equalizability, a concept relevant to card-based cryptography, boils down to having identical Parikh vectors.
Not all card shuffles are created equal: this work exposes a provable hierarchy of shuffle complexities in card-based cryptography, revealing fundamental limits on what can be achieved with simpler shuffling primitives.
