Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Habitat monitoring with sensor networks
Communications of the ACM - Wireless sensor networks
Security in wireless sensor networks
Communications of the ACM - Wireless sensor networks
TinyPK: securing sensor networks with public key technology
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
TinySec: a link layer security architecture for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Sizzle: A Standards-Based End-to-End Security Architecture for the Embedded Internet (Best Paper)
PERCOM '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications
The relevance of quantum cryptography in modern networking systems
Neural, Parallel & Scientific Computations
| Hi-index | 0.00 |
In this paper, we propose a new asymmetric cryptographic algorithm (HOOD CRYPT) based on the Elliptical Curve Cryptographic approach. The algorithm describes how an orthogonal frequency division multiplexing (OFDM) based RF wireless system can be encrypted using planner matrix Elliptical Curve Cryptography (ECC). The newly described asymmetric algorithm can be applied to the OFDM transmission scheme in the design of more robust and secure cryptography in portable wireless devices. An analysis of the proposed algorithm is made using the discrete logarithm approach. Two methods, namely, Pollard's rho Attack and Index Calculus are investigated with respect to the new algorithm. We found that our method makes it even more difficult to break the ECC encryption.