Small Generating Sets and DLPC Problem

DOI10.3233/FI-2016-1351MaRDI QIDQ4976409zbMATH OpenOpenAlexFDO

Authors Jacek Pomykała

Publication date 28 July 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2016-1351

zbMATH Keywords

\(\mathbb Z^\ast_n\)-generating setsDirichlet charactersdiscrete logarithm problem for composite numbersfactoring algorithmslarge sieve estimatessmooth numbers

Mathematics Subject Classification ID

Factorization; primality (11A51) Factorization (11Y05)

Recommendations

• On Finding Small 2-Generating Sets
• Computing generating sets of minimal size in finite algebras
• Generating small automata and the Černý conjecture
• scientific article; zbMATH DE number 716402
• Sets with small generalized Kolmogorov complexity
• On the complexity of discrete generation problems
• NP-completeness of small conflict set generation for congruence closure
• On set expansion problems and the small set expansion conjecture
• On Set Expansion Problems and the Small Set Expansion Conjecture
• scientific article; zbMATH DE number 1948991

Cited in

(2)

• NP-completeness of small conflict set generation for congruence closure
• On reducing factorization to the discrete logarithm problem modulo a composite

This page was built for publication: Small Generating Sets and DLPC Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976409)