Efficient permutation instructions for fast software cryptography

Lee, R.B.; Shi, Zhijie; Yang, Xiao

doi:10.1109/40.977759

Cited by 102 publications

(82 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…It allows us to achieve one of our major contributions: performing arbitrary bit permutations in 1 or 2 cycles -a significant improvement over our recent past work achieving O(log(n)) instructions and cycles [5], which we describe further below.…”

Section: Past Workmentioning

confidence: 99%

“…A comparison of CROSS, OMFLIP, GRP, and PPERM is presented in [5]. CROSS, OMFLIP and GRP all achieve arbitrary 64-bit permutations in 6 instructions.…”

Section: Past Workmentioning

confidence: 99%

“…Conventional logical and shift instructions take O(n) cycles to achieve any one of n! permutations [5]. Alternatively, table lookup methods can be used, but this is limited to a few fixed permutations due to the high memory space requirement, and cache misses cause performance degradation.…”

Section: Past Workmentioning

confidence: 99%

“…The intermediate result produced by one permutation instruction is used as the data for the next. Hence, a sequence of log(n) instructions are needed to supply the nlog(n) configuration bits and the data to be permuted, to achieve any n-bit permutation [5]. If all nlog(n) configuration bits and the n data bits to be permuted can be specified by a single instruction, then it may be possible to execute any arbitrary n-bit permutation in 1 instruction.…”

Section: Achieving Arbitrary 64-bit Permutations In 1 or 2 Cyclesmentioning

confidence: 99%

“…The reason log(n) instructions are needed to achieve any permutation of n bits is because nlog(n) configuration bits are needed to specify an arbitrary n-bit permutation [5] [11]. Since a typical instruction reads up to 2 source operands and produces 1 result, a permutation instruction uses one source operand for the data and the other for n bits of configuration.…”

Section: Achieving Arbitrary 64-bit Permutations In 1 or 2 Cyclesmentioning

confidence: 99%

See 4 more Smart Citations

Validating Word-Oriented Processors for Bit and Multi-word Operations

Lee

Yang

Shi

2004

Advances in Computer Systems Architecture

View full text Add to dashboard Cite

Abstract. We examine secure computing paradigms to identify any new architectural challenges for future general-purpose processors. Some essential security functions can be provided by different classes of cryptography algorithms. We identify two categories of operations in these algorithms that are not common in previous general-purpose workloads: bit operations within a word and multi-word operations. Both challenge the basic word orientation of processors. We show how very complex bit-level operations, namely arbitrary bit permutations within a word, can be achieved in O(1) cycles, rather than O(n) cycles as in existing RISC processors. We describe two solutions: one using only microarchitecture changes, and another with Instruction Set Architecture (ISA) support. We generalize our solutions to define datarich execution with MOMR (Multi-word Operands Multi-word Result) functional units. This can address both challenges, leveraging available resources in typical processors with minimal additional cost. Thus we validate the basic word-orientation of processor architectures, since they can also provide superior performance for both bit and multi-word operations needed by cryptographic processing.

show abstract

Section: Past Workmentioning

confidence: 99%

“…A comparison of CROSS, OMFLIP, GRP, and PPERM is presented in [5]. CROSS, OMFLIP and GRP all achieve arbitrary 64-bit permutations in 6 instructions.…”

Section: Past Workmentioning

confidence: 99%

Section: Past Workmentioning

confidence: 99%

Section: Achieving Arbitrary 64-bit Permutations In 1 or 2 Cyclesmentioning

confidence: 99%

Section: Achieving Arbitrary 64-bit Permutations In 1 or 2 Cyclesmentioning

confidence: 99%

See 3 more Smart Citations

Validating Word-Oriented Processors for Bit and Multi-word Operations

Lee

Yang

Shi

2004

Advances in Computer Systems Architecture

View full text Add to dashboard Cite

show abstract

A lightweight efficient chaos‐based cryptosystem for constrained‐node networks

Senouci

Sadoudi

Djamaa

et al. 2019

Int J Communication

View full text Add to dashboard Cite

Interconnected sensor and actuator objects creating Constrained-Node Networks (CNN) are among the most prominent technologies of the Internet of things. Deployed to monitor our lives, surroundings, and critical infrastructure, CNN communications must be strongly secured in order to prevent devastating unauthorized access to critical information. This, however, faces severe challenges imposed by CNN constraints in terms of energy, memory, and computational power. To address such conflicting requirements, this paper presents a chaos-based efficient lightweight secure communication system for CNNs. The proposed cryptosystem performs optimized confusion-diffusion operations at the byte level allowing it to be fully implemented on an 8-bit microcontroller.Obtained results from extensive experiments at both statistical and implementation levels confirm the robustness of the proposed cryptosystem against a multitude of attacks. Additionally, the evaluated encryption/decryption speeds along with the low memory and energy consumption grant the proposed cryptosystem attractive lightweight aspects enabling its deployment in very constrained CNN applications having soft real-time requirements. KEYWORDS Chaos theory, constrained-node networks, data confidentiality, internet of thingsInt J Commun Syst. 2020;33:e4215. wileyonlinelibrary.com/journal/dacTABLE 3 Secret keys used for key sensitivity analysis Key Secret keyKey 1 x 0 = −10.000; y 0 = −5.000; z 0 = −10; = 10; = 0.01; = 3; = 28 Key 2 x 0 = −10.001; y 0 = −5.000; z 0 = −10; = 10; = 0.01; = 3; = 28 Key 3 x 0 = −10.000; y 0 = −5.001; z 0 = −10; = 10; = 0.01; = 3; = 28 values of Pvalue T knowing that if Pvalue T ≥ 0.0001, then the sequences can be considered to be uniformly distributed. As can be seen from this table, the minimum pass rate for each statistical test, except that of the random excursion (variant) test, is approximately 0.972766 for a sample size equal to 300 binary sequences. Consequently, we conclude that the encryption keys generated by DLZ pass all of the NIST tests. Therefore, we can confirm that the used encryption keys have good statistical performances, i.e., good randomness keys.How to cite this article: Senouci MR, Sadoudi S, Djamaa B, Senouci MA. A lightweight efficient chaos-based cryptosystem for constrained-node networks. Int J Commun Syst. 2020;33:e4215. https://doi.

show abstract

A novel image steganography scheme based on morphological associative memory and permutation schema

Nazari

Moghadam

Moin

2014

Security Comm Networks

View full text Add to dashboard Cite

Steganography is the art and science of hiding a message in a carrier, in such a manner that no one, except the sender and intended recipient, can guess the existence of the message; it is a form of security through obscurity. Often, steganography algorithms using discrete cosine transform are detectable through steganalysis attacks. To reduce detectability of the stego, we propose an image steganography algorithm in transform domain based on morphological associative memory, permutation approach, and matrix encoding. In our proposed algorithm, in order to insert a secret message in the cover image, first, we map the cover image to a morphological representation containing morphological coefficients, and then bits of secret message are inserted into the image by permutation approach and matrix encoding. Permutation approach leads to unique distribution of secret message in the carrier, and the use of matrix encoding minimizes the number of coefficients needed to be changed because of inserting secret message. In our experiments, we compared the quality of stego, time complexity, and robustness of our method with state‐of‐art image steganography algorithms (F5 and morphological steganography) with an equal payload. The experimental results showed that the proposed method is able to produce insignificant visual distortion compared with other traditional approaches. To test the robustness of our proposed algorithm, we used wavelet‐based and block‐based steganalysis methods. The obtained results showed a high level of robustness of our algorithm against steganalysis attacks. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

Efficient permutation instructions for fast software cryptography

Cited by 102 publications

References 10 publications

Validating Word-Oriented Processors for Bit and Multi-word Operations

Validating Word-Oriented Processors for Bit and Multi-word Operations

A lightweight efficient chaos‐based cryptosystem for constrained‐node networks

A novel image steganography scheme based on morphological associative memory and permutation schema

Contact Info

Product

Resources

About