Search

Although it was first developed and studied in the late 1970s and early 1977s, the Data Encryption Standard (DES) algorithm has grown in popularity. There are two causes for this occurrence. First, the DES algorithm's complex mathematical structure allows it to serve as the theoretical foundation for a wide variety of applications. Second, the encryption technique works quite well in practice for a variety of applications when implemented correctly. In this paper, we undertake a thorough and practical review of the theoretical aspects of this sort of encryption algorithm and demonstrate how they have been implemented by executing multiple encryption configurations. [ABSTRACT FROM AUTHOR]

The secure electronic signature provides contracting parties, particularly the consumer, with safety and reassurance which has a favorable impact on business transactions due to the strong legal authority supplied by this signature, which is based on a method for its formation. Therefore, researchers are rushing to design safe and performance electronic signature schemes at the same time. We offer a novel signature technique based on two hard number theory issues in this work, Quadratic Residue (QR) and Chaotic Maps (CM). Several fields of study including mathematics, physics, and computer science have taken an interest in chaotic systems as a potential tool for cryptography. Analysis demonstrates that our strategy is more secure and efficient than other connected schemes, compared to other schemes. A proof of the proposed scheme's security against known key attacks is also provided in this article. [ABSTRACT FROM AUTHOR]

Over the past few decades, many algorithms have been proposed to improve the performance of speech encryption over un-secure channel (i.e., Internet). In this paper, the security level was enhanced using a dynamic dual chaotic based on Hénon chaotic map. In the proposed algorithm, the speech elements are shuffled in a random fashion. Moreover, when both Hénon state variables are free to be used for shuffling the index is toggled randomly between them according to toggle bit. After index shuffling each speech element is modified with XOR operation between the original speech element value and the key that is selected randomly from the updated key table. The same chaotic map is used to initiate the empty or full table and provide new table entries from the values that are already shuffled. The experimental results show that the proposed crypto-system is simple, fast with extra random toggling behavior. The high order of substitution make it sensitive to initial condition, common cryptanalysis attacks such as linear and differential attacks are infeasible. [ABSTRACT FROM AUTHOR]

This paper introduces a dynamic speech encryption algorithm based on Lorenz chaotic map over internet protocol to enhance the services of the real-time applications such as increases the security level and reduces latency. The proposed algorithm was divided into two processes: dynamic key generation process using 128-bit hash value to dynamically alter the initial secret keys, and encryption and decryption process using Lorenz system. In the proposed algorithm, the performance evaluation is carried out through efficient simulations and implementations and statistical analysis. In addition, the average time delay in the proposed algorithm and some of the existing algorithms such as AES is compared. The obtained results concluded that, the proposed dynamic speech encryption algorithm is effectually secured against various cryptanalysis attacks and has useful cryptographic properties such as confusion and diffusion for better voice communication in the voice applications field in the Internet. [ABSTRACT FROM AUTHOR]

Public key cryptography has received great attention in the field of information exchange through insecure channels. In this paper, we combine the Dependent-RSA (DRSA) and chaotic maps (CM) to get a new secure cryptosystem, which depends on both integer factorization and chaotic maps discrete logarithm (CMDL). Using this new system, the scammer has to go through two levels of reverse engineering, concurrently, so as to perform the recovery of original text from the cipher-text has been received. Thus, this new system is supposed to be more sophisticated and more secure than other systems. We prove that our new cryptosystem does not increase the overhead in performing the encryption process or the decryption process considering that it requires minimum operations in both. We show that this new cryptosystem is more efficient in terms of performance compared with other encryption systems, which makes it more suitable for nodes with limited computational ability. [ABSTRACT FROM AUTHOR]

The profound characteristics of factoring problems and chaotic maps are utilized in this article to produce a new identity-based cryptographic scheme. These characteristics include random behavior and high performance (i.e., encryption and decryption) in terms of so many parameters such as computational delay, rate of security, and speed. To illustrate the performance of the proposed cryptographic scheme, some cryptographic attacks are proposed. The mathematical analysis have confirmed that the combined factoring problems and chaotic maps scheme has a high rate of security which satisfy the cryptographic requirements. To the best of our knowledge, this is the first time an ID-based cryptography based on chaotic maps and factoring problems has been proposed. [ABSTRACT FROM AUTHOR]

Multi-proxy signature schemes (MPSS) allow n proxy signers to generate a valid signature on behalf of the original signer. A new efficient self-certified MPSS with message recovery based on the Elliptic Curve Discrete Logarithm Problem (i.e., ECDLP) is proposed in this paper. A rationale for proposing a new scheme is to improve the verification process performance by combining the verification process with message recovery in one single stage (i.e., simultaneously). The security and performance analysis shows, the new scheme has many advantages over the traditional MPS schemes. These benefits include decreasing costs (i.e., certificate sizes, consumption time, and bandwidth requirements) and increasing speed. [ABSTRACT FROM AUTHOR]

There has been a great deal of interest in researching the behavior of chaotic systems over the past decade. They are distinguished by their sensitivity to initial conditions, continuous broad-band power spectrum, and similarity to random behavior. Chaos has possible applications in the encryption, compression, and modulation blocks of a digital communication system. The possibility of self-synchronization of chaotic oscillations has spawned a deluge of research on the cryptographic applications of chaos. FAC (Factoring) and CM (Chaotic maps) are used in this research to develop a new signature system (CM). Our system has a higher security level than any other based on a single hard number-theoretic problem since it is extremely unlikely that FAC and CM can be solved effectively at the same time. We further demonstrate that the scheme's performance involves only minimal operations in signing and validating logarithms, and that it is impervious to attack. [ABSTRACT FROM AUTHOR]