Sciweavers

237 search results - page 3 / 48
» MapReduce for Integer Factorization
Sort
View
IPL
2008
82views more  IPL 2008»
13 years 5 months ago
A note on the distribution of the number of prime factors of the integers
The Chernoff-Hoeffding bounds are fundamental probabilistic tools. An elementary approach is presented to obtain a Chernoff-type upper-tail bound for the number of prime factors o...
Aravind Srinivasan
CHES
2005
Springer
155views Cryptology» more  CHES 2005»
13 years 11 months ago
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...
Willi Geiselmann, Adi Shamir, Rainer Steinwandt, E...
BIBE
2004
IEEE
107views Bioinformatics» more  BIBE 2004»
13 years 9 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