On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields

DOI10.1137/S0097539704446037zbMath1110.11039MaRDI QIDQ5317204

Qi Cheng

Publication date: 16 September 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

finite fieldsdiscrete logarithm problemparameterized complexitysum-of-digits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)

Related Items

Dynamic simulation of 1D cellular automata in the Active aTAM, ASYNCHRONOUS SIGNAL PASSING FOR TILE SELF-ASSEMBLY: FUEL EFFICIENT COMPUTATION AND EFFICIENT ASSEMBLY OF SHAPES, Covert computation in self-assembled circuits, Identifying shapes using self-assembly, Reducing tile complexity for the self-assembly of scaled shapes through temperature programming, Signal transmission across tile assemblies: 3D static tiles simulate active self-assembly by 2D signal-passing tiles, Hierarchical growth is necessary and (sometimes) sufficient to self-assemble discrete self-similar fractals, Hierarchical Self-Assembly of Fractals with Signal-Passing Tiles, Unnamed Item