Search

The design and development of secure nonlinear cryptographic Boolean function plays an unavoidable measure for modern information confidentiality schemes. This ensure the importance and applicability of nonlinear cryptographic Boolean functions. The current communication is about to suggest an innovative and energy efficient lightweight nonlinear multivalued cryptographic Boolean function of modern block ciphers. The proposed nonlinear confusion element is used in image encryption of secret images and information hiding techniques. We have suggested a robust LSB steganography structure for the secret hiding in the cover image. The suggested approach provides an effective and efficient storage security mechanism for digital image protection. The technique is evaluated against various cryptographic analyses which authenticated our proposed mechanism. [ABSTRACT FROM AUTHOR]

The concept of encryption is as old as the reality that confidential information has been interchanging among people. The art of transferring secret information between two parties or groups is known as cryptography. It contains the algorithms, key exchange protocols, and approaches to consistently and securely avoid unauthorized access to confidential information. Nowadays information is in digital form, therefore this factor necessitates some cryptographic algorithms for secure data transmission. In this work, we have designed a new approach for audio encryption to securely store and transfer audio signals. The suggested encryption algorithm is primarily based on Gensio-Tesi chaotic map. Substitution and permutation networks are engendered by the Gensio-Tesi chaotic system for the encryption of signals. The other important feature discussed here is the performance of offered algorithm which is ascertained by some extensive audio analysis. Experimental results reveal that the designed scheme has an essential level of security. [ABSTRACT FROM AUTHOR]

A new encryption scheme is developed by employing congruential generators and Arneodos chaotic dynamical system. In the offered work we have applied a chaotic map for shuffling and a quadratic congruential generator for substitution. The objective of this work is to offer a robust image encryption technique that satisfies the security criteria. Moreover, the cryptanalysis of this scheme is difficult because we have performed a combination of chaotic shuffling and substitution boxes. [ABSTRACT FROM AUTHOR]

In today's digital world, the most inevitable challenge is the protection of digital information. Due to the weak confidentiality preserving techniques, the existing world is facing several digital information breaches. To make our digital data indecipherable to the unauthorized person, a technique for finding a cryptographically strong Substitution box (S-box) have presented. An S-box with sound cryptographic assets such as nonlinearity (NL), strict avalanche criterion (SAC), bit independence criteria (BIC), bit independence criteria of nonlinearity (BICNL), Bit independence criteria of Strict avalanche criteria (BIC-SAC), and Input/output XOR is considered as the robust S-box. The Decision-Making Trial and Evaluation Laboratory (DEMATEL) approach of multi-criteria decision making (MCDM) is proposed for finding the interrelation among cryptographic properties. A combination of two MCDM methods namely Entropy and multiobjective optimization based on ratio analysis (MOORA) is applied for the best S-box selection. A robust substitution box is selected for secure communications in cryptography by using the combination of DEMETAL selection criteria, entropy weight assigning, and MOORA ranking scheme. The combination of these three methods provides a fast selection procedure for the secure confusion component. The offered selection method can also be utilized for the choice of the best cryptosystem with highly secure properties and resistive against all possible linear and differential attacks in the cryptanalysis. [ABSTRACT FROM AUTHOR]

Recently, an encryption technique depending on discrete dynamical chaotic maps and Brownian motion was offered. The authors of the understudy cryptosystem claim the security of encryption structure by some statistical analysis. We report cryptanalysis of a recently proposed scheme by using some cryptographic attacks. The attacks performed in this work are chosen-plaintext attack, known-plaintext attack, and chosen-ciphertext attack. The offered procedure is cryptanalyzed by taking just one chosen-plain image, one chosen-cipher image, and only one pair of plaintext and ciphertext, which shows the scheme's vulnerability. Moreover, we have offered an improved cryptosystem depending on the Basin chaotic map, Gingerbread man map, and Brownian motion, providing a robust security level. [ABSTRACT FROM AUTHOR]

