Search

In this work, we have used the standard symmetric key block cipher data encryption algorithm RC5(32,16,8) for the encryption of digital greyscale images. For this, we have only considered the nonzero elements of the sparse matrix of the images which have been generated using the sparse representation technique. The security strength of the proposed technique is verified through different quality parameters, e.g. information entropy, correlation coefficients, NPCR, UACI, and NIST test. Our proposed algorithm achieved the maximum information entropy value of 7.9977 for the cameraman image and nearly zero correlation coefficient values establish the robustness of the cryptosystem. The highest NPCR and UACI values obtained in our work are 99.6916 and 33.9605, which are closer to the maximum theoretical values. The proposed technique is also compared with some of the contemporary works to validate the credibility of our proposed algorithm. [ABSTRACT FROM AUTHOR]

The out-of-band management system defined by IPMI only supports IIC bus for inter-node communication, which has low communication rate and poor flexibility for multi-node layout, and it is not suitable for cluster management applications with large data volume of multiple nodes. This article adopts Ethernet instead of IIC to realize the structure layout of multi-node distributed cluster management system. The operation and maintenance information are trans-mitted by RMCP+, but the original RMCP + is rate limited and less stable in the transmission of large data volume in multi-cluster management system due to the use of AES-CBC encryption algorithm. This article optimizes the RMCP + communication process logic to reduce the redundancy in the system cascade data about transmission encryption and decryption calculation, and proposes the method of using parallel CTR for data block encryption instead of serial CBC data block encryption, which realizes the loose coupling of database decryption in data packets, in-creases the decryption rate of data cipher text at remote clients, educes the error transmission caused by tight coupling of data blocks, and improves the communication efficiency. The experimental environment of QEMU-based multi-node management system is built to verify that the communication method proposed in this article is suitable for the operation and maintenance management of distributed multi-node complex ATCA. [ABSTRACT FROM AUTHOR]

Encrypted control systems were introduced to enhance the security of cyber-physical systems, which outsource control action computations to a third-party platform. To protect the confidentiality of the transmitted data, homomorphic encryption schemes are particularly appealing for their capability of allowing computations on encrypted data. By considering the popular ElGamal and Paillier encryption schemes, this paper shows that encrypted control systems are vulnerable to attackers leveraging the inherently small domains of the plaintext data in control systems and the randomisation process required to make the utilised ciphers semantically secure. Finally, we present some countermeasures to defend against these attacks. [ABSTRACT FROM AUTHOR]

This paper proposes a new modification to the AES in order to ensure a high-level security. This is accomplished by replacing the binary Exclusive OR (XOR) operation in each add-round-key stage of the AES with a new (#) operation. The (#) operation requires an additional and randomly generated control key to determine the state table (among 256 optional state tables) needed to apply the (#) operation. The 256 states tables are formed based on the addition operation in the Galois Field GF (28) to increase the randomness of the algorithm. The modified AES algorithm has been evaluated based on several security metrics. In our proposed algorithm, an attacker needs, at minimum, up to (2431)10 probabilities of keys to decrypt an encrypted message; thus, the proposed AES algorithm increases the complexity of the original AES against the differential cryptanalysis. Moreover, compared to the original AES, applying the (#) operation in our modified algorithm also improves the performance in other security metrics, such as NIST and histogram. Consequently, this replacement by using two keys in both the encryption and decryption process adds a new level of "protection and a greater degree of robustness against breaking methods. [ABSTRACT FROM AUTHOR]

T-310 is an important Cold War cipher (Schmeh 2006). It was the principal encryption algorithm used to protect various state communication lines in Eastern Germany throughout the 1980s. The cipher seems to be quite robust, and until now no researcher has proposed an attack on T-310. This article studies decryption oracle and slide attacks on T-310. [ABSTRACT FROM AUTHOR]

This article presents an overview of the concepts of and motivation for the OCB block cipher mode of operation. OCB is well suited for IoT, wireless, and other constrained devices where processing time and energy consumption are design issues. The article describes two versions of the OCB algorithm (OCB1 and OCB3) that have been widely accepted. [ABSTRACT FROM AUTHOR]

Embedded systems are routinely deployed in critical infrastructures nowadays, therefore their security is increasingly important. This, combined with the pressing requirement of deploying massive numbers of low-cost and low-energy embedded devices, stimulates the evolution of lightweight cryptography and other green-computing security mechanisms. New crypto-primitives are being proposed that offer moderate security and produce compact implementations. In this article, we present a lightweight authenticated encryption scheme based on the integrated hardware implementation of the lightweight block cipher PRESENT and the lightweight hash function SPONGENT. The presented combination of a cipher and a hash function is appropriate for implementing authenticated encryption schemes that are commonly utilized in one-way and mutual authentication protocols. We exploit their inner structure to discover hardware elements usable by both primitives, thus reducing the circuit’s size. The integrated versions demonstrate a 27% reduction in hardware area compared to the simple combination of the two primitives. The resulting solution is ported on a field-programmable gate array (FPGA) and a complete security application with input/output from a universal asynchronous receiver/transmitter (UART) gate is created. In comparison with similar implementations in hardware and software, the proposed scheme represents a better overall status. [ABSTRACT FROM AUTHOR]

Several modes of operation have been built upon block cipher security. Among them, CFB is considered to be one of the popular modes of operation because of its self-synchronizing property. Besides, appearance of OCFB makes CFB even more competitive. However, because of the stalling problem (i.e., there is a need to stall while doing block encryption) and the inability to arrange the keystream in advance, both the CFB and OCFB modes are considered to be inadequate for such real-time applications, where the appearance of inputs is expected to be uniform. In this article, researchers present a new mode of operation based on the underlying foundation of both the CFB and OCFB modes of operation, called real-time based optimized cipher feedback mode (RT-OCFB), which remedies this problem. They also argue that the proposed mode of operation (RT- OCFB) holds the similar imperative security properties as CFB and OCFB, which are indeed essential for modern cryptography. [ABSTRACT FROM PUBLISHER]

In this article the author revisits the oldest attack on GOST known, the Kara Reflection attack, and another totally unrelated truncated differential attack by Courtois and Misztal. It is hard to imagine that there could be any relationship between two so remote attacks which have nothing in common. However, there is one: Very surprisingly, both properties can be combined and lead the fastest attack on GOST ever found, which is nearly feasible to execute in practice. [ABSTRACT FROM PUBLISHER]

GOST is a well-known Russian encryption standard. Until 2010, no researcher found a single-key attack on GOST. In 2010, GOST was submitted to ISO 18033 to become a worldwide industrial encryption standard. Since 2011, many attacks on GOST faster than brute force have been found [3, 4, 5, 10, 12]. By default, GOST has 256-bit keys. However, in many applications 128-bit keys are required. The authors should note that GOST is an exceptionally economical cipher in implementation: Even as a 128-bit cipher, GOST requires about four times less gates to implement than AES-128 (see [16]). There are two very natural 128-bit variants of GOST: Either the same 128-bit key is repeated, or it is repeated with inversion of the 32-bit words. Both variants are natural simplified variants fully compliant with the standard which have already been considered as potentially interesting targets for advanced slide attacks [2]. In this article, the authors show that both these variants are insecure. All of their attacks are nearly practical. [ABSTRACT FROM PUBLISHER]