Sciweavers

Share
8 search results - page 1 / 2
» Fast Truncated Multiplication for Cryptographic Applications
Sort
View
CHES
2005
Springer
83views Cryptology» more  CHES 2005»
10 years 8 months ago
Fast Truncated Multiplication for Cryptographic Applications
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
Laszlo Hars
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
10 years 8 months ago
The truncated fourier transform and applications
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
Joris van der Hoeven
SACRYPT
2001
Springer
106views Cryptology» more  SACRYPT 2001»
10 years 7 months ago
Fast Normal Basis Multiplication Using General Purpose Processors
—For cryptographic applications, normal bases have received considerable attention, especially for hardware implementation. In this article, we consider fast software algorithms ...
Arash Reyhani-Masoleh, M. Anwarul Hasan
ARITH
2005
IEEE
10 years 8 months ago
Fast Modular Reduction for Large Wordlengths via One Linear and One Cyclic Convolution
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
Dhananjay S. Phatak, Tom Goff
SACRYPT
2004
Springer
113views Cryptology» more  SACRYPT 2004»
10 years 8 months ago
A Note on the Signed Sliding Window Integer Recoding and a Left-to-Right Analogue
Addition-subtraction-chains obtained from signed digit recodings of integers are a common tool for computing multiples of random elements of a group where the computation of invers...
Roberto Maria Avanzi
books