Autor: |
Magliveras, S. S., Stinson, D. R., van Trung, Tran |
Předmět: |
|
Zdroj: |
Journal of Cryptology; 2002, Vol. 15 Issue 4, p285, 13p |
Abstrakt: |
A symmetric key cryptosystem based on logarithmic signatures for finite permutation groups was described by the first author in [6], and its algebraic properties were studied in [7]. In this paper we describe two possible approaches to the construction of new public key cryptosystems with message space a large finite group G, using logarithmic signatures and their generalizations. The first approach relies on the fact that permutations of the message space G induced by transversal logarithmic signatures almost always generate the full symmetric group S[subG] on the message space. The second approach could potentially lead to new E1Gamal-like systems based on trapdoor, one-way functions induced by logarithmic signature-like objects we call meshes, which are uniform covers for G. [ABSTRACT FROM AUTHOR] |
Databáze: |
Complementary Index |
Externí odkaz: |
|