Sciweavers

13 search results - page 3 / 3
» On the Bounded Sum-of-Digits Discrete Logarithm Problem in F...
Sort
View
CRYPTO
1998
Springer
105views Cryptology» more  CRYPTO 1998»
13 years 10 months ago
An Efficient Discrete Log Pseudo Random Generator
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
Sarvar Patel, Ganapathy S. Sundaram
MOC
2010
13 years 16 days 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
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 5 months ago
Distributed Source Coding using Abelian Group Codes
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the...
Dinesh Krithivasan, S. Sandeep Pradhan