Skip to main content

Architecture Types of the Bit Permutation Instruction for General Purpose Processors

  • Conference paper
Information Fusion and Geographic Information Systems

Abstract

In large information systems different data transform algorithms including the bit permutation operations requiring an execution of great number of cycles are used. To increase significantly the software performance of such algorithm a controlled bit permutation instruction (BPI) is desirable. Here a question of justification of embedding a new command, controlled BPI, into the standard set of instructions of general-purpose processor for increasing the efficiency of different types algorithms implemented in software is studied. In a variety of applications two different types of bit permutation operations are required: arbitrary fixed permutations and variable permutations. The last are used in a new fast cipher designs based on data-dependent permutations. Accounting for an expediency of embedding the controlled permutation command into the set of elementary processor operations the cryptographic applications form only one of the motivation elements. Another strong motivation is BPI’s use for solving variety of non-cryptographic problems. The multipurpose architecture of the BPI operation oriented to the efficient execution of both the cryptographic functions based on data-driven permutations and the algorithms including arbitrary bit permutations is proposed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.B. Lee, Z.J. Shi, X. Yang, Efficient permutation instructions for Fast Software Cryptography. IEEE Micro. 2001, vol. 21, no 6, pp. 56–69.

    Article  Google Scholar 

  2. R.B. Lee, Z.J. Shi, R.L. Rivesr, M.J.B. Robshaw, On permutation operations in Cipher Design. Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC’04), Las Vegas, Nevada, April 5–7, 2004, vol. 2, p. 569–579.

    Article  Google Scholar 

  3. N.A. Moldovyan, A.A. Moldovyan. Innovative cryptography.-Charles River Media, Boston, Massachusetts, 2006.-386 pp.

    Google Scholar 

  4. N.A. Moldovyan, P.A. Moldovyanu, D.H. Summerville. On Software Implementation of Fast DDP-Based Ciphers. International Journal of Network Security. 2007. vol. 4, no. 1. P.81–89 (http://isrc.nchu.edu.tw/ijns/)

    Google Scholar 

  5. N.A. Moldovyan, A.A. Moldovyan, Sklavos N. Controlled Elements for Designing Ciphers Suitable to Efficient VLSI Implementation. // Telecommunication Systems. 2006. vol. 32, no 2/3. P. 149–163.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moldovyan, A.A., Moldovyan, N.A., Moldovyanu, P.A. (2007). Architecture Types of the Bit Permutation Instruction for General Purpose Processors. In: Popovich, V.V., Schrenk, M., Korolenko, K.V. (eds) Information Fusion and Geographic Information Systems. Lecture Notes in Geoinformation and Cartography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-37629-3_10

Download citation

Publish with us

Policies and ethics