Sciweavers

814 search results - page 9 / 163
» Analysis of Modular Arithmetic
Sort
View
FFA
2010
70views more  FFA 2010»
14 years 7 months ago
Fast arithmetic in unramified p-adic fields
Let p be prime and Zpn a degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast deterministic algorithms for common o...
Hendrik Hubrechts
TVLSI
2010
14 years 4 months ago
Computation Error Analysis in Digital Signal Processing Systems With Overscaled Supply Voltage
It has been recently demonstrated that digital signal processing systems may possibly leverage unconventional voltage overscaling (VOS) to reduce energy consumption while maintaini...
Yang Liu, Tong Zhang, Keshab K. Parhi
CHES
2003
Springer
119views Cryptology» more  CHES 2003»
15 years 3 months ago
Faster Double-Size Modular Multiplication from Euclidean Multipliers
Abstract. A novel technique for computing a 2n-bit modular multiplication using n-bit arithmetic was introduced at CHES 2002 by Fischer and Seifert. Their technique makes use of an...
Benoît Chevallier-Mames, Marc Joye, Pascal P...
GLVLSI
2007
IEEE
166views VLSI» more  GLVLSI 2007»
15 years 1 months ago
Efficient pipelining for modular multiplication architectures in prime fields
This paper presents a pipelined architecture of a modular Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline implementation o...
Nele Mentens, Kazuo Sakiyama, Bart Preneel, Ingrid...
FSE
1997
Springer
81views Cryptology» more  FSE 1997»
15 years 2 months ago
XMX: A Firmware-Oriented Block Cipher Based on Modular Multiplications
Abstract. This paper presents xmx, a new symmetric block cipher optimized for public-key libraries and microcontrollers with arithmetic coprocessors. xmx has no S-boxes and uses on...
David M'Raïhi, David Naccache, Jacques Stern,...