The strength of any block cipher depends on the key size, total number of rounds and the strength of confusion component against differential cryptanalysis. Data encryption standard (DES) as a block cipher has enjoyed a worldwide acceptance for more than three decades. It is a symmetric block cipher and considered to be very strong against all known attacks at that time. It uses 64-bit key size and block size, but the advancement in technology results in increasing the speed of the computers and thus makes DES not secure any more. The shorter key size is the weak area of DES. In this article, we have increased the block size as well as the key size from 64 to 128 bits. The internal structure of our proposed mechanism ultimately changed all other components of DES accordingly. By this improvement, our anticipated scheme is more secure due to its robust due to its confusion and diffusion components. The algorithm is applied on the plain text and on images. We have performed the standard benchmarks statistical analyses on our suggested encryption scheme in order to authenticate the anticipated mechanism. [ABSTRACT FROM AUTHOR]

The present article introduced a novel idea for information hiding namely steganography. We have used new notions for the construction of the nonlinear component for block cipher based on inverse LA-semigroups. This nonlinear component fundamentally provides confidentiality in the proposed steganographic algorithm. The construction of the algorithm is fundamentally twofold. Firstly, we have constructed a novel scheme to design confusion component namely substitution box (S-box). Secondly, we have utilized the anticipated nonlinear component in digital steganography. The suggested algorithm is tested for different standard digital images. The authentication of the proposed algorithm is confirmed through statistical analysis. [ABSTRACT FROM AUTHOR]

Recently many substitution box based encryption algorithms ensuring privacy have been proposed. Many, chaotic map based S-boxes have been generated posing high nonlinearity and strong cryptographic properties. Encryption schemes depending on the substitution box (S-box) only are weak and easily breakable with the help of chosen plaintext and ciphertext attacks. In this work, we have completely cryptanalyzed S-box based encryption scheme successfully by two types of attacks. Cryptanalysis in both types of attacks is performed by only one selected image. Moreover, we have suggested some improvements in the algorithm to defeat attacks. • Recently many substitution box-based encryption algorithms ensuring privacy have been proposed. • Many, chaotic map-based substitution boxes (S-boxes) have been generated posing high nonlinearity and strong cryptographic properties. • Encryption schemes depending on the substitution box (S-box) only are weak and easily breakable with the help of chosen plaintext and ciphertext attacks. • In this work, we have completely cryptanalyzed S-box based encryption scheme successfully by two types of attacks. • Cryptanalysis in both types of attacks is performed by only one selected image. [ABSTRACT FROM AUTHOR]

Due to exponential technological advancement, secure transmission of multimedia content is a serious challenge. These days, securing and hiding digital information most efficiently is the focus of the digital computer world. Information confidentiality and information hiding namely steganography, are the most promising techniques that can protect digital information. In this paper, a combination of encryption and steganography is used efficiently to have a double level of security to achieve confidentiality, privacy, secrecy in addition to integrity and authentication. Firstly, encryption parameters are set by using a chaotic Lorenz system (CLS), then by using CLS encryption parameter encryption is performed on the secret image. This enciphered confidential digital medium is inserted in the cover image by using the least significant bits (LSBs) steganographic scheme. Due to the double level of security, it is hard for an eavesdropper to attack the proposed scheme. All experimental and simulation results verify the efficiency of the proposed information hiding scheme. [ABSTRACT FROM AUTHOR]

Confusion is one of the most important component of modern block ciphers. The security of modern encryption scheme is based on substitution and permutation network (SP-network). The idea of SP-network was proposed by Claude Shannon in 1949. Construction of optimal confusion component (substitution box) has been a prominent topic of interest. In this article, we have proposed a new technique for the construction of S-boxes which fulfill the required cryptographic properties. Our proposed scheme utilized double affine transformation which gives nonlinearity of 112 for each primitive irreducible polynomials of degree 8. The simulation results of our proposed nonlinear component are compared with some recently suggested substitution boxes (S-boxes) which demonstrate that the proposed scheme is more capable to construct strong nonlinear component of block encryption systems. [ABSTRACT FROM AUTHOR]

