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...
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...
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...
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...
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...