Title: Public Key Cryptography with a Group of Unknown Order
Abstract: We present algorithms for digital signature generation and verification using public key cryptography over an arbitrary group G. The algorithms are similar to those of ElGamal, but do not require a knowledge of the group order. Forging signatures or determining the secret key requires the solution of a discrete logarithm problem over G, or the solution of other problems which appear at least as difficult. The algorithms can be modified to work over arbitrary semigroups.
Publication Year: 2000
Publication Date: 2000-06-01
Language: en
Type: article
Access and Citation
Cited By Count: 3
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot