Information security, being one of the corner stones of network and communication technology, has been evolving tremendously to cope with the parallel evolution of network security threats. Hence, ...cipher algorithms in the core of the information security process have more crucial role to play here, with continuous need for new and unorthodox designs to meet the increasing complexity of the applications environment that keep offering challenges to the current existing cipher algorithms. The aim of this review is to present symmetric cipher main components, the modern and lightweight symmetric cipher algorithms design based on the components that utilized in cipher design, highlighting the effect of each component and the essential component among them, how the modern cipher has modified to lightweight cipher by reducing the number and size of these components, clarify how these components give the strength for symmetric cipher versus asymmetric of cipher. Moreover, a new classification of cryptography algorithms to four categories based on four factors is presented. Finally, some modern and lightweight symmetric cipher algorithms are selected, presented with a comparison between them according to their components by taking into considerations the components impact on security, performance, and resource requirements.
Analytical Approach for Data Encryption Standard Algorithm Al-hazaimeh, Obaida M.; Al-Shannaq, Moyawiah A.; Bawaneh, Mohammed J. ...
International journal of interactive mobile technologies,
08/2023, Letnik:
17, Številka:
14
Journal Article
Recenzirano
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.
Cryptography is a process by which information or messages can be sent from one user to another user which provides several security services such as confidentiality, data integrity or authentication ...to the wireless communication system. As there is need for secure communication, efficient cryptographic processing is required for good system performance. One of the basic fundamental tools used in information security is known as the signature. Thus, the security for internet banking, account passwords, emails accounts password etc. requires text protection in digital media. This paper presents the security and compression for the data with the advance encryption standard (AES). In our research, we increase the number of rounds (Nr) to 16 for the encryption and decryption process of AES algorithm, which results in more security to the system. Experimental results and Theoretical analysis proved that this AES technique provide high speed as well as less transfer of data over the unsecured channels.
Quantum Cryptanalysis of Affine Cipher Mathews, Mahima Mary; Panchami, V; Ajith, Vishnu
IEEE journal on emerging and selected topics in circuits and systems,
07/2024
Journal Article
Recenzirano
Quantum Algorithms reduce the computational complexity or solve certain difficult problems that were originally impossible to solve with classical computers. Grover's search algorithm is a Quantum ...computation algorithm that can find target elements from a set of unstructured data with the best possible, O (√ N ) queries. Grover's search Quantum circuits implemented accurately can be used to successfully search and find the keys of Symmetric ciphers. However, very few demonstrations of such practical cryptanalysis are available. In this paper, practical Quantum cryptanalysis circuits for Affine Cipher are proposed and demonstrated, that successfully break the cipher by finding the keys.
Modern cryptographic algorithms play an irreplaceable role in data communication systems for various areas of applications. These algorithms are the backbone of data protection and secrecy for highly ...sensitive and classified data. The selection of a suitable crypto-algorithm will dynamically affect the lifespan and performance of a device in terms of battery-life, hardware memory, computation latency and communication bandwidth. In the current developments of the resource constrained environments, the trend is shifting towards lightweight algorithmic hardware designs. To select a suitable cryptographic algorithm for an application or an environment, the understandings of both the algorithmic requirements in terms of hardware and the specifications of the development platform intended has to be established. However, there are numerous ciphers in the literature that has various functionality, specifications and strength. Moreover, there are numerous literatures that cover the trend and specifications of security solutions in hardware constrained environment, employing known cryptographic algorithms. In this paper, we present a comprehensive survey of modern symmetric cryptographic solutions used in resource constrained environment (RCE), including literatures from the area of wireless sensor network (WSN), radio frequency identification (RFID), wireless identification and sensing platform (WISP) and other resource constrained platforms. This paper aims to provide a survey of the ciphers that were used in the past, and what are the ciphers that are currently active, and their respective specifications and applications in the area of modern world RCEs. On top of that, descriptive summaries of (a total of 100 symmetric ciphers) modern block ciphers (38), involution ciphers (6), lightweight block ciphers (28) and stream ciphers (28) are included and discussed, and an overview of the current contributions of various literatures, comparison and analysis of modern ciphers from the hardware and software perspective are also discussed.
With the recent increase in the risks and attacks facing our daily lives and digital environment around us,the trend towards securing data has become inevitable. Block ciphers play a crucial role in ...modern crypto-applicationssuch as secure network storage and signatures and are used to safeguard sensitive information. The present paperdevelops a new variant of the symmetric model called SUMER family ciphers with three equivalent modes: lightweight,conventional (traditional), and extended ciphers. SUMER name belongs to one of the oldest civilizations inMesopotamia and stands for Secure Universal Model of Encryption Robust Cipher. The SUMER cipher is based on asimple and robust symmetric structure and involves solid algebraic theories that completely depend on the Galois FieldGF(28). SUMER cipher is designed to work with two involutional structures of the Substitution-Permutation Network(SPN) and Feistel structure. These two involutional structures mean that the same algorithm is used for the encryptionand decryption process, and only the algorithm of the ciphering key is used in reverse order in both structures. TheSUMER lightweight structure is an elegant mode that does not need building an S-Box that requires a large amount ofmemory and a number of electronic logical gates as S-Box construction has been canceled and replaced by the on-flycomputation clue, which does not need a reserved memory for building S-Box. SUMER family ciphers also can work ina traditional mode or as an extended mode with high margin security. This family of ciphers is applicable with multimodes of various utilizations. The proposed ciphers are designed to be byte-oriented, showing good evaluation andresults under several measurement tests for speed, time implementation, and efficiency.
The article describes the possibility to refuse the direct transfer of the key from the sender to the recipient in the synchronous stream encryption scheme. We suggest creating a table of ...correspondence between the key information K, and the time of sending an email or phone call. The sender will have one instance of such a table, and the recipient will have another. The format of the key information in the simplest case includes the PRNG key itself, which determines the logic of operation of the PRNG nonlinear function, the code of the type of the used PRNG nonlinear function, and the PRNG design code. We offer 2 ways of interaction between the sender and the recipient of messages. Consider two possible options for encryption schemes: when the superposition of a sequence from the output of the PRNG on the input sequence is performed by the XOR operation, and when the encryption process is performed with a stochastic transformation of R, and the operation decryption operation backward stochastic transformation R-1. We present the scheme of one of the simplest possible variants for constructing the block R of the stochastic transformation.
The rapidly evolving field of biometric recognition and verification technologies has seen substantial progress recently. However, the storage of biometric data in cloud environments presents ...significant security challenges, including data theft and unauthorized modifications. Cancelable biometrics emerge as a strategic solution to these issues. This study examines the efficacy of diverse cancelable biometric methods, classified into transformation, encryption, and hybrid approaches. We introduce a novel cancelable biometric system that combines a hybrid optical asymmetric phase truncated Fourier transform (PTFT) with a symmetric cipher scheme, enhanced by a two-level block-based shuffling technique. This innovation improves security through a streamlined shuffling process that divides the PTFT output into four sections for shuffling and an exclusive OR operations with a unique key, enhancing security and computational efficiency. Our empirical evaluation on three distinct datasets (Faces, Iris, and Fingerprints) from FERET, UPOL and CASIA, and FVC2002 DB1 and DB2, respectively, demonstrates superior performance of our system compared to traditional PTFT-based systems. Notable performance metrics include an Area under the receiver operating characteristic curve of 0.9998. Significant improvements were also observed in false acceptance and false rejection ratios, along with more uniform histogram distributions, thereby enhancing randomness in the resultant deformed patterns. From a security standpoint, our system exhibits a high entropy of 7.95 and achieves near-optimal results in the number of pixels change rate and unified average changing intensity, with values of 98.9115 and 23.9755%, indicating robust resilience against potential differential attacks. The research findings, supported by detailed tables and graphical illustrations, underscore the additional security benefits offered by the two-level encryption mechanism.