65 citations · 337 across the 40 of their papers we have counts for
5 papers · 1 filter
New Successor Rules to Efficiently Produce Exponentially Many Binary de Bruijn Sequences
Zuling Chang, Martianus Frederic Ezerman, Pinhui Ke +1
We put forward new general criteria to design successor rules that generate binary de Bruijn sequences. Prior fast algorithms based on successor rules in the literature are then sh…
Provably Secure Group Signature Schemes from Code-Based Assumptions
Martianus Frederic Ezerman, Hyung Tae Lee, San Ling +2
We solve an open question in code-based cryptography by introducing two provably secure group signature schemes from code-based assumptions. Our basic scheme satisfies the CPA-anon…
Spectral Bounds for Quasi-Twisted Codes
Martianus Frederic Ezerman, San Ling, Buket Özkaya +1
New lower bounds on the minimum distance of quasi-twisted codes over finite fields are proposed. They are based on spectral analysis and eigenvalues of polynomial matrices. They ge…
Good Stabilizer Codes from Quasi-Cyclic Codes over and
Martianus Frederic Ezerman, San Ling, Buket Özkaya +1
We apply quantum Construction X on quasi-cyclic codes with large Hermitian hulls over and to derive good qubit and qutrit stabilizer codes, respective…
On Greedy Algorithms for Binary de Bruijn Sequences
Zuling Chang, Martianus Frederic Ezerman, Adamas Aqsa Fahreza
We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Opposite (GPO) Algorithm, and its modifications. By identifying specific feedback fu…