Sciweavers

722 search results - page 6 / 145
» Efficient Generation of Prime Numbers
Sort
View
MOC
2010
13 years 2 months ago
The number field sieve for integers of low weight
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...
Oliver Schirokauer
AAECC
2004
Springer
76views Algorithms» more  AAECC 2004»
13 years 7 months ago
On the Security of RSA with Primes Sharing Least-Significant Bits
Abstract. We investigate the security of a variant of the RSA public-key cryptosystem called LSBS-RSA, in which the modulus primes share a large number of least-significant bits.We...
Ron Steinfeld, Yuliang Zheng
BTW
2007
Springer
142views Database» more  BTW 2007»
14 years 1 months ago
Getting Prime Cuts from Skylines over Partially Ordered Domains
: Skyline queries have recently received a lot of attention due to their intuitive query formulation: users can state preferences with respect to several attributes. Unlike numeric...
Wolf-Tilo Balke, Wolf Siberski, Ulrich Güntze...
MOC
1998
102views more  MOC 1998»
13 years 7 months ago
Classification of integral lattices with large class number
A detailed exposition of Kneser’s neighbour method for quadratic lattices over totally real number fields, and of the sub-procedures needed for its implementation, is given. Usi...
Rudolf Scharlau, Boris Hemkemeier