Constructive membership testing in black-box classical groups.

DOI10.1007/978-3-642-15582-6_11MaRDI QIDQ5747858zbMATH OpenOpenAlexFDO

Authors Sophie Ambrose, Murray, Scott H., Cheryl E. Praeger, Csaba Schneider

Publication date 14 September 2010

Published in Mathematical Software – ICMS 2010 (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1006.5858

zbMATH Keywords

algorithmsblack-box groupsconstructive membership problemquasisimple classical groups

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) Linear algebraic groups over finite fields (20G40) Symbolic computation and algebraic computation (68W30)

Abstract: The research described in this note aims at solving the constructive membership problem for the class of quasisimple classical groups. Our algorithms are developed in the black-box group model; that is, they do not require specific characteristics of the representations in which the input groups are given. The elements of a black-box group are represented, not necessarily uniquely, as bit strings of uniform length. We assume the existence of oracles to compute the product of two elements, the inverse of an element, and to test if two strings represent the same element. Solving the constructive membership problem for a black-box group $G$ requires to write every element of $G$ as a word in a given generating set. In practice we write the elements of $G$ as straight-line programs (SLPs) which can be viewed as a compact way of writing words.

Recommendations

• Constructive membership in black-box groups
• Constructive recognition of classical groups in odd characteristic.
• Effective black-box constructive recognition of classical groups.
• Black box classical groups.
• Black box groups.

Cited in

(8)

• Constructive recognition of classical groups in even characteristic.
• Generalised Sifting in Black-Box Groups
• Constructive membership in black-box groups
• Effective black-box constructive recognition of classical groups.
• A practical model for computation with matrix groups.
• Fast Constructive Recognition of Black-Box Unitary Groups
• Gaussian elimination in split unitary groups with an application to public-key cryptography
• Parametric Verification of a Group Membership Algorithm

Describes a project that uses

Uses Software

• GAP
• Magma

This page was built for publication: Constructive membership testing in black-box classical groups.

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