74
Views
0
CrossRef citations to date
0
Altmetric
Articles

Hardware Efficient Crypto-Coder Systems for Wireless Channels

ORCID Icon &

REFERENCES

  • R. J. McEliece , “A public-key cryptosystem based on algebraic coding theory,” DSN Prog. Rep. , Vol. 42, no. 44, pp. 114–6, Apr. 1978.
  • H. Niederreiter , “Knapsack-type cryptosystems and algebraic coding theory,” Prob. Control Inform. Theory , Vol. 15, no. 2, pp. 159–66, 1986.
  • P. T. Berger , “Reducing key length of the McEliece cryptosystem,” in Progress in Cryptology AFRICACRYPT Springer, Berlin-Heidelberg , Jun. 21–25, 2009, pp. 77–97
  • S. C. Kak , “Joint encryption and error correction coding,” in Proceedings of the IEEE Conference on Security and Privacy , Oakland, CA, Apr. 1983, pp. 55–60.
  • D. Gligoroski , S. J. Knapskog , and S. Andova , “Cryptcoding encryption and error-correction coding in a single step,” in Proceedings of Security and Management Conference , Jun. 2006, pp. 145–51.
  • K. K. Chakravarthy and M. B. Srinivas , “Speech encoding and encryption in VLSI,” in Proceedings of the 2003 Conference on Asia South Pacific Design Automation , Jan. 2003, pp. 569–70.
  • O. Adamo , S. Fu , and M. Varanasi , “Hardware-efficient encryption encoder and decoder unit,” in Military Communications Conference, MILCOM 2008, San Diego, CA, Nov. 16–19, 2008, pp. 1–6.
  • D. Abbasi-Moghadam , V. Taba Vakili , and A. Falahati , “Combination of turbo coding and cryptography in NONGEO satellite communication systems,” in International Symposium on Telecommunications, Aug. 27–28, 2008.
  • M. Esmaeili and T. A. Gulliver , “Joint channel coding-cryptography based on random insertions and deletions in quasi-cyclic-low-density parity check codes,” IET Commun ., Vol. 9, no. 12, pp. 1555–60, Jun. 2015.
  • V. Sawant and A. Bhise , “Cryptographic turbo code for image transmission over mobile networks,” in International Conference on Advances in Computing, Communications and Informatics (ICACCI), Jaipur, India, Sep. 21–24, 2016, pp. 844--850.
  • J. Viterbi , “Convolutional codes and their performance in communication systems,” IEEE Trans. Commun. Technol. , Vol. 19, no. 5, pp. 751–72, Oct. 1971.
  • J. Hagenauer , “Forward error correcting for CDMA systems,” in Proceedings of the International Symposium on Spread Spectrum Techniques and Applications , Mainz , Sep. 1996, pp. 566–9.
  • J. Dielissen , N. Engin , S. Sawitzki , and K. Van Berkel , “Multistandard FEC decoders for wireless devices,” IEEE Trans. Circuits Syst. II, Exp. Briefs, Vol. 55, no. 3, pp. 284–8, Mar. 2008.
  • J. Rabaey , Low Power Design Essentials , 1st ed. Berlin, Germany : Springer-Verlag, 2009.
  • M. Igor , “Power consumption analysis of XOR based circuits,” Informatics , Vol. 1, no. 9, pp. 97–103, 2006.
  • R. Pasko , P. Schaumont , V. Derudder , S. Vernalde , and D. Durackova , “A new algorithm for elimination of common subexpressions,” IEEE Trans. Comput. Des. Integr. Circuits Syst., Vol. 18, no. 1, pp. 58–68, Jan. 1999.
  • C. Huang , J. Li , and M. Chen , “Optimizing XOR-based codes,” U.S. Patent 8209577 B2, Jun. 26, 2012.
  • G. Purohit , K. S. Raju , and V. K. Chaubey , “A new XOR-free approach for implementation of convolutional encoder,” IEEE Embed. Syst. Lett. , Vol. 8, no. 1, pp. 22–25. Mar. 2016.
  • D. A. McGrew and J. Viega , “The Galois/counter mode of operation (GCM),” Updated submission to NIST, Modes of Operation Process, May 2005.
  • W. Stallings , Cryptography and Network Security Principles and Practice , 5th ed., Upper Saddle River, NY: Pearson Publications, 2011, pp. 148–72.
  • T. K. Devi and S. Palaniappan , “An asynchronous low power and high performance VLSI architecture for Viterbi decoder implemented with Quasi Delay Insensitive Templates,” Hindawi Publ. Corp Sci. World J. , Vol. 2015, 621012, Nov. 2015.
  • G. Davis Forney Jr. , “The Viterbi algorithm,” Proc. IEEE , Vol. 61, pp. 268–78, Mar. 1973.
  • M. Irfan , S. M. Shah , and A. K. Khan , “Design and implementation of Viterbi encoding and decoding algorithm on FPGA,” in The 17th International Conference on Microelectronics, ICM 2005, University of Tehran, Tehran, Dec. 2005, pp. 234–9.
  • A. Gutub , “Remodeling of elliptic curve cryptography scalar multiplication architecture using parallel Jacobian coordinate system,” Int. J. Comp. Sci. Secur. , Vol. 4, no. 4, pp. 409–25, Oct. 2010.
  • A. Bogdanov , F. Mendel , F. Regazzoni , V. Rijmen , and E. Tischhauser , “ALE: AES-based lightweight authenticated encryption,” in 20th International Workshop on Fast Software Encryption FSE, Mar. 2013, pp. 447–66.
  • P. Karpman and B. Grégoire , “The LITTLUN S-box and the FLY block cipher,” in Lightweight Cryptography Workshop, Apr. 2016, pp. 17–8.
  • Xilinx Datasheet , “Synthesis and simulation design guide,” UG626 (v 11.4), Dec. 2, 2009.
  • Xilinx Datasheet , “Timing constraints user guide,” UG612 (v 11.1.1), Apr. 29, 2009.
  • Digilent Datasheet , “Basys 2 FPGA board reference manual,” Revised Apr. 8, 2016.
  • A. Gutub , “Efficient utilization of scalable multipliers in parallel to compute GF (p) elliptic curve cryptographic operations,” Kuwait J. Sci. Eng. , Vol. 34, no. 2, pp. 165–82, Dec. 2007.
  • N. AlAssaf , B. AlKazemi , and A. Gutub , “Applicable Light-Weight Cryptography to secure medical data in IoT systems,” J. Res. Eng. Appl. Sci. , Vol. 2, no. 2, pp. 50–8, Apr. 2017.
  • A. Gutub , A.-R. El-Shafe , and M. Aabed , “Implementation of a pipelined modular multiplier architecture for GF (p) elliptic curve cryptography computation,” Kuwait J. Sci. Eng. , Vol. 38, no. 2B, pp. 125–53, Dec. 2011.
  • A. Gutub and A. Tenca , “Efficient scalable VLSI architecture for montgomery inversion in GF (p),” Integr. VLSI J. , Vol. 37, no. 2, pp. 103–20, May 2004.
  • A. Gutub , “Merging GF (p) elliptic curve point adding and doubling on pipelined VLSI cryptographic ASIC architecture,” Int. J. Comp. Sci. Netw. Secur. , Vol. 6, no. 3A, pp. 44–52, Mar. 2006.
  • A. Gutub and F. Khan , “Hybrid crypto hardware utilizing symmetric-key & public-key cryptosystems,” in International Conference on Advanced Computer Science Applications and Technologies – ACSAT2012, Kuala Lumpur, Malaysia , Nov. 26–28, 2012.
  • A. Gutub , “Fast 160-Bits GF (p) elliptic curve crypto hardware of high-radix scalable multipliers,” Int. J. Inform. Technol. , Vol. 3, no. 4, pp. 342–349, Oct. 2006.
  • A. Gutub , “Preference of efficient architectures for GF (p) elliptic curve crypto operations using multiple parallel multipliers,” Int. J. Secur , Vol. 4, no. 4, pp. 46–63, Oct. 2010.
  • A. Gutub and E. Khan , “Using subthreshold SRAM to design low-power crypto hardware,” Int. J. New Comput. Archit. Appl , Vol. 1, no. 2, pp. 474–83, 2011.
  • A. Gutub , A.-A. Tabakh , A. Al-Qahtani , and A. Amin , “Serial vs. parallel elliptic curve crypto processor designs,” in IADIS International Conference: Applied Computing 2013, Fort Worth, TX , Oct. 23–25, 2013, pp. 67–74.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.