Conference Proceedings

Searching for Best Karatsuba Recurrences

Published: June 24, 2019

Author(s)

Çağdaş Çalık (NIST), Morris Dworkin (NIST), Nathan Dykas (University of Maryland), Rene Peralta (NIST)

Conference

Name: International Symposium on Experimental Algorithms
Dates: June 24-29, 2019
Location: Kalamata, Greece
Citation: Analysis of Experimental Algorithms: SEA 2019, Lecture Notes in Computer Science vol. 11544, pp. 332-342

Abstract

Keywords

circuit complexity; Karatsuba recurrences; polynomial multiplication
Control Families

None selected

Documentation

Publication:
Conference Proceedings (DOI)

Supplemental Material:
Preprint (pdf)

Document History:
06/24/19: Conference Proceedings (Final)

Topics

Security and Privacy
cryptography

Technologies
circuits; complexity