Sciweavers

22 search results - page 1 / 5
» Factoring N = prq for Large r
Sort
View
CRYPTO
1999
Springer
113views Cryptology» more  CRYPTO 1999»
13 years 11 months ago
Factoring N = prq for Large r
Dan Boneh, Glenn Durfee, Nick Howgrave-Graham
ACNS
2007
Springer
172views Cryptology» more  ACNS 2007»
14 years 1 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
JSAC
2006
99views more  JSAC 2006»
13 years 7 months ago
Incentives for large peer-to-peer systems
We consider problems of provisioning an excludable public good amongst n potential members of a peer-to-peer system who are able to communicate information about their private pre...
Costas Courcoubetis, Richard R. Weber
ICPPW
2009
IEEE
13 years 5 months ago
A Scalable Parallel Approach for Peptide Identification from Large-Scale Mass Spectrometry Data
Identifying peptides, which are short polymeric chains of amino acid residues in a protein sequence, is of fundamental importance in systems biology research. The most popular appr...
Gaurav Ramesh Kulkarni, Ananth Kalyanaraman, Willi...
SIAMMAX
2010
134views more  SIAMMAX 2010»
13 years 2 months ago
Dynamical Tensor Approximation
For the approximation of time-dependent data tensors and of solutions to tensor differential equations by tensors of low Tucker rank, we study a computational approach that can be ...
Othmar Koch, Christian Lubich