Efficient algorithms for computing superelliptic curves :: IKBFU's united scientific journal editorial office

×

Login
Password
Forgot your password?
Login As
You can log in if you are registered at one of these services:
   
The real and legitimate goal of the sciences is the endowment of human life with new inventions and riches
Francis Bacon

DOI-generator Search by DOI on Crossref.org

Efficient algorithms for computing superelliptic curves

Author Puzakov A.
Pages 58-61
Article Download
Keywords cryptography, algebraic curves, superelliptic curves, functional fields
Abstract (summary) Represents basics algorithms of arithmetics superelliptic curves and optimal parameters superelliptic curve suitable for cryptography.
References 1.Koblitz N. Elliptic curve cryptosystems // Mathematics of Computation. 1987. № 48 (177). P. 203–209.
2. ANSI X9.63 Public Key Cryptography for the Financial Services Industry: El-liptic Curve Key Agreement and Key Transport Schemes. Working Draft - Ver-sion 2.0. 1998.
3. Galbraith S. D., Paulus S. M., Smart N. P. HPL-98-179, 1998.
4. Basiri A., Enge A., Faugere J. C., Gurel N. // Mathematics of Computation. 1998. № 74 (249). P. 389–410.
5. Galbraith S. D., Paulus S. M., Smart N. P. // Mathematics of Computation. 2002. № 71 (237). P. 393–405.
6. Ковтун В. Ю. Криптография с открытым ключом. URL: http://www.
nrjetix.com/fileadmin/doc/publications/additional_info/public_key_cryptography _-_lecture.pdf (дата обращения: 10.07.2015).
7. Алешников С. И. Рекуррентная процедура вычисления представляющих многочленов в алгоритме шифрования, основанном на гиперэллиптических кривых // Вестник Российского государственного университете им. И. Канта. 2007. Вып. 10. С. 65—69.

Back to the section