Sciweavers

610 search results - page 4 / 122
» Fast Modular Reduction
Sort
View
CHES
2004
Springer
128views Cryptology» more  CHES 2004»
14 years 22 days ago
Long Modular Multiplication for Cryptographic Applications
Abstract. A digit-serial, multiplier-accumulator based cryptographic coprocessor architecture is proposed, similar to fix-point DSP's with enhancements, supporting long modula...
Laszlo Hars
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 7 months ago
Fast Integer Multiplication using Modular Arithmetic
We give an O(N
Anindya De, Piyush P. Kurur, Chandan Saha, Rampras...
ACSAC
2000
IEEE
13 years 11 months ago
The Chinese Remainder Theorem and its Application in a High-Speed RSA Crypto Chip
The performance of RSA hardware is primarily determined by an efficient implementation of the long integer modular arithmetic and the ability to utilize the Chinese Remainder The...
Johann Großschädl
ISCAS
2006
IEEE
102views Hardware» more  ISCAS 2006»
14 years 1 months ago
A fast dual-field modular arithmetic logic unit and its hardware implementation
— We propose a fast Modular Arithmetic Logic Unit (MALU) that is scalable in the digit size (d) and the field size (k). The datapath of MALU has chains of Carry Save Adders (CSA...
Kazuo Sakiyama, Bart Preneel, Ingrid Verbauwhede
FOCS
2008
IEEE
14 years 1 months ago
Fast Modular Composition in any Characteristic
We give an algorithm for modular composition of degree n univariate polynomials over a finite field Fq requiring n1+o(1) log1+o(1) q bit operations; this had earlier been achiev...
Kiran S. Kedlaya, Christopher Umans