An elliptical cryptographic algorithm for rf wireless devices

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.

[1]  E. Dawson,et al.  Implementing an efficient elliptic curve cryptosystem over $GF(p)$ on a smart card , 2003 .

[2]  David A. Wagner,et al.  TinySec: a link layer security architecture for wireless sensor networks , 2004, SenSys '04.

[3]  Vipul Gupta,et al.  Speeding up Secure Web Transactions Using Elliptic Curve Cryptography , 2004, NDSS.

[4]  Vipul Gupta,et al.  Sizzle: a standards-based end-to-end security architecture for the embedded Internet , 2005, Third IEEE International Conference on Pervasive Computing and Communications.

[5]  Taher El Gamal A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.

[6]  Gary L. Mullen,et al.  Finite Fields: Theory, Applications and Algorithms , 1994 .

[7]  Carl Eklund,et al.  National Institute for Standards and Technology , 2009, Encyclopedia of Biometrics.

[8]  John A. Stankovic,et al.  Security in wireless sensor networks , 2004, SASN '04.

[9]  Mukesh Singhal,et al.  Security in wireless sensor networks , 2008, Wirel. Commun. Mob. Comput..

[10]  Peter Kruus,et al.  TinyPK: securing sensor networks with public key technology , 2004, SASN '04.

[11]  T. Elgamal A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[12]  尚弘 島影 National Institute of Standards and Technologyにおける超伝導研究及び生活 , 2001 .

[13]  Christof Paar,et al.  Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms , 1998, CRYPTO.

[14]  Deborah Estrin,et al.  Habitat monitoring with sensor networks , 2004, CACM.