Substitution boxes with resilient cryptographic possessions are normally utilized in block ciphers to give the substantial property of nonlinearity. They are important to resist standard attacks such as linear and differential cryptanalysis. A cryptographically robust S-box must be sound with respect to cryptographic properties like nonlinearity, bit independent criteria, strict avalanche criteria, linear and differential approximation probability. In this paper, we have developed an innovative construction scheme of nonlinear component of block cipher based on the action of projective linear groups on the projective line, and the permutation triangle groups. This nonlinear component, namely S-box, is responsible for making the relation between plaintext and ciphertext intractable which is one of the most important requirements of any modern block ciphers. By widening the scope of the proposed S-boxes, we have applied these lightweight nonlinear components in watermarking scheme. [ABSTRACT FROM AUTHOR]

Quantum information processing made a tremendous and remarkable impact on number of classical mechanic’s problems. The impact does not only stop at classical mechanics but also the cyber security paradigm. Quantum information and cryptography are two classes of quantum information processing which use the idea of qubits instead of bits as in classical information security. The idea of fast computations with multiple complexity level is becoming more realistic in the age of quantum information due to quantum parallelism where a single quantum computer does allow to compute hundreds of classical computers with less efforts and more accuracy. The evolution of quantum information processing replaces a number of classical mechanic’s aspects in computational and cyber security sciences. Our aim here is to introduce concepts of applied quantum dynamics in cryptography, which leads to an evolution of quantum cryptography. Quantum cryptography is one of the most astonishing solicitations of quantum information theory. To measure the quantum state of any system is not possible without disturbing that system. The facts of quantum mechanics on traditional cryptosystems lead to a new protocol and achieving maximum remarkable security for systems. The scope of this paper is to design an innovative encryption scheme for digital data based on quantum spinning and rotation operators. [ABSTRACT FROM AUTHOR]

Due to dynamic network topology, distributed architecture and absence of a centralized authority, Mobile Ad hoc Networks (MANETs) are vulnerable to various attacks from misbehaving nodes. To enhance the security of MANETs, various trust-based schemes have been proposed that augment the traditional cryptography-based security schemes. However, most of these schemes use static and predefined trust thresholds for node misbehavior detection, without taking into consideration the network conditions locally at each node. Using static trust thresholds for misbehavior detection may result in high false positives, low malicious node detection rate, and network partitioning. In this paper, we propose a novel Adaptive Trust Threshold (ATT) strategy that adapts the trust threshold in the routing protocol according to the network conditions such as rate of link changes, node degree and connectivity, and average neighborhood trustworthiness. We identify the topology factors that affect the trust threshold at each node, and leverage them to build a mathematical model for ATT computation. We compare our ATT strategy with one of the most recently proposed trust-based security schemes. Our simulation results indicate that the ATT strategy is robust in terms of convergence to the same trust threshold value computed at all neighbor nodes for malicious nodes and is energy efficient. Moreover, the ATT strategy achieves significant improvements in packet delivery ratio, reduction in false positives, and increase in detection rate as compared to non-ATT schemes (static trust threshold based schemes). [ABSTRACT FROM AUTHOR]

In numerous encryption frameworks, the first information is changed into encoded form by applying nonlinear substitutions and affecting diffusion. The goal of the nonlinear change is to accomplish high level of randomness in the image content. The choice of the source of randomness is critical because the success in cryptanalysis is demarked by the characteristics identified in the encrypted data. The chaotic frameworks show random conduct that is suitable for encryption applications where nonlinear transformations are needed in the middle of plaintext and the scrambled information. The application of nonlinear functional chaos-based system with embedded chaotic systems and binary chaotic sequences can prompt randomness and diffusion in the information. In addition to the high state of randomness, the requirement for various round keys is needed in a run of the mill substitution-permutation process. The proposed strategy kills the requirement for different round keys, which is suitable for high-speed communication frameworks. The measurable analyses performed on the proposed nonlinear algorithm which show improvement in encryption quality and safety against numerous brute-force and statistical attacks. Also, the proposed framework demonstrates high safety against differential and linear cryptanalysis. [ABSTRACT FROM AUTHOR]

