Generating random elements in finite groups.

zbMath1169.20035MaRDI QIDQ1010821

John D. Dixon

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/130477

zbMATH Keywords

algorithmsfinite groupsprobability distributionsrandom elementsrandom generators of groups

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04) Randomized algorithms (68W20) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15) Probabilistic methods in group theory (20P05)

Related Items

\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments ⋮ Interactions of computational complexity theory and mathematics ⋮ The product replacement prospector. ⋮ Black box exceptional groups of Lie type. II. ⋮ Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas ⋮ A polynomial-time reduction algorithm for groups of semilinear or subfield class. ⋮ Towards Constructing Fully Homomorphic Encryption without Ciphertext Noise from Group Theory ⋮ Black box exceptional groups of Lie type