Implementasi Algoritma ECDSA untuk Pengamanan E-Mail (Verifikasi Keaslian Pesan)

This final project is discussed about implementation of digital signature on email delivery with java programming language. Digital signature is one of the cryptographic security services that provide assurance to the recipient of the message (receiver). Given the assurance that the sender of the message is the sender, not a third party (eyesdropper) and received messages are genuine. Elliptic Curve Digital Signature Algorithm (ECDSA) is one method of digital signatures on Elliptic Curve Cryptography (ECC). ECC is a public-key cryptography using the Elliptic Curve Discrete Logarithm Problem (ECDLP) as the basic math. ECDLP used is Q = kP, where Q and P are the points on the elliptic curve of F2m Finite field and k is positive integers. This final project provide an email client application that integrated with ECDSA algorithm, so it can be able to provide digital signature on sent message, to verify the digital signature on a received message, and give a warning if the verification fails, which means received email was not genuine

Implementation of Elliptic Curve Crypto Processor and Its Performance Analysis

ECDSA stands for "Elliptic Curve Digital Signature Algorithm", its used to create a digital signature of data (a file for example) in order to allow you toverify its authenticity without compromising its security. This paper presents the architecture of finite field multiplication. The proposed multiplier is hybrid Karatsuba multiplier used in this processor. For multiplicative inverse we choose the Itoh-Tsujii Algorithm (ITA). This work presents the design of high performance elliptic curve crypto processor (ECCP) for an elliptic curve over the finite field GF (2^233). The curve which we choose is the standard curve for the digital signature. The processor is synthesized for Xilinx FPGA

Elliptical Curve Digital Signatures Algorithm

Elliptical digital signatures algorithm provides security services for resource constrained embedded devices. The ECDSA level security can be enhanced by several parameters as parameter key size and the security level of ECDSA elementary modules such as hash function, elliptic curve point multiplication on koblitz curve which is used to compute public key and a pseudo-random generator which generates key pair generation. This paper describes novel security approach on authentication schemes as a modification of ECDSA scheme. This paper provides a comprehensive survey of recent developments on elliptic curve digital signatures approaches. The survey of ECDSA involves major issues like security of cryptosystem, RFID-tag authentication, Montgomery multiplication over binary fields, Scaling techniques, Signature generation ,signature verification, point addition and point doubling of the different coordinate system and classification. DOI: 10.17762/ijritcc2321-8169.150318

IMPLEMENTASI ALGORITMA TANDA TANGAN DIGITAL BERBASIS KRIPTOGRAFI KURVA ELIPTIK DIFFIE-HELLMAN

In data communication systems, digital signatures are a form of electronic signature security services based on the Elliptic Curve Digital Signature Algorithm (ECDSA) which are considered resistant to certain types of attacks. Attacks on digital signature schemes aim to fake a signature or are called forgery which is said to be successful if the key pair and signature generated by the attacker are accepted by the verifier. Mathematical schemes used to prove the authenticity of messages or digital documents or guarantees that the data and information actually come from the correct source. ECDSA-based digital signatures rely on discrete logarithmic problems as the basis for mathematical calculations. Q = kP where Q and P are the points of the elliptic curve in the finite field  or  and k is a positive integer number. The hash function generated from the algorithm process is then encoded (encrypted) with an asymmetric key cryptographic algorithm. In this work use p = 149 to encrypt plain text by converting the original message using dots on a curve with the help of Python programs. 

ANALISIS PERBANDINGAN METODE DSA DAN ECDSA PADA IMPLEMENTASI TANDATANGAN DIGITAL

