Sciweavers

128 search results - page 3 / 26
» Fast Integer Multiplication using Modular Arithmetic
Sort
View
GLVLSI
2007
IEEE
166views VLSI» more  GLVLSI 2007»
13 years 9 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...
EUROCRYPT
2010
Springer
13 years 10 months ago
Fully Homomorphic Encryption over the Integers
We describe a very simple “somewhat homomorphic” encryption scheme using only elementary modular arithmetic, and use Gentry’s techniques to convert it into a fully homomorph...
Marten van Dijk, Craig Gentry, Shai Halevi, Vinod ...
MOC
2011
13 years 21 days ago
Fast evaluation of modular functions using Newton iterations and the AGM
We present an asymptotically fast algorithm for the numerical evaluation of modular functions such as the elliptic modular function j. Our algorithm makes use of the natural connec...
Régis Dupont
FSE
1997
Springer
81views Cryptology» more  FSE 1997»
13 years 10 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,...
ACSAC
2000
IEEE
13 years 10 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