Study on Factorization of n = p * q
碩士 === 國立交通大學 === 資訊科學與工程研究所 === 95 === The RSA Cryptosystem is one of the most used public-key cryptosystems. The security it rests on the fact that it is computationally infeasible to factor a large integer into its component primes. This fact is referred to as the RSA assumption. It is believed t...
Main Authors: | Yu-Hao Chang, 張煜�c |
---|---|
Other Authors: | Yi-Shiung Yeh |
Format: | Others |
Language: | en_US |
Online Access: | http://ndltd.ncl.edu.tw/handle/48362942165229681606 |
Similar Items
-
Notes on |N,p,q|k Summability Factors of Infinite Series
by: W. T. Sulaiman
Published: (2011-01-01) -
Representation of ( p , q ) $(p,q)$ -Bernstein polynomials in terms of ( p , q ) $(p,q)$ -Jacobi polynomials
by: F Soleyman, et al.
Published: (2017-07-01) -
( p , q ) $(\mathrm{p},\mathrm{q})$ -Analysis of Montgomery identity and estimates of ( p , q ) $(\mathrm{p},\mathrm{q})$ -bounds with applications
by: Yu-Ming Chu, et al.
Published: (2021-01-01) -
A note on (p,q) $(p,q)$-Bernstein polynomials and their applications based on (p,q) $(p,q)$-calculus
by: Erkan Agyuz, et al.
Published: (2018-04-01) -
Spacelike submanifolds with parallel mean curvature vector in a de Sitter space S q n + p ( c ) $S^{n+p}_{q}(c)$
by: Junfeng Chen, et al.
Published: (2020-08-01)