U.S. flag   An unofficial archive of your favorite United States government website
Dot gov

Official websites do not use .rip
We are an unofficial archive, replace .rip by .gov in the URL to access the official website. Access our document index here.

Https

Secure websites use HTTPS
A lock (Dot gov) or https:// means you've safely connected to our website. Please do not share sensitive information with us.

This is an archive
(replace .gov by .rip)

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