<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2018-09-09 03:28:07Mathematics Algebra Abstract algebra Post-quantum cryptography Multiplication Lattice-based cryptography Cryptography Karatsuba algorithm NTRU Lattice Polynomial ring Field extension |
Add to Reading List |
Fast Ideal Lattice-Based KEMs on ARM Cortex-M4 Matthias J. Kannwischer, Joost Rijneveld, Peter Schwabe September 03, 2018 | Computer Networks–716 www.elsevier.com/locate/comnet Remote timing attacks are practical David Brumley aDocID: 1r5d7 - View Document |
 | Space- and Time-Efficient Polynomial MultiplicationDocID: 1r1wg - View Document |
 | Code generation for polynomial multiplication ´ Ling Ding1 and Eric Schost2 1DocID: 1qp1c - View Document |
 | RelaxMiddle-JSCStyle-sent.pdfDocID: 1oo1n - View Document |
 | Algorithms and Data Structures Winter TermExercises for Unit 6 s 1. Spell out the general divide-and-conquer algorithm for multiplying polymomials that wasDocID: 1onxf - View Document |