15 search results - page 3 / 3 » On the Efficiency of Pollard's Rho Method for Discrete Logar... |
CRYPTO
1991
Springer
13 years 9 months ago
1991
Springer
Our purpose is to describe elliptic curves with complex multiplication which in characteristic 2 have the following useful properties for constructing Diffie-HeUman type cryptosys...
KDD
2006
ACM
14 years 5 months ago
2006
ACM
We study the mining of interesting patterns in the presence of numerical attributes. Instead of the usual discretization methods, we propose the use of rank based measures to scor...
AMC
2005
13 years 5 months ago
2005
Three main methods with favorable security and efficiency can be considered in the design of cryptosystems. These methods are integer factorization systems (of which RSA is the be...
MOC
2010
13 years 4 days ago
2010
We define the weight of an integer N to be the smallest w such that N can be represented as w i=1 i2ci , with 1,..., w{1,-1}. Since arithmetic modulo a prime of low weight is parti...
SIAMMAX
2010
13 years 3 days ago
2010
Abstract. Linear inverse problems with uncertain measurement matrices appear in many different applications. One of the standard techniques for solving such problems is the total l...