Sciweavers

23 search results - page 1 / 5
» Large primes and Fermat factors
Sort
View
MOC
1998
66views more  MOC 1998»
13 years 4 months ago
Large primes and Fermat factors
A systematic search for large primes has yielded the largest Fermat factors known.
Jeff Young
FPGA
2000
ACM
128views FPGA» more  FPGA 2000»
13 years 8 months ago
Factoring large numbers with programmable hardware
The fastest known algorithms for factoring large numbers share a core sieving technique. The sieving cores find numbers that are completely factored over a prime base set raised t...
Hea Joung Kim, William H. Mangione-Smith
ACNS
2007
Springer
172views Cryptology» more  ACNS 2007»
13 years 11 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
BIBE
2004
IEEE
107views Bioinformatics» more  BIBE 2004»
13 years 8 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
BMCBI
2010
154views more  BMCBI 2010»
13 years 2 months ago
Knowledge-based matrix factorization temporally resolves the cellular responses to IL-6 stimulation
Background: External stimulations of cells by hormones, cytokines or growth factors activate signal transduction pathways that subsequently induce a re-arrangement of cellular gen...
Andreas Kowarsch, Florian Blöchl, Sebastian B...