Study and Implementation of Gaussian Eliminations in Factorization
碩士 === 義守大學 === 資訊工程學系碩士班 === 99 === RSA is the most popular cryptosystem in many applications such as browser, internet authentication, digital signature, credit card, etc. The security of RSA is based on factoring a large integer. In order to factor a large integer, we must solve the linear equati...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/23712154089099180256 |
| Summary: | 碩士 === 義守大學 === 資訊工程學系碩士班 === 99 === RSA is the most popular cryptosystem in many applications such as browser, internet authentication, digital signature, credit card, etc. The security of RSA is based on factoring a large integer. In order to factor a large integer, we must solve the linear equations only with coefficients 0 and 1 that is called the 0-1 linear equations. In this thesis, we propose an algorithm to improve the classical implementation of Gaussian Elimination by sorting.
Our algorithm compared to classical Gaussian Elimination reduces timer by 56.32% and reduces memory by 88.71% also to attain to 32 times every eliminate on linear equations. In our experience, it is faster to find the linear dependence in factorization. Besides we bring up the program structure and analyze experimenting data.
|
|---|