Detailed Information
Cited 0 time in 
Cited 7 time in 
Cited 7 time in
Metadata Downloads
Improvement of probabilistic public key cryptosystems using discrete logarithm
- Issue Date
- 2002
- Citation
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.2288, pp.72 - 80
- Journal Title
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- Volume
- 2288
- Start Page
- 72
- End Page
- 80
- Abstract
- We investigate two different probabilistic public key cryptosystems, one proposed by Okamoto and Uchiyama and the other by Paillier. Both of them are based on the discrete logarithmic function and the messages are calculated from the modular product of two those functions, one of which has a fixed value depending on a given public key. The improvements are achieved by a good choice for the public key so that it is possible to get efficient algorithms. © Springer-Verlag Berlin Heidelberg 2002.
- Files in This Item
- There are no files associated with this item.
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.