Abstract
From the existence of algebraic function fields having some good properties, we obtain some new upper bounds on the bilinear complexity of multiplication in all extensions of the finite field Fq, where q is an arbitrary prime power. So we prove that the bilinear complexity of multiplication in the finite fields Fqn is linear uniformly in q with respect to the degree n.
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.
