可嵌入特定資訊RSA密碼系統之軟體設計

Software Implementation of RSA Cryptosystem with Embedding Specific Information

莊博鈞(Po-Chun Chuang)

指導教授 ： 楊吳泉

義守大學/電機資訊學院/資訊工程學系/碩士(2014年)

https://doi.org/10.6343/ISU.2014.00486

摘要

近年來網路使用的頻繁，電子化服務也隨之增加，因此確認身分也變得相對重要，藉以提供一個安全的秘密通訊，達到保密跟隱私的功能，並且可以辨識資料的來源，就是密碼系統的主要目的。
密碼系統可大致分為兩種：秘密金鑰(對稱式)密碼系統及公開(非對稱式)金鑰密碼系統。公開金鑰密碼系統一般用於加密傳輸資料之對稱式密碼系統金鑰，使用之公開金鑰必須能夠辨識身分，一般使用憑證方式來實現，如果能夠將身分辨識資料，如使用者序號、名稱等嵌入公開金鑰中，可以提高金鑰之辨識。
本研究旨在RSA密碼系統中嵌入身分資訊並根據Java Cryptography Architecture(JCA)規範來實現相關嵌入特定資訊的技術與構想。固定位元的技術採用學者A. K. Lenstra所提出在RSA中固定位元的演算法。在RSA公鑰的指定位置中嵌入特定資訊，在加解密的過程中不易遭到竄改，藉此可提高不可否認性及驗證等特性。

關鍵字

none

並列摘要

Nowadays the Internet has been used such usually, thus the use of much more important. In order to provide a safe and secret communications, reaching confidentiality with privacy features to identify the information source that is the main purpose of cryptosystem.
Cryptosystem can be divided into two categories : secret key (symmetric) cryptosystem and public (asymmetric) key cryptosystem. Public-key cryptosystem is used for symmetric cryptosystem keys generally to encrypt the transmission of information, the use of public key must be able to recognize the identity of the certificate is generally used to achieve. If we can use identity information, such as series number, name, etc. embedded into public key, then it may improve the key for recognition.
In this thesis, we propose a method that embed RSA cryptosystem identity information and in accordance with Java Cryptography Architecture (JCA) specification to achieve theidea-related technologies and embedded-specific information. The technology using a fixed bit scholar A.K. Lenstra proposed in fixed bit RSA algorithm. RSA public key embedded in the specified location of the specific information in the encryption and decryption process is hard to Integrity, thereby improve non- repudiation and verification and other characteristics.

並列關鍵字

RSA ； JCA ； Predetermined Portion

參考文獻

[2] William Stallings , Cryptography and Network Security, 4/e, Prentice Hall, Nov. 2005.

[3] M.Joye, "RSA moduli with a predetermined portion: Techniques and applications," in Information Security Practice and Experience, ed: Springer, 2008, pp. 116-130.

[4] A.K.Lenstra, "Generating RSA moduli with a predetermined portion," in Advances in Cryptology—Asiacrypt’98, 1998, p. 1-10.

[8] T. E. Lindquist, M. Diarra, and B. R. Millard, "A java cryptography service provider implementing one-time pad," in Proceedings of the 37th Annual Hawaii International Conference on System Sciences, 2004..

[11] Jonathan Knudsen, Java Cryptography, O’Reilly, May.1998.