1145 search results - page 59 / 229 » Discrete Green's Functions |
146
click to vote
WCC
2005
Springer
15 years 11 months ago
2005
Springer
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
178
click to vote
MOC
1998
15 years 5 months ago
1998
By splitting a given singular function into a relatively smooth part and a specially structured singular part, it is shown how the traditional Fourier method can be modified to gi...
159
click to vote
ANTS
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we investigate the efficiency of the function field sieve to compute discrete logarithms in the finite fields F3n . Motivated by attacks on identity based encrypti...
140
click to vote
CIE
2006
Springer
15 years 8 months ago
2006
Springer
In Bishop-style constructive algebra it is known that if a module over a commutative ring has a Noetherian basis function, then it is Noetherian. Using countable choice we prove th...
141
click to vote
TIT
1998
15 years 5 months ago
1998
—Given n discrete random variables = fX1;111; Xng, associated with any subset of f1; 2; 111; ng, there is a joint entropy H(X ) where X = fXi:i 2 g. This can be viewed as a f...