Sciweavers

CSL
2008
Springer
13 years 5 months ago
Proving Infinitude of Prime Numbers Using Binomial Coefficients
We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some &...
Phuong Nguyen
BIBE
2004
IEEE
107views Bioinformatics» more  BIBE 2004»
13 years 7 months ago
Fast Parallel Molecular Algorithms for DNA-based Computation: Factoring Integers
The RSA public-key cryptosystem is an algorithm that converts input data to an unrecognizable encryption and converts the unrecognizable data back into its original decryption form...
Weng-Long Chang, Michael (Shan-Hui) Ho, Minyi Guo
ACNS
2007
Springer
172views Cryptology» more  ACNS 2007»
13 years 9 months ago
Estimating the Prime-Factors of an RSA Modulus and an Extension of the Wiener Attack
In the RSA system, balanced modulus N denotes a product of two large prime numbers p and q, where q < p < 2q. Since IntegerFactorization is difficult, p and q are simply esti...
Hung-Min Sun, Mu-En Wu, Yao-Hsin Chen