45 search results - page 2 / 9 » rsa 2000 |
RSA
2000
13 years 4 months ago
2000
A succinct series expression is derived for describing the limit distribution of the number of times r consecutive elements are all records (in a sequence of independent and ident...
PKC
2005
Springer
13 years 10 months ago
2005
Springer
In typical RSA, it is impossible to create a key pair (e, d) such that both are simultaneously much shorter than φ(N). This is because if d is selected first, then e will be of t...
RSA
2000
13 years 4 months ago
2000
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual probabilistic construction. It turns out that the...
ICICS
2001
Springer
13 years 9 months ago
2001
Springer
Undeniable signature has been extensively researched after Chaum and Antwerpen first proposed the concept of this special digital signature ten years ago. Up to now, however, almo...
ACISP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. At ACISP 2000, Yoo et al proposed a fast public key cryptosystem using matrices over a ring. The authors claim that the security of their system is based on the RSA probl...