Abstract
We describe an algorithm to compute the one-dimensional part of the zeta function Z G of an ordinary formal group law G of finite dimension d over a finite field of p N elements and evaluate its time computational complexity. Assume G is given as d formal power series in 2 d variables. Our algorithm computes Z G mod p t with O(d 2p (t−1)(2d+3)N 2( log p) 2) bit operations.
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.
