Sciweavers

388 search results - page 3 / 78
» Bipartite Modular Multiplication
Sort
View
CHES
2003
Springer
119views Cryptology» more  CHES 2003»
13 years 10 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...
IOLTS
2007
IEEE
110views Hardware» more  IOLTS 2007»
13 years 11 months ago
An Elliptic Curve Cryptosystem Design Based on FPGA Pipeline Folding
In this paper we present an efficient design technique for implementing the Elliptic Curve Cryptographic (ECC) Scheme in FPGAs. Our technique is based on a novel and efficient i...
Osama Al-Khaleel, Christos A. Papachristou, Franci...
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 5 months ago
Multiple resolution of the modular structure of complex networks
Modular structure is ubiquitous in real-world complex networks. The detection of this type of organization into modules gives insights in the relationship between topological stru...
Alex Arenas, Alberto Fernández, Sergio G&oa...
DARS
2000
Springer
128views Robotics» more  DARS 2000»
13 years 9 months ago
Motion Planning for a Modular Self-Reconfiguring Robotic System
In this paper, we address the issue of motion planning for a bipartite class of modular self-reconfiguring robotic system (I-Cubes) that is a collection of active elements providin...
Cem Ünsal, Han Kiliççöte, ...
SIPS
2007
IEEE
13 years 11 months ago
Montgomery Modular Multiplication Algorithm on Multi-Core Systems
In this paper, we investigate the efficient software implementations of the Montgomery modular multiplication algorithm on a multi-core system. A HW/SW co-design technique is use...
Junfeng Fan, Kazuo Sakiyama, Ingrid Verbauwhede