ABSTRAKSI: Tandatangan digital pada umumnya menggunakan tipe kunci asimetrik yaitu pasangan kunci yang berbeda. Penentuan pasangan kunci diperoleh melalui tahapan algoritma yang panjang. Pada tugas akhir ini akan dibahas proses penandatanganan digital menggunakan metode Digital Signature Algorithm (DSA) dan Elliptic Curve Digital Signature Algorithm (ECDSA). Kedua metode tersebut beranalogi satu sama lain. DSA lebih menekankan pada tingkat kesulitan faktorisasi integer dan logaritma diskrit, sedangkan pada ECDSA selain kedua skematik tsb juga menekankan pada kesulitan penentuan nilai pada kurva ellips. Dengan kata lain kedua metode tsb memiliki domain yang berbeda. Kekuatan penting dalam tandatangan digital terletak pada tingkat keamanannya. Tingkat keamanan metode akan dianalisa melalui uji korelasi dan kompleksitas proses algoritma cracking yang pernah ada. Uji korelasi adalah pengujian untuk melihat tingkat keterhubungan antara dua nilai yang berbeda. Uji korelasi dilakukan terhadap nilai bit tandatangan dengan sidik jari pesan yang dihasilkan oleh fungsi hash. Keamanan juga akan dianalisa dengan kompleksitas waktu algoritma cracking yang pernah ada untuk memecahkan metode DSA dan ECDSA. Perbandingan kecepatan metode dianalisa pada saat proses penandatanganan dan verifikasi pesan.Kata Kunci : Digital Signature Algorithm (DSA), Elliptic Curve Digital SignatureABSTRACT: Digital signatures are commonly implemented through the use of asymmetric keys, which is a pair of non identical \u27keys\u27. The formulation of these \u27key pairs\u27 is done through long (mathematical) algorithms. In this final assignment we will discuss about digital signing process using the Digital Signature Algorithm(DSA) method and Elliptic Curve Digital Signature Algorithm(ECDSA) method. Both of those methods mentioned above are paralled to each other. Process in aquiring each points has different steps, therefore the quality of the points is different. DSA puts more emphasize on rigid integer factorization and discrete logarithm,while ECDSA applies point determination on elliptical curve in addition to those two schematic mentioned above. In other words, those two methods have a different domain. The important point on digital signature lies on its security level. This security level would be analyze through corelation test. Corelation test\u27s objective is to determine link between two different points. Corelation test done against signature bit point and using fingerprint value that computed by hash function. Security level will also be analyzed by time complexity algorithm cracking DSA method and ECDSA method have been ever. Comparison speed of metode would be analyze throuh assignment signature and verification signature.Keyword: Digital Signature Algorithm(DSA), Elliptic Curve Digital Signatur

An Elliptic curve digital signature algorithm (ECDSA) for securing data : an exemplar of securing patient's data

The conference aimed at supporting and stimulating active productive research set to strengthen the technical foundations of engineers and scientists in the continent, through developing strong technical foundations and skills, leading to new small to medium enterprises within the African sub-continent. It also seeked to encourage the emergence of functionally skilled technocrats within the continent.In this paper, we present the progress of our work in the creation and implementation of an Elliptic Curve Digital Signature Algorithm (ECDSA). We present the design of the algorithm and its implementation in encryption of medical data. ECDSA PHP ECC code has been used to implement the digital signatures over elliptic curve P-256. The work presented highlights practical implementation of ECDSA signature generation to secure and authenticate patient laboratory test results in a Laboratory Information System (LIS). Future work will demonstrate the implementation of decryption using the ECDSA. With the inherent superiority capability of Elliptic Curves (EC) in securing data, our algorithm is highly secure and can be adapted in many areas where data privacy and security is paramount.Strathmore University; Institute of Electrical and Electronics Engineers (IEEE

ECDSA optimizations on an ARM processor for a NIST curve over GF(p)

The Elliptic Curve Digital Signature Algorithm (ECDSA) is the elliptic curve analog of the Digital Signature Algorithm (DSA) and a federal government approved digital signature method. In this thesis work, software optimization techniques were applied to speed up the ECDSA for a particular NTST curve over GF(p). The Montgomery multiplication is used extensively in the ECDSA. By taking advantage of the algorithmic properties of the Montgomery multiplication method, special structure of the curve parameters and also applying certain fundamental and specific software optimization techniques, we have achieved an overall 26% speed improvement. Further enhancements were made by implementing the Montgomery multiplication in the ARM assembly language that resulted in 44% speed improvement. The optimizations discussed in this thesis could easily be adapted to other curves with or without changes