Dissertation > Excellent graduate degree dissertation topics show

Research on the Algorithm of Elliptic Curve Scalar Multiplication

Author: WangHong
Tutor: LiZuo
School: Xi'an University of Electronic Science and Technology
Course: Cryptography
Keywords: Elliptic Curve Cryptography scalar multiplication NAF side-channel attack side-channel atomicity
CLC: TN918.1
Type: Master's thesis
Year: 2011
Downloads: 81
Quote: 1
Read: Download Dissertation

Abstract


Elliptic Curve Cryptosystem is widely used due to its higher security,less low-cost computing work and smaller private keys, since its being putting forward. Scalar multiplication is difficult and key for its playing an important role in all sorts of elliptic curve cryptographic protocols. Simple power analysis poses threat to elliptic curve cryptographic scalar mutiplication and even regain private keys. This thesis for master’s degree comes up with a side-channel atomic resisting against simple side-channel analysis with improvement of security. The work of this paper is:1.Firstly we make summary of basic theory related with Elliptic Curve Cryptosystem;2.Studying scalar multiplication based on an average Abelian group, we extend scalar mutiplication to elliptic curve group defined in a Galois field and modify the algorithm of k-band scalar multiplication, after analyzing several traditional ones ,with good implementation and high efficiency;3.Regarding security of scalar multiplication,we sum up the method of side-channel attack and implement protected scalar multiplication defined in F p by programming Montgomery Ladder algorithm;4.We bring forward a SPA-resisting side-channel atomicity, the frequency of point doubling and point addition being decreased and time being saved. By exploiting Crypto++ Library we implement our scalar multiplication algorithm for elliptic curve based in 160-bit prime field given by NIST and find a fact that our algorithm is about 37.6% faster than Montgomery Ladder algorithm.

Related Dissertations

  1. Identity-based Digital Signature Scheme,TN918.1
  2. Application of electronic elections identity-based blind signature scheme,TN918.1
  3. Design of Secure E-mail System Based on Encryption,TP393.098
  4. The Reserch on Efficient Divisible E-Cash Based on ECC,TP393.09
  5. Research on Technology of Application Specific Instruction and Reconfigurable Unit of Elliptic Curve Cryptography Coprocessor Design,TN918.2
  6. Authentication and Key Management Based on CPK,TN918.1
  7. Construction and Analysis of Scalar Multiplication Algorithm on Elliptic Curve,TN918.1
  8. Research on Parallel Schedule of Scalar Multiplication of Elliptic Curve Cryptography,TN918.1
  9. Research of Double Matrix Combined Public Key Algorithm and Application,TN918.1
  10. Block Cipher Power Analysis Software System Based on FPGA,TP393.08
  11. ECC-based group key management scheme for MANET research,TN918.82
  12. Threshold Authentication Schemes Based on the Elliptic Curve for Mobile Ad hoc Network,TN918
  13. VLSI Implementation of ECC Scalar Multiplication and Research on Power Analysis Attack,TN918.1
  14. Research and Implementation of Authentication Implied Key Agreement Scheme on WSNs,TN918.82
  15. Research and Implementation of Scalar Multiplication Algorithms and Mixed Encryption on Conic Curve over F2m,TN918.1
  16. The Study of Digital Signature Based on Elliptic Curve Cryptography,TN918.1
  17. Research and Design of a High-Performance Scalable Public Key Cryptographic Coprocessor,TN918.1
  18. Design and Implementation of Two-Party Set-Intersection Private Computing Protocol,TP309
  19. ECC -based threshold group signature scheme,TN918.1
  20. ECC-based network information security technology, design and implementation of a cryptographic device,TP393.08
  21. Implementation of Montgomery Modular Multiplication Base on Pipeline Structure,TN918.1

CLC: > Industrial Technology > Radio electronics, telecommunications technology > Communicate > Confidentiality of communications and communications security > Theory
© 2012 www.DissertationTopic.Net  Mobile