A New Method for Computing the Inverse Ideal in a Coordinate Ring
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 33122
A New Method for Computing the Inverse Ideal in a Coordinate Ring

Authors: Abdolali Basiri

Abstract:

In this paper we present an efficient method for inverting an ideal in the ideal class group of a Cab curve by extending the method which is presented in [3]. More precisely we introduce a useful generator for the inverse ideal as a K[X]-module.

Keywords: Cab Curves, Ideal Class Group

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1057795

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1052

References:


[1] S. Arita. Algorithms for computations in Jacobian group of Cab curve and their application to discrete-log based public key cryptosystems. IEICE Transactions, J82-A(8):1291-1299, 1999. In Japanese. English translation in the proceedings of the Conference on The Mathematics of Public Key Cryptography, Toronto 1999.
[2] S. Arita, S. Miura, and T. Sekiguchi. An addition algorithm on the jacobian varieties of curves. Journal of the Ramanujan Mathematical Society, 19(4):235-251, December 2004.
[3] A. Basiri, A. Enge, J.-C. Faug`ere, and N. G¨urel. The arithmetic of jacobian groups of superelliptic cubics. Math. Comp., 74:389-410, 2005.
[4] S.-D. Galbraith, S. Paulus, and N.-P. Smart. Arithmetic on superelliptic curves. Mathematics of Computation, 71(237):393–405, 2002.
[5] S. Miura. Linear codes on affine algebraic curves. IEICE Transactions, J81-A:1398–1421, 1998. In Japanese. English summary by Ryutaroh Matsumoto available at http://www.rmatsumoto.org/cab.html.
[6] S. Miura and N. Kamiya. Geometric goppa codes on some maxima curves and their minimum distance. In IEEE Worksop on Information Theory, pages 85–86, Susono-shi, Japan, June 1993.
[7] Wikipedia encyclopedia. http://en.wikipedia.org/wiki/Mathematics