Abstract
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 , g1,⋯ , gl, compute the least positive integer y and numbers x1,⋯ , xlsuch that hy=∏gixi. This computational problem is important for computing the structure of a finite Abelian group.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
