424 search results - page 21 / 85 » Balanced Incomplete Factorization |
126
click to vote
ACNS
2007
Springer
15 years 8 months ago
2007
Springer
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...
105
Voted
WADS
1989
Springer
15 years 6 months ago
1989
Springer
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
146
Voted
MST
2006
15 years 1 months ago
2006
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
115
click to vote
INFOCOM
2003
IEEE
15 years 7 months ago
2003
IEEE
— Service composition enables flexible creation of new services by assembling independent service components. We are focused on the scenario where such composition takes place a...
130
Voted
PKC
2005
Springer
15 years 7 months ago
2005
Springer
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...