FPGA based communication security for wireless sensor networks

  • Authors:
  • Junaid Majeed

  • Affiliations:
  • FEST Hamdard University

  • Venue:
  • ESPOCO'05 Proceedings of the 4th WSEAS International Conference on Electronic, Signal Processing and Control
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Networks of wireless microsensors for monitoring physical environments have emerged as an important new application area for wireless technology. Key attributes of these new types of networked systems are the severely constrained computational and energy resources and an ad hoc operational environment. Information security is increasingly becoming very important. Encryption and Decryption are very likely to be in many systems that exchange information to secure, verify, or authenticate data. Many systems, like the internet, cellular phones, handheld devices, and E-commerce, involve private and important information exchange and they need cryptography to make it secure. This paper is a study of the communication security aspects of these networks. Resource limitations and specific architecture of sensor networks call for customized security mechanisms. There are three possible solutions to accomplish the cryptographic computation: Software, hardware using application-specific integrated circuits (ASICs), and Hardware using field-programmable gate arrays (FPGAs). The software solution is the cheapest and most flexible one. But, it is the slowest. The ASICs solution is the fastest. But, it is inflexible, very expensive, and needs long development time. The FPGAs solution is flexible, fast, and needs shorter development time. Elliptic curve cryptography (ECC) needs modular multiplication. Montgomery multiplication algorithm is a very smart and efficient algorithm for calculating the modular multiplication. It replaces the division by a shift and modulus-addition (if needed) operation, which are much faster. The algorithm is also very suitable for a hardware implementation. Many designs have been proposed for fixed precision operands. This scalable Montgomery multiplier can be configured to meet the design area-time tradeoff. Also, it can work for any operand precision up to maximum design memory capability.