The Pohlig–Hellman Method Generalized for Group Structure Computation
✍ Scribed by Edlyn Teske
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 451 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
✦ Synopsis
We present a new algorithm that extends the techniques of the Pohlig-Hellman algorithm for discrete logarithm computation to the following situation: given a finite Abelian group and group elements h, g 1 , . . . , g l , compute the least positive integer y and numbers x 1 , . . . , x l such that h y = g i x i . This computational problem is important for computing the structure of a finite Abelian group.
📜 SIMILAR VOLUMES
## Abstract Aromatic amino groups are replaced with deuterium via a diazonium salt intermediate. Dimethylformamide‐d~7~ is the deuterium donor in this mild replacement method that yields aromatic‐__d__~1~ products in high isotopic purity. The presence of methyl groups lowers the isotopic purity of
## Abstract In this work, a numerical procedure is presented to obtain a sparse moment matrix for thin‐wire electromagnetic scattering problems. The numerical procedure involves developing a set of basis functions spanning several subdomains, as opposed to spanning one or two subdomains in the conv