Advanced Bit Manipulation Instruction Set Architecture

Microprocessor instruction set architectures currently offer support for operations on full processor words and, more recently, on subwords of 8, 16, 32 or 64 bits. However, there is little support for bit-oriented operations beyond the bitwise logical operators and shift operators. Some ISAs, such as PA-RISC and Itanium, offer more advanced instructions such as extract and deposit that combine mask and shift operations in one instruction.

[1]  Y. Hilewitz,et al.  Comparing fast implementations of bit permutation instructions , 2004, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004..

[2]  Weblog Wikipedia,et al.  In Wikipedia the Free Encyclopedia , 2005 .

[3]  Ruby B. Lee,et al.  Instruction set architecture for accelerating cryptographic processing in wireless computing devices , 2005 .

[4]  Ruby B. Lee,et al.  Implementation complexity of bit permutation instructions , 2003, The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003.

[5]  Ruby B. Lee,et al.  Subword sorting with versatile permutation instructions , 2002, Proceedings. IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[6]  Ruby B. Lee,et al.  Fast parallel table lookups to accelerate symmetric-key cryptography , 2005, International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II.

[7]  Ruby B. Lee,et al.  Single-Cycle Bit Permutations with MOMR Execution , 2005, Journal of Computer Science and Technology.

[8]  J. van Leeuwen,et al.  Information Hiding , 1999, Lecture Notes in Computer Science.

[9]  Ruby B. Lee,et al.  Fast Bit Compression and Expansion with Parallel Extract and Parallel Deposit Instructions , 2006, IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06).

[10]  Ruby B. Lee,et al.  Fast subword permutation instructions using omega and flip network stages , 2000, Proceedings 2000 International Conference on Computer Design.

[11]  Ruby B. Lee,et al.  Efficient permutation instructions for fast software cryptography , 2001 .

[12]  Ruby B. Lee,et al.  Arbitrary bit permutations in one or two cycles , 2003, Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003.

[13]  Ruby B. Lee,et al.  On-chip lookup tables for fast symmetric-key encryption , 2005, 2005 IEEE International Conference on Application-Specific Systems, Architecture Processors (ASAP'05).

[14]  Ruby B. Lee,et al.  Bit permutation instructions: architecture, implementation, and cryptographic properties , 2004 .

[15]  Ronald L. Rivest,et al.  On permutation operations in cipher design , 2004, International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004..

[16]  Ingo Stierand,et al.  Computer Based Steganography: How It Works and Why Therefore Any Restrictions on Cryptography Are Nonsense, at Best , 1996, Information Hiding.

[17]  Ruby B. Lee.  Subword parallelism with MAX-2 , 1996, IEEE Micro.

[18]  Ruby B. Lee.  Subword permutation instructions for two-dimensional multimedia processing in MicroSIMD architectures , 2000, Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors.

[19]  Ruby B. Lee,et al.  Performing Advanced Bit Manipulations Efficiently in General-Purpose Processors , 2007, 18th IEEE Symposium on Computer Arithmetic (ARITH '07).

[20]  Xiao Yang,et al.  How a processor can permute n bits in O(1) cycles , 2002 .

[21]  Simon Josefsson,et al.  The Base16, Base32, and Base64 Data Encodings , 2003, RFC.

[22]  Ruby B. Lee,et al.  Bit permutation instructions for accelerating software cryptography , 2000, Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors.