Constructing the Chor-Rivest Knapsack Bioinformatics Cryptosystem Enhanced with Elliptic Curve Discrete Logarithms
碩士 === 國立臺北大學 === 電機工程學系 === 101 === Prime factorization of a non-function, the prime factorization of two large prime numbers is given , they can easily be multiplied by two. However, given their product, it becomes a factor to identify them is not so easy. This is why many modern cryptography key....
Main Authors: | Hsiang-Ching Chen, 陳翔靖 |
---|---|
Other Authors: | Shan-Hui Ho |
Format: | Others |
Language: | en_US |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/90081363007797223868 |
Similar Items
-
The discrete logarithm problem on an elliptic curve
by: Lin Kuei-Nuan, et al.
Published: (2000) -
On the Insecurity of Generalized (Rivest-Shamir-Adleman) - Advance and Adaptable Cryptosystem
by: Asbullah, MA, et al.
Published: (2019) -
On the Insecurity of Generalized (Rivest-Shamir-Adleman) - Advance and Adaptable Cryptosystem
by: Asbullah, M.A, et al.
Published: (2019) -
Elliptic curve cryptosystems
by: Saeki, Mugino.
Published: (1997) -
Elliptic Curve Cryptosystems
by: Chieh Wang, et al.
Published: (2003)