67 search results - page 2 / 14 » rsa 2010 |
CARDIS
2010
Springer
13 years 11 months ago
2010
Springer
![The Polynomial Composition Problem in (Z/nZ)[X]](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "The Polynomial Composition Problem in (Z/nZ)[X]")
Let n be an RSA modulus and let P, Q ∈ (Z/nZ)[X]. This paper explores the following problem: Given polynomials Q and Q(P), find polynomial P. We shed light on the connections be...
IWSEC
2010
Springer
13 years 3 months ago
2010
Springer
In the perspective of RSA, given small encryption exponent e (e.g., e = 216 + 1), the top half of the decryption exponent d can be narrowed down within a small search space. This f...
ICICS
2010
Springer
13 years 2 months ago
2010
Springer
In this work we examine a number of different open source implementations of the RSA Optimal Asymmetric Encryption Padding (OAEP) and generally RSA with respect to the message-aime...
RSA
2010
13 years 3 months ago
2010
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
RSA
2010
13 years 3 months ago
2010
We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size n satisfy a central limit theorem with mean and variance proport...