The Parallel Complexity of Exponentiating Polynomials over Finite Fields

Abstract

Modular integer exponentiation (given <italic>a, e,</italic> and <italic>m</italic>, compute <italic>a</italic><supscrpt>e</supscrpt> mod <italic>m</italic>) is a fundamental problem in algebraic complexity for which no efficient parallel algorithm is known. Two closely related problems are modular polynomial exponentiation (given <italic>a</italic>(<italic… (More)
DOI: 10.1145/22145.22150

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Statistics

051015201520162017
Citations per Year

Citation Velocity: 5

Averaging 5 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.