Conference Proceedings

Cryptographic protocols based on discrete logarithms in real-quadratic orders

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 839 LNCS 56-60
DOI: 10.1007/3-540-48658-5_7
7Citations
Citations of this article
37Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We generalize and improve the schemes of [4]. We introduce analogues of exponentiation and discrete logarithms in the principle cycle of real quadratic orders. This enables us to implement many cryptographic protocols based on discrete logarithms, e.g. a variant of the signature scheme of ElGamal [8].

Cite

CITATION STYLE

APA

Biehl, I., Buchmann, J., & Thiel, C. (1994). Cryptographic protocols based on discrete logarithms in real-quadratic orders. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 839 LNCS, pp. 56–60). Springer Verlag. https://doi.org/10.1007/3-540-48658-5_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free