Fast ideal cubing in imaginary quadratic number and function fields

DOI10.3934/AMC.2010.4.237zbMATH Open1213.94110OpenAlexW2056606905MaRDI QIDQ540368FDOQ540368

Authors: Laurent Imbert, Arthur Schmidt, Michael J. Jacobson jun. 

Publication date: 3 June 2011

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2010.4.237

Recommendations

• scientific article; zbMATH DE number 1113821
• A fast algorithm to compute cubic fields
• Computations in cubic function fields of characteristic three
• Ideal arithmetic and infrastructure in purely cubic function fields
• A New Algorithm for Long Integer Cube Computation with Some Insight into Higher Powers

zbMATH Keywords

hyperelliptic curvesquadratic fieldsquadratic function fieldsdouble base number systemsideal arithmetic

Mathematics Subject Classification ID

Cryptography (94A60) Computational aspects of algebraic curves (14Q05) Special algebraic curves and curves of low genus (14H45)

Cited In (3)

• Improving the Pocklington and Padró-Sáez cube root algorithm
• Title not available (Why is that?)
• Cryptographic aspects of real hyperelliptic curves

This page was built for publication: Fast ideal cubing in imaginary quadratic number and function fields

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