10 citations · 18 across the 14 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.CR2021
Graph Automorphism Shuffles from Pile-Scramble Shuffles
Kengo Miyamoto, Kazumasa Shinagawa
A pile-scramble shuffle is one of the most effective shuffles in card-based cryptography. Indeed, many card-based protocols are constructed from pile-scramble shuffles. This articl…
math.RT2021★ 1 cited
Representation-finite tensor product of simply connected algebras
Kengo Miyamoto, Qi Wang
We determine the representation-finiteness of , where both and are simply connected algebras with at least three simple modules.