Item

Applying Polynomial Multiplication Algorithms to Cryptography

Elia, Marcus
Citations
Altmetric:
License
License
DOI
Abstract
Recent research has shown that creatively using the Toom-Cook algorithm can result in multiplying large polynomials quickly for NTRUencrypt. We formally describe the conditions in which the Toom-Cook algorithm can be used to multiply polynomials whose coefficients are elements of the ring of integers modulo a power of two. We apply these results to improve the speed of multiplication for different parameter sets for NTRUencrypt.
Description
11:00 AM
11:00am-1:00pm
Graduate
Date
2019-01-01
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
UVM Student Research Conference
Show all metadata
Research Projects
Organizational Units
Journal Issue
Citation
URI
https://hdl.handle.net/20.500.14849/7285
DOI
Embedded videos