Arithmetic circuits for discrete logarithms

0Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We introduce a new model of "generic discrete log algorithms" based on arithmetic circuits. It is conceptually simpler than previous ones, is actually applicable to the natural representations of the popular groups, and we can derive upper and lower bounds that differ only by a constant factor, namely 10. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Joachim Von Zur, G. (2004). Arithmetic circuits for discrete logarithms. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2976, 557–566. https://doi.org/10.1007/978-3-540-24698-5_58

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