j-lanes tree hashing is a tree mode that splits an input message into?j?slices, computes?j?independent digests of each slice, and outputs the hash value of their concatenation.?j-pointers tree hashing is a similar tre...j-lanes tree hashing is a tree mode that splits an input message into?j?slices, computes?j?independent digests of each slice, and outputs the hash value of their concatenation.?j-pointers tree hashing is a similar tree mode that receives, as input,?j?pointers to?j?messages (or slices of a single message), computes their digests and outputs the hash value of their concatenation. Such modes expose parallelization opportunities in a hashing process that is otherwise serial by nature. As a result, they have a performance advantage on modern processor architectures. This paper provides precise specifications for these hashing modes, proposes appropriate IVs, and demonstrates their performance on the latest processors. Our hope is that it would be useful for standardization of these modes.展开更多
j-lanes hashing is a tree mode that splits an input message to j slices, computes j independent digests of each slice, and outputs the hash value of their concatenation. We demonstrate the performance advantage of j-l...j-lanes hashing is a tree mode that splits an input message to j slices, computes j independent digests of each slice, and outputs the hash value of their concatenation. We demonstrate the performance advantage of j-lanes hashing on SIMD architectures, by coding a 4-lanes-SHA-256 implementation and measuring its performance on the latest 3rd Generation IntelR CoreTM. For messages whose lengths range from 2 KB to 132 KB, we show that the 4-lanes SHA-256 is between 1.5 to 1.97 times faster than the fastest publicly available implementation that we are aware of, and between ~2 to ~2.5 times faster than the OpenSSL 1.0.1c implementation. For long messages, there is no significant performance difference between different choices of j. We show that the 4-lanes SHA-256 is faster than the two SHA3 finalists (BLAKE and Keccak) that have a published tree mode implementation. Finally, we explain why j-lanes hashing will be faster on the coming AVX2 architecture that facilitates using 256 bits registers. These results suggest that standardizing a tree mode for hash functions (SHA-256 in particular) could be useful for performance hungry applications.展开更多
The Internet of Things (IoT) is an emerging network infrastructure with more than five devices owned by a single user. Wireless connectivity forms the backbone of such infrastructure. IoT uses diverse wireless communi...The Internet of Things (IoT) is an emerging network infrastructure with more than five devices owned by a single user. Wireless connectivity forms the backbone of such infrastructure. IoT uses diverse wireless communication technologies such as IEEE 802.15.4, Wi-Fi, Zigbee, Bluetooth, RFID, BLE (Bluetooth Low Energy), and various other cellular technologies. Wi-Fi is most suitable for IoT Home or office networks. Practically wireless signals do not adhere to the boundaries of the office or home, or organization and impose inherent security risks like information leakage, unauthorized access, other security and privacy threats to networking infrastructure. Therefore Authorization/Association of devices is one of the main security concerns. This paper discusses how unauthorized access to wireless networks (Wi-Fi) can be secured by improving existing WPA2 protocol security.展开更多
Nowadays,high-resolution images pose several challenges in the context of image encryption.The encryption of huge images’file sizes requires high computational resources.Traditional encryption techniques like,Data En...Nowadays,high-resolution images pose several challenges in the context of image encryption.The encryption of huge images’file sizes requires high computational resources.Traditional encryption techniques like,Data Encryption Standard(DES),and Advanced Encryption Standard(AES)are not only inefficient,but also less secure.Due to characteristics of chaos theory,such as periodicity,sensitivity to initial conditions and control parameters,and unpredictability.Hence,the characteristics of deoxyribonucleic acid(DNA),such as vast parallelism and large storage capacity,make it a promising field.This paper presents an efficient color image encryption method utilizing DNA encoding with two types of hyper-chaotic maps.The proposed encryption method comprises three steps.The first step initializes the conditions for generating Lorenz and Rossler hyper-chaotic maps using a plain image Secure Hash Algorithm(SHA-256/384).The second step performs a confusion procedure by scrambling the three components of the image(red,green,and blue)using Lorenz hyper-chaotic sequences.Finally,the third step combines three approaches to encrypt the scrambled components for diffusion:DNA encoding/decoding,addition operation between components,and XORing with Rossler hyper-chaotic sequences.The simulation results indicate that the suggested encryption algorithm satisfies the requirements of security.The entropy value of confusion and diffusion is 7.997,the key space is 2200,and the correlation coefficient is nearly zero.The efficacy of the proposed method has been verified through numerous evaluations,and the results show its resistance and effectiveness against several attacks,like statistical and brute-force attacks.Finally,the devised algorithm vanquishes other relevant color image encryption algorithms.展开更多
We describe a method for efficiently hashing multiple messages of different lengths. Such computations occur in various scenarios, and one of them is when an operating system checks the integrity of its components dur...We describe a method for efficiently hashing multiple messages of different lengths. Such computations occur in various scenarios, and one of them is when an operating system checks the integrity of its components during boot time. These tasks can gain performance by parallelizing the computations and using SIMD architectures. For such scenarios, we compare the performance of a new 4-buffers SHA-256 S-HASH implementation, to that of the standard serial hashing. Our results are measured on the 2nd Generation Intel? CoreTM Processor, and demonstrate SHA-256 processing at effectively ~5.2 Cycles per Byte, when hashing from any of the three cache levels, or from the system memory. This represents speedup by a factor of 3.42x compared to OpenSSL (1.0.1), and by 2.25x compared to the recent and faster n-SMS method. For hashing from a disk, we show an effective rate of ~6.73 Cycles/Byte, which is almost 3 times faster than OpenSSL (1.0.1) under the same conditions. These results indicate that for some usage models, SHA-256 is significantly faster than commonly perceived.展开更多
文摘j-lanes tree hashing is a tree mode that splits an input message into?j?slices, computes?j?independent digests of each slice, and outputs the hash value of their concatenation.?j-pointers tree hashing is a similar tree mode that receives, as input,?j?pointers to?j?messages (or slices of a single message), computes their digests and outputs the hash value of their concatenation. Such modes expose parallelization opportunities in a hashing process that is otherwise serial by nature. As a result, they have a performance advantage on modern processor architectures. This paper provides precise specifications for these hashing modes, proposes appropriate IVs, and demonstrates their performance on the latest processors. Our hope is that it would be useful for standardization of these modes.
文摘j-lanes hashing is a tree mode that splits an input message to j slices, computes j independent digests of each slice, and outputs the hash value of their concatenation. We demonstrate the performance advantage of j-lanes hashing on SIMD architectures, by coding a 4-lanes-SHA-256 implementation and measuring its performance on the latest 3rd Generation IntelR CoreTM. For messages whose lengths range from 2 KB to 132 KB, we show that the 4-lanes SHA-256 is between 1.5 to 1.97 times faster than the fastest publicly available implementation that we are aware of, and between ~2 to ~2.5 times faster than the OpenSSL 1.0.1c implementation. For long messages, there is no significant performance difference between different choices of j. We show that the 4-lanes SHA-256 is faster than the two SHA3 finalists (BLAKE and Keccak) that have a published tree mode implementation. Finally, we explain why j-lanes hashing will be faster on the coming AVX2 architecture that facilitates using 256 bits registers. These results suggest that standardizing a tree mode for hash functions (SHA-256 in particular) could be useful for performance hungry applications.
文摘The Internet of Things (IoT) is an emerging network infrastructure with more than five devices owned by a single user. Wireless connectivity forms the backbone of such infrastructure. IoT uses diverse wireless communication technologies such as IEEE 802.15.4, Wi-Fi, Zigbee, Bluetooth, RFID, BLE (Bluetooth Low Energy), and various other cellular technologies. Wi-Fi is most suitable for IoT Home or office networks. Practically wireless signals do not adhere to the boundaries of the office or home, or organization and impose inherent security risks like information leakage, unauthorized access, other security and privacy threats to networking infrastructure. Therefore Authorization/Association of devices is one of the main security concerns. This paper discusses how unauthorized access to wireless networks (Wi-Fi) can be secured by improving existing WPA2 protocol security.
基金This research is funded by Universiti SainsMalaysia(USM)via an external Grant Number(304/PNAV/650958/U154).
文摘Nowadays,high-resolution images pose several challenges in the context of image encryption.The encryption of huge images’file sizes requires high computational resources.Traditional encryption techniques like,Data Encryption Standard(DES),and Advanced Encryption Standard(AES)are not only inefficient,but also less secure.Due to characteristics of chaos theory,such as periodicity,sensitivity to initial conditions and control parameters,and unpredictability.Hence,the characteristics of deoxyribonucleic acid(DNA),such as vast parallelism and large storage capacity,make it a promising field.This paper presents an efficient color image encryption method utilizing DNA encoding with two types of hyper-chaotic maps.The proposed encryption method comprises three steps.The first step initializes the conditions for generating Lorenz and Rossler hyper-chaotic maps using a plain image Secure Hash Algorithm(SHA-256/384).The second step performs a confusion procedure by scrambling the three components of the image(red,green,and blue)using Lorenz hyper-chaotic sequences.Finally,the third step combines three approaches to encrypt the scrambled components for diffusion:DNA encoding/decoding,addition operation between components,and XORing with Rossler hyper-chaotic sequences.The simulation results indicate that the suggested encryption algorithm satisfies the requirements of security.The entropy value of confusion and diffusion is 7.997,the key space is 2200,and the correlation coefficient is nearly zero.The efficacy of the proposed method has been verified through numerous evaluations,and the results show its resistance and effectiveness against several attacks,like statistical and brute-force attacks.Finally,the devised algorithm vanquishes other relevant color image encryption algorithms.
文摘We describe a method for efficiently hashing multiple messages of different lengths. Such computations occur in various scenarios, and one of them is when an operating system checks the integrity of its components during boot time. These tasks can gain performance by parallelizing the computations and using SIMD architectures. For such scenarios, we compare the performance of a new 4-buffers SHA-256 S-HASH implementation, to that of the standard serial hashing. Our results are measured on the 2nd Generation Intel? CoreTM Processor, and demonstrate SHA-256 processing at effectively ~5.2 Cycles per Byte, when hashing from any of the three cache levels, or from the system memory. This represents speedup by a factor of 3.42x compared to OpenSSL (1.0.1), and by 2.25x compared to the recent and faster n-SMS method. For hashing from a disk, we show an effective rate of ~6.73 Cycles/Byte, which is almost 3 times faster than OpenSSL (1.0.1) under the same conditions. These results indicate that for some usage models, SHA-256 is significantly faster than commonly perceived.
