A Study on the Throughput Enhancement in Software Implementation of Ultra Light-Weight Cryptography PRESENT 


Vol. 42,  No. 2, pp. 316-322, Feb.  2017


PDF
  Abstract

This paper suggests an efficient software implementation of lightweight encryption algorithm PRESENT which supports for secret key lengths of 80-bits. Each round of PRESENT is composed of the round key addition, substitution, and permutation and is repeated 31 times. Bo Zhu suggested combined substitution and permutation for efficient operation so that encryption throughput has been increased 2.6 times than processing substitution and permutation at separate times. The scheme that suggested in this paper improved the scheme of Bo Zhu to reduce the number of operation for the round key addition, substitution, and permutation. The scheme that suggested in this paper has increased encryption throughput up to 1.6 times than the scheme of Bo Zhu but memory usage has been increased.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

W. Park, G. P. Cebrian, S. Kim, K. Lee, D. Lim, K. Yu, "A Study on the Throughput Enhancement in Software Implementation of Ultra Light-Weight Cryptography PRESENT," The Journal of Korean Institute of Communications and Information Sciences, vol. 42, no. 2, pp. 316-322, 2017. DOI: .

[ACM Style]

Won-kyu Park, G. P. Cebrian, Sung-joon Kim, Kang-hyun Lee, Dae-woon Lim, and Ki-soon Yu. 2017. A Study on the Throughput Enhancement in Software Implementation of Ultra Light-Weight Cryptography PRESENT. The Journal of Korean Institute of Communications and Information Sciences, 42, 2, (2017), 316-322. DOI: .

[KICS Style]

Won-kyu Park, G. P. Cebrian, Sung-joon Kim, Kang-hyun Lee, Dae-woon Lim, Ki-soon Yu, "A Study on the Throughput Enhancement in Software Implementation of Ultra Light-Weight Cryptography PRESENT," The Journal of Korean Institute of Communications and Information Sciences, vol. 42, no. 2, pp. 316-322, 2. 2017.