Sciweavers

20 search results - page 3 / 4
» Generating a Product of Three Primes with an Unknown Factori...
Sort
View
AAAI
2008
13 years 9 months ago
An Unsupervised Approach for Product Record Normalization across Different Web Sites
An unsupervised probabilistic learning framework for normalizing product records across different retailer Web sites is presented. Our framework decomposes the problem into two ta...
Tak-Lam Wong, Tik-Shun Wong, Wai Lam
ACISP
2005
Springer
14 years 1 months ago
Tunable Balancing of RSA
We propose a key generation method for RSA moduli which allows the cost of the public operations (encryption/verifying) and the private operations (decryption/signing) to be balanc...
Steven D. Galbraith, Chris Heneghan, James F. McKe...
HPCC
2007
Springer
14 years 1 months ago
Optimizing Array Accesses in High Productivity Languages
One of the outcomes of DARPA’s HPCS program has been the creation of three new high productivity languages: Chapel, Fortress, and X10. While these languages have introduced impro...
Mackale Joyner, Zoran Budimlic, Vivek Sarkar
JSAC
2006
199views more  JSAC 2006»
13 years 7 months ago
IDES: An Internet Distance Estimation Service for Large Networks
The responsiveness of networked applications is limited by communications delays, making network distance an important parameter in optimizing the choice of communications peers. S...
Yun Mao, Lawrence K. Saul, Jonathan M. Smith
PKC
2005
Springer
144views Cryptology» more  PKC 2005»
14 years 1 months ago
RSA with Balanced Short Exponents and Its Application to Entity Authentication
In typical RSA, it is impossible to create a key pair (e, d) such that both are simultaneously much shorter than φ(N). This is because if d is selected first, then e will be of t...
Hung-Min Sun, Cheng-Ta Yang