Wireless multimedia communications have progressed significantly in recent years. As a result, there is an increasing demand for more secure media transmission to protect multimedia information. Image encryption systems have been presented throughout the years, but those based on chaotic maps are the most secure and trustworthy due to the inherent properties in such types of multimedia contents involving the pixels strong correlation and data handling capacities. In this research, we have performed differential cryptanalysis of a recently suggested cryptosystem based on a three dimensional (3D) logistic map and 3D Cat map. The originally proposed approach was based on diffusion and confusion strategy. The vulnerabilities in the understudy cryptosystem lead to the successful proposed cryptanalysis attack. The original ciphers are recovered by means of a chosen-plaintext attack. The recovered data is also subjected to some statistical analysis to check the quality. [ABSTRACT FROM AUTHOR]

This research presents the survey, analysis, comparisons and implementation of the most threatening new kind of cryptographic attacks known as fault attacks or implementation attacks against Advanced Encryption Standard (AES) algorithm. AES algorithm is used in various applications and is considered the most secure against conventional cryptanalytic attacks which exploits the algebraic or mathematical weaknesses in the crypto-systems. Fault attacks are based on interrupting the execution of the algorithm in such a way that it produces faulty cipher output which can be analysed to break the algorithm. This research survey various fault attacks and provide implementation of three of them in detail for demonstration purposes. It mapped the complex mathematical analysis into programming algorithms for ease of implementation. At the end it compares various types of attacks based on our devised criteria of efficiency, flexibility and usability of the attack methods. [ABSTRACT FROM AUTHOR]

ABSTRACT Wireless sensor networks (WSNs) are emerging as useful technology for information extraction from the surrounding environment by using numerous small-sized sensor nodes that are mostly deployed in sensitive, unattended, and (sometimes) hostile territories. Traditional cryptographic approaches are widely used to provide security in WSN. However, because of unattended and insecure deployment, a sensor node may be physically captured by an adversary who may acquire the underlying secret keys, or a subset thereof, to access the critical data and/or other nodes present in the network. Moreover, a node may not properly operate because of insufficient resources or problems in the network link. In recent years, the basic ideas of trust and reputation have been applied to WSNs to monitor the changing behaviors of nodes in a network. Several trust and reputation monitoring (TRM) systems have been proposed, to integrate the concepts of trust in networks as an additional security measure, and various surveys are conducted on the aforementioned system. However, the existing surveys lack a comprehensive discussion on trust application specific to the WSNs. This survey attempts to provide a thorough understanding of trust and reputation as well as their applications in the context of WSNs. The survey discusses the components required to build a TRM and the trust computation phases explained with a study of various security attacks. The study investigates the recent advances in TRMs and includes a concise comparison of various TRMs. Finally, a discussion on open issues and challenges in the implementation of trust-based systems is also presented. Copyright © 2012 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Transmission of digital contents over public channel with access restricted to intended beneficiary even the contents are intercepted by others. In technological ages, cryptography plays a vital role in broadcasting, network communication, cell phones, etc. for transmitting sensitive information. The era of quantum information processing has many applications in daily life and one of its implications in data security. The data security and quantum information are two different modules of information processing that uses the notion of qubit model instead of classical information theory. It uses quantum mechanics instead of classical mechanics for information processing (covert communication). Elements of quantum theory have energy and angular momentum called spin, which carries the polarization. The purpose of writing this article is to introduce the concept spinning from quantum dynamics in data security, which leads to the development of quantum cryptography. The scope of this article is to protect contents' privacy by polarized spin matrices passed by finite-state machine at secret phase information. [ABSTRACT FROM AUTHOR]