This paper presents a pipelined architecture of a modu- lar Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline imple- mentation of the Montgomery algorithm, a more compact pipelined... more
This paper presents a pipelined architecture of a modu- lar Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline imple- mentation of the Montgomery algorithm, a more compact pipelined version is derived. The design makes use of 16- bit integer multiplication blocks that are available on re- cently manufactured FPGAs. The critical path
Research Interests:
This paper presents a reconfigurable hardware architecture for Public-key cryptosystems. By changing the connections of coarse grain Carry-Save Adders (CSAs), the datapath provides a high perfor- mance for both RSA and Elliptic Curve... more
This paper presents a reconfigurable hardware architecture for Public-key cryptosystems. By changing the connections of coarse grain Carry-Save Adders (CSAs), the datapath provides a high perfor- mance for both RSA and Elliptic Curve Cryptography (ECC). In addi- tion, we introduce another reconfigurability for the flip-flops in order to make the best of hardware resources. The results of FPGA implemen- tation
Research Interests: Electronics, Cryptography, FPGA implementation, Reconfigurable Hardware, Field Programmable Gate Array, and 16 morePublic key cryptography, Implementation, High performance, Perforation, Elliptic Curve Cryptography, Coarse Grained Soil, Adder, Electrical And Electronic Engineering, Flip Flop, Prototype, Arithmetic Logic Unit, Logic Circuit, Carry Save Adder, Public Key Cryptosystem, Modular exponentiation, and Complementary Metal-Oxide Semiconductor
This work describes the smallest known hard- ware implementation for Elliptic/Hyperelliptic Curve Cryptog- raphy (ECC/HECC). We propose two solutions for Public- key Cryptography (PKC), which are based on arithmetic on... more
This work describes the smallest known hard- ware implementation for Elliptic/Hyperelliptic Curve Cryptog- raphy (ECC/HECC). We propose two solutions for Public- key Cryptography (PKC), which are based on arithmetic on elliptic/hyperelliptic curves. One solution relies on ECC over binary fields F2n where n is a composite number of the form 2p (p is a prime) and another on HECC on
Research Interests:
Selecting a strong cryptographic algorithm makes no sense if the information leaks out of the device through side- channels. Sensitive information, such as secret keys, can be obtained by observing the power consumption, the elec-... more
Selecting a strong cryptographic algorithm makes no sense if the information leaks out of the device through side- channels. Sensitive information, such as secret keys, can be obtained by observing the power consumption, the elec- tromagnetic radiation, etc. This class of attacks are called side-channel attacks. Another type of attacks, namely fault attacks, reveal secret information by inserting faults into
Research Interests:
The aim of this chapter is to give a thorough overview of secure remote reconfiguration technologies for wireless embedded systems, and of the communication standard commonly used in those systems. In particular, we focus on basic... more
The aim of this chapter is to give a thorough overview of secure remote reconfiguration technologies for wireless embedded systems, and of the communication standard commonly used in those systems. In particular, we focus on basic security mechanisms both at hardware and ...