Dissertation > Excellent graduate degree dissertation topics show

The High-Speed RSA Implementation

Author: LinBaiSong
Tutor: WangXiaoYun
School: Shandong University
Course: Information Security
Keywords: RSA cryptosystem Multiple-precision integer arithmetic Montgomery square Siding Window method
CLC: TN918.1
Type: Master's thesis
Year: 2008
Downloads: 226
Quote: 1
Read: Download Dissertation

Abstract


In 1976 year,Diffie and Hellman gave the public-key encryption system and in 1977 3’ear,Rivest,Shamir and Adleman give the first public-key cryptosystem the RSA public-key encryption.From then,people give a large of public-key cryptosystem. Public-key cryptosystem is widely used to provide both secrecy and digital signature.But public-key cryptosystem is based on number-theoretic computational problems,so compute them is slow,which restrict theirs use.So the public-key cryptosystem efficient implementation is a hot topic.The exponentiation in Z_m need much of time in RSA implementation.Modular exponentiation is the key problem in RSA implementation.In this paper,we will discuss the operations of modular exponentiation for multiple-precision integers.To compute exponentiation g~e is to do a serial of multiplication and square.There are two ways to reduce the time required to do exponentiation.One way is to decrease the time to multiply two elements int the group;the other is to reduce the number of multiplications used to compute g~e.So in this paper we will discuss the two ways.For the second way,we mostly analyze the sliding window exponentiation techniques,and we will introduce a useful way for finding the optimization window.For the first way,we analyze the Montgomery multiplication and its improving method.Through the analysis of Montgomery multiplication and exponentiation,we propose the the Montgomery square.Afer analysis and experimental we found the time required to do Montgomery square is about 74.6%of the time required to do Montgomery multiplication.In the sliding window exponentiation,the time required to do exponentiation using Montgomery square and multiplication is about 78.9%compare to only using Montgomery multiplication.In the end we propose a better method for computing the modular exponentiation.

Related Dissertations

  1. Design and Analysis of Two Threshold Proxy Signature Schemes,TP309
  2. Analysis and Research of Proxy Signature Protocols,TP393.08
  3. Analysis of RSA Cryptosystem, Public Key and Private Key,O157.4
  4. Managed PKI system, distributed key technology research,TP393.08
  5. Linear code dynamic secret sharing scheme,TN918.1
  6. Research and Implementation of RSA Cryptography Algorithm,TN918.1
  7. Research on Security of Public-Key Encryption RSA and Implementated with FPGA,TP311
  8. Long -bit-wide modular multiplier design,TN918.1
  9. Subliminal Channel in Multisignature,TN918.1
  10. Study on System of Electronic Documetnt Security Signature,TN918.2
  11. Researches on Digital Signature Scheme Based on Bilinear Map,TN918.1
  12. Research on Blind Signature and Ring Signature,TN918.1
  13. Research on Key Management Scheme for WSN Based on ECC,TN918.82
  14. Threshold proxy signature and its extension,TN918.1
  15. Chaotic Synchronization Control and Its Application in Secure Communication,O231;TN918
  16. Identity-based Digital Signature Scheme,TN918.1
  17. Application of electronic elections identity-based blind signature scheme,TN918.1
  18. Research and Design of a High-Performance Scalable Public Key Cryptographic Coprocessor,TN918.1
  19. The Applications of the SC Chaos Synchronization Method in the Secure Communication,TN918
  20. Research on the Application of Negation Map in Elliptic Curve Cryptosystem,TN918.1
  21. Design of the Authentication and Key Management in the Internet of Things,TN918.82

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