A NEW PROPOSED METHOD FOR SOLVING AN ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEM

Authors

  • Ammar Ali Neamah

DOI:

https://doi.org/10.31642/JoKMC/2018/010603

Keywords:

Logarithm, ELLIPTIC CURVE

Abstract

In this work, we present a new approach for solving Elliptic Curve Discrete Logarithm Problem. This method provides a new access to the field of attacking methods the Elliptic Curve Cryptosystems. Beside this paper gives a program for executing the proposed method by using MATLAP.

Downloads

Download data is not yet available.

References

A. Escott, J. Sager, A. Selkirk and D.

Tsapakidis, “Attacking Elliptic Curve

Cryptosystems Using The Parallel Pollard

Rho Method”, CryptoBytes–The Technical

Newsletter of RSA Laboratories, volume 4,

number 2, Winter 1999, 15-19. DOI: https://doi.org/10.1109/MPER.1999.808170

W. Fraleigh, “A First Course in Abstract

Algebra”, Third edition, Addison Wesley

Publisher, 1982.

S. D. Galbraith And N. P. Smart

“ Evaluation Report For Cryptrec: Security

Level Of Cryptography–ECDLP Mathematical

Problem ”, 2001.

http://www.ipa.go.jp/security/enc/CRYPTR

EC/fy15/doc/1029_report.pdf.

Koblitz, “A Course in Number Theory

and Cryptography”, Springer-Verlag, 2nd

edition, 1994.

A. Menezes, “Elliptic Curve Public Key

Cryptosystems”, Kluwer Academic Publishers,

A. Menezes, “Evaluation of Security

Level of Cryptography: The Elliptic Curve

Discrete Logarithm Problem (ECDLP)”,

Technical Report

http//www.ipa.go.jp/security/enc/CRYPTRE

C/fy15/doc/1028 ecdlp.pdf.

M. Wiener and R. Zuccherato, “Faster

Attacks on Elliptic Curve Cryptosystems”,

Selected Areas in Cryptography, Lecture

Notes in Computer Science, 1556, Springer-

Verlag, 190-200, 1999. DOI: https://doi.org/10.1017/S007418090011784X

Downloads

Published

2012-12-30

How to Cite

Neamah, A. A. (2012). A NEW PROPOSED METHOD FOR SOLVING AN ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEM. Journal of Kufa for Mathematics and Computer, 1(6), 15–20. https://doi.org/10.31642/JoKMC/2018/010603