Symmetric Cryptography Research Articles

Compare encryption performance across devices to ensure the security of the IOT

The Internet of Things (IoT) combines many devices with various platforms, computing capabilities and functions. The heterogeneity of the network and the ubiquity of IoT devices place increased demands on security and privacy protection. Therefore, cryptographic mechanisms must be strong enough to meet these increased requirements, but at the same time they must be effective enough to be implemented on devices with disabilities. One of the limited devices are microcontrollers and smart cards. This paper presents the performance and memory limitations of modern cryptographic primitives and schemes on various types of devices that can be used in IoT. In this article, we provide a detailed assessment of the performance of the most commonly used cryptographic algorithms on devices with disabilities that often appear on IoT networks. We relied on the most popular open source microcontroller development platform, on the mbed platform. To provide a data protection function, we use cryptography asymmetric fully homomorphic encryption in the binary ring and symmetric cryptography AES 128 bit. In addition, we compared run-time encryption and decryption on a personal computer (PC) with Windows 7, the Bluetooth Low Energy (BLE) Nano Kit microcontroller, the BLE Nano 1.5, and the smartcard ML3-36k-R1.

Towards Secure and Privacy-Preserving IoT Enabled Smart Home: Architecture and Experimental Study.

Internet of Things (IoT) technology is increasingly pervasive in all aspects of our life and its usage is anticipated to significantly increase in future Smart Cities to support their myriad of revolutionary applications. This paper introduces a new architecture that can support several IoT-enabled smart home use cases, with a specified level of security and privacy preservation. The security threats that may target such an architecture are highlighted along with the cryptographic algorithms that can prevent them. An experimental study is performed to provide more insights about the suitability of several lightweight cryptographic algorithms for use in securing the constrained IoT devices used in the proposed architecture. The obtained results showed that many modern lightweight symmetric cryptography algorithms, as CLEFIA and TRIVIUM, are optimized for hardware implementations and can consume up to 10 times more energy than the legacy techniques when they are implemented in software. Moreover, the experiments results highlight that CLEFIA significantly outperforms TRIVIUM under all of the investigated test cases, and the latter performs 100 times worse than the legacy cryptographic algorithms tested.

A Review of Quantum Key Distribution Protocols in the Perspective of Smart Grid Communication Security

Smart grid depends on an advanced communication network to collect information from the power grid, and to disseminate control commands to the control devices. To safeguard the power grid, it is crucial to ensure information confidentiality in the communication networks. Quantum key distribution (QKD) protocols help in generating, and distributing secret keys between communication parties, and such secret keys are required in symmetric cryptography. The combination of QKD protocols, and symmetric cryptography are known to be unconditionally secure, which means information confidentiality can be guaranteed even against an eavesdropper, who has unlimited resources. This article provides a concise review of existing works on QKD protocols, and their applications in smart grid communications. Deploying QKD protocols in smart grid is challenging because distance between the control center, and control devices can be larger than the limits of existing protocols. Also, QKD protocols require an expensive quantum channel between each pair of sender, and receiver nodes, and there is large number of control devices with diverse capabilities in smart grid. We have classified existing works based on the challenges they have dealt with. Compared to the rich literature on QKD protocols in general, there are significantly fewer works in the specific context of smart grid. This can be an indication for opportunity to make a significant contribution. We have also identified a few research challenges that can be potential future works.

A Secure Cloud Data Sharing Protocol for Enterprise Supporting Hierarchical Keyword Search

Cloud storage becomes the priority for storing and sharing data for enterprise users. Encrypting prior to uploading data to the cloud is the best way to protect business secrets, however, it hinders the convenient operations on plaintexts, such as searching over the cloud data. In addition, employees in an enterprise have multiple layer structures and a higher layer employee should have the privilege to monitor the lower layer employees’ data to check if these users violate the regulation without letting the employees be aware of. Public key encryption with keyword search (PEKS) is a well-known cryptographic primitive suitable for secure cloud storage, which supports keyword search without decryption in public key encryption settings. Unfortunately, no existing PEKS scheme supports the monitoring function without authorization from the sender. To address this issue, we propose a variant of PEKS named Hierarchical Public Key Encryption with Keyword Search (HPEKS) and provide a semi-generic construction utilizing a public key tree (PKTree) and a PEKS scheme. To better suit for the enterprise secret data sharing, we build an advanced HPEKS scheme, named designated-tester decryptable hierarchical public key encryption with keyword search (dDHPEKS), which enjoys stronger security and integrates the public key and symmetric key encryptions. We prove our dDHPEKS scheme secure under the security definition in the random oracle model. Particularly, it satisfies the security against outside offline keyword guessing attacks and furthermore, enjoys the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">transparency</i> property so that the sender does not need to know the internal hierarchy structure of an enterprise in order to share encrypted data to the enterprise. Theoretical evaluation and concrete experiments show that our dDHPEKS scheme has comparable running efficiency with existing PEKS schemes.

Development of digital signature algorithm based on the Niederriter crypto-code system

The development of computing resources in the post-quantum period calls into question the provision of the required level of stability of symmetric and asymmetric cryptography algorithms. The advent of a full-scale quantum computer based on the Shore and Grover algorithms greatly increases the capabilities of cybercriminals and reduces the resilience of cryptosystems used in protocols for basic security services. The article analyzes the main requirements for resistance to post-quantum cryptography algorithms. In such conditions, it is necessary to use modified cryptosystems that provide an integrated required level of stability and efficiency of cryptocurrencies. One such mechanism is the crypto-code constructs of McEliece and Niederriter, which provide the required indicators of durability, efficiency and reliability. The paper analyzes the construction of the crypto-code structure of the Niederriter on elliptical (EC), modified elliptical codes (MEC) shortened and / or extended, and defective codes, practical algorithms for their implementation. An advanced protocol for the formation of a digital signature using Niederriter crypto-code constructions is proposed.

The Effect of the Primitive Irreducible Polynomial on the Quality of Cryptographic Properties of Block Ciphers

Substitution boxes are the only nonlinear component of the symmetric key cryptography and play a key role in the cryptosystem. In block ciphers, the S-boxes create confusion and add valuable strength. The majority of the substitution boxes algorithms focus on bijective Boolean functions and primitive irreducible polynomial that generates the Galois field. For binary field F2, there are exactly 16 primitive irreducible polynomials of degree 8 and it prompts us to construct 16 Galois field extensions of order 256. Conventionally, construction of affine power affine S-box is based on Galois field of order 256, depending on a single degree 8 primitive irreducible polynomial over ℤ2. In this manuscript, we study affine power affine S-boxes for all the 16 distinct degree 8 primitive irreducible polynomials over ℤ2 to propose 16 different 8×8 substitution boxes. To perform this idea, we introduce 16 affine power affine transformations and, for fixed parameters, we obtained 16 distinct S-boxes. Here, we thoroughly study S-boxes with all possible primitive irreducible polynomials and their algebraic properties. All of these boxes are evaluated with the help of nonlinearity test, strict avalanche criterion, bit independent criterion, and linear and differential approximation probability analyses to measure the algebraic and statistical strength of the proposed substitution boxes. Majority logic criterion results indicate that the proposed substitution boxes are well suited for the techniques of secure communication.

A Novel Chaos-Based Color Image Encryption Scheme Using Bit-Level Permutation

To ensure the security of digital images during transmission and storage, an efficient and secure chaos-based color image encryption scheme using bit-level permutation is proposed. Our proposed image encryption algorithm belongs to symmetric cryptography. Here, we process three color components simultaneously instead of individually, and consider the correlation between them. We propose a novel bit-level permutation algorithm that contains three parts: a plain-image related rows and columns substitution, a pixel-level roll shift part, and a bit-level cyclic shift part. In the plain-related rows and columns substitution part, we involve the plain-image information to generate a control sequence by using a skew tent system. This process ensures that the correlation between three color components can be totally broken, and our cryptosystem has enough plain-image sensitivity to resist the differential attack. In the pixel-level roll shift part and bit-level cyclic shift part, we have a fully bit-level permutation controlled by two sequences using a Rucklidge system. The simulation and some common security analyses are given. Test results show that our proposed scheme has good security performance and a speed advantage compared to other works.

Development of a modified UMAC algorithm based on crypto­code constructions

The development of computer technology has determined the vector for the expansion of services based on the Internet and “G” technologies. The main requirements for modern services in the banking sector are security and reliability. At the same time, security is considered not only as ensuring the confidentiality and integrity of transactions, but also their authenticity. However, in the post-quantum period, US NIST specialists question the durability of modern means of providing basic security services based on symmetric and asymmetric cryptography algorithms. The increase in computing resources allows attackers to use modern threats in combination. Thus, there is a need to search for new and/or modify known algorithms for generating MAC (message authentication codes). In addition, the growth of services increases the amount of information that needs to be authenticated. Among the well-known hash algorithms, the hash functions of universal hashing are distinguished, which allow initially determining the number of collisions and their uniform distribution over the entire set of hash codes. Possibilities of modifying the cascade hashing algorithm UMAC (message authentication code based on universal hashing, universal MAC) based on the use of McEliece crypto-code construction on algebrogeometric (elliptic codes (EC), modified elliptic codes (MEC) and damaged codes (DC). This approach allows preserving the uniqueness property, in contrast to the classical UMAC scheme based on a block symmetric cipher (AES). The presented algorithms for evaluating the properties of universality and strict universality of hash codes make it possible to evaluate the security of the proposed hashing constructs based on universal hash functions, taking into account the preservation of the universality property

Classification of quadratic APN functions with coefficients in [formula omitted] for dimensions up to 9

Almost perfect nonlinear (APN) and almost bent (AB) functions are integral components of modern block ciphers and play a fundamental role in symmetric cryptography. In this paper, we describe a procedure for searching for quadratic APN functions with coefficients in F2 over the finite field F2n and apply this procedure to classify all such functions over F2n with n≤9. We discover two new APN functions (which are also AB) over F29 that are CCZ-inequivalent to any known APN function over this field. We also verify that there are no quadratic APN functions with coefficients in F2 over F2n with 6≤n≤8 other than the currently known ones.

Security of Data` in Cloud Computing Based on Advanced Secret Sharing Key Management Scheme

Cloud Computing (CC) is a worldwide concept and there are no boundaries define with in the cloud computer which is used to access and store user data can be located anywhere on the global network, depending on where the capacities that are required are available in the global computer networks used for cloud computing. Because of the efficient features of (CC) many Organization are using cloud storage for storing their essential information. The data can be stored remotely in the cloud computing environment by the user and can be retrieved by the client at the time of need. Data security is the major concern in cloud computing. Data Storage is risky because of use of internet by cloud based services which means less control over the store data. Essential elements of cloud is how do we grab all the benefit of the cloud while maintain security controls over the organization assets. Our aim is to propose a more reliable, decentralized light weight key-management scheme (KMS) techniques for cloud system which provide more efficient data security.

Two Variations of Peer Intermediaries for Key Establishment in Sensor Networks

Recently, the issue pertinent to sensor network security is a popular topic. Especially, due to the restriction of energy supplied by battery power of the sensors, symmetric cryptography is one of the suitable choices for the secret communication between sensors, while asymmetric cryptography is not appropriate because of its heavy loading on computation should consume a lot of energy. As a result of using symmetric cryptography, there are numerous research papers focusing on designing efficient key management scheme in sensor networks. PIKE designed by Chan and Perrig is a scheme using peer intermediaries and their pre-installed keys to deliver secret message from one sensor to another. However, they did not consider the case that the sensors are scattered in nonuniform way. Moreover, O(logn) is enough for sensor networks to achieve expander topology while PIKE has O(√n) storage overhead. This article gives generalizations of PIKE to offer more choices for developers under different requirements. The Constant Storage Protocol, abbreviated as CSP, costs constant memory storage and is more suitable for group-based deployment.

Secure Data Travelling User using Hybrid Cryptosystem with User Privacy Protection

Nowadays traveling is the activity that everyone likes the most, but sometimes there is one traveling member who is lost and confused looking for the location of the other members. When traveling, they must bring a smartphone because of its small size and easy to carry anywhere. For this reason, an Android-based smartphone application that is able to send GPS data to all travelling members is proposed. In order to secure data transmission, cryptography and group signature to ensure that only traveling members could find out the location are applied. We use hybrid cryptography, which is a combination of symmetric cryptography using AES and asymmetric cryptography using IB-mRSA. We also add group signature as verification that members are in the same traveling group. The test result showed that the proposed method is safer than the comparison method because the symmetric key is encrypted before the key is distributed, so the attacker can not know the key. The total processing time needed to send data until member get data is 2.01 s.

Symmetric Cryptography With Shift 2n-1, Hash Transformation, Optimization-Based Controller for Medical Image Infosecurity: Case Study in Mammographic Image

Among imaging examinations, mammography noninvasively aids in the early detection and diagnosis of diseases inside the body, such as lung cancer or breast tumor, for first-line examination and helps physicians to treat medical conditions. As digital medical images can be transmitted by computer or telecommunication network, ensuring image infosecurity in public spaces is difficult. In infosecurity considerations, digital signature and encryption of individual anamnesis plain images should prevent data from being stolen, tampered, or peeked by unauthorized people. Hence, infosecurity has become an important issue in the digital era. This study proposes right / left shift 2n−1 pixel values, hash transformation with multi-secret gold keys, and an optimization-based controller to integrate two symmetric cryptography processes for medical image encryption and decryption with the same secret gold keys. Then, swarm optimization-based controllers, which are based on particle swarm optimization (PSO) and firefly algorithm (FA), are implemented to search the decryption key parameters. For a case study on mammographic images consisting of medical X-ray images of 50 benign tumors and 50 malignant tumors, the peak signal-to-noise ratio is used to evaluate the relation between the original plain images and decrypted images. Conclusively, the FA -based controller performed better than the PSO -based controller in terms of recovery reliability and speeds up the computation of the desired optimal solution.

Arduino UNO and Android Based Digital Lock Using Combination of Vigenere Cipher and XOR Cipher

Data security becomes an important thing in the computer era nowadays, especially in digital lock. Because of easy to use, there is a lot of digital locks connected to Android smartphone. However, the security of digital lock is lower if commands and passwords exchange is unprotected. That is why algorithm combination concept is important to be applied. Vigenere Cipher and XOR Cipher algorithm combination is simple to be applied, where both are symmetric cryptography algorithm which has advantage in short calculation time, so the plaintext processing can run quickly. To implement the cryptography algorithm combination concept, a digital lock prototype is also needed. One of the best microcontroller for prototyping is Arduino UNO. It can communicate with other devices through Bluetooth connection especially Android smartphone if connected to Bluetooth module. The Arduino UNO based digital lock will communicate with Android smartphone via an application in the smartphone. It is found that Vigenere Cipher and XOR Cipher algorithm combination, and also other support algorithms can improve the secrecy of communication between devices in the digital lock system.

An improved user authentication scheme for electronic medical record systems

Electronic Medical Record (EMR) systems is a part of e-healthcare system, which is developing rapidly. In this, it is possible to deliver medical services among multiple participants over a network without physical presence. Since sensitive data is transmitted over public channels, it is very much required to maintain the secrecy of that data. This is achieved by mutual authentication between the participants. For this, various schemes for authentication with smart cards have been proposed. Han et al. proposed one such biometrics-based scheme for the same purpose using hash functions along with symmetric key encryption and elliptic curve cryptography. From cryptanalysis of their scheme, we have pointed out weaknesses viz. no user anonymity, user and server impersonation, man-in-the-middle attack. These security issues have been presented in this article. To overcome these attacks, a scheme has been proposed in this article. Since it does not use symmetric key encryption, the proposed scheme reduces the computational complexity as can be seen in the comparison provided. The security analysis of the proposed scheme, along with BAN (Burrows-Abadi-Needham) logic has been explained in detail. Comparison of the proposed scheme with related schemes with respect to computation cost, execution time and performance is demonstrated. This proves that the proposed scheme performs well in terms of security as well as computational efficiency.

Development of NgeXTEA: a web based learning tool for cryptography algorithm

One of the issues in teaching information security in particular cryptography is lack of tools to facilitate students’ understanding of related topics. The study specifically discusses the development of a web based learning tool for teaching symmetric cryptography in Indonesian language. The module is called NgeXTEA which contains a guide to the process of encryption and decryption in stages using Extended Tiny Encryption Algorithm (XTEA). The development of NgeXTEA including its features is presented. Based on several evaluations with various combinations of characters, it is finally concluded that NgeXTEA module works well as expected.

An OTP Integrated Optimal Key RSA Based Secure Data Communication

System security is a basic aspect of data sharing. Aspires have been made to exhaust particular defects over the web. For this, different creative usage and security methods have been made. The measure of information exchange isn't a factor. The major factor is, how much it's secure, the channel gives while transmitting information. Cryptography is one such structure, which grants secure information transmission without losing its protection and uprightness. In light of the key circulation, cryptography is also assembled into two critical forms Symmetric Key Cryptography as well as Asymmetric Key Cryptography. RSA is one of the best conspicuous public-key cryptography based algorithms is unequivocally utilized for encryption/decryption. It's far based on the logical arrangement of factorization of strongly enormous whole numbers which is a compute-intensive way. In this paper, we have provided a novel, secure and profitable information communication system dependent on the RSA algorithm. Mystery updating signal dealing with systems have been proposed in the exploration for the two data transmission and the channel estimation stages. The proposed one facilitates the advantages of both RSA calculation and One Time Password (OTP) produced by the sender and got just by the endorsed customer. Despite that not at all like conventional RSA algorithm, in this work we embrace perfect key assurance by particle swarm optimization (PSO) during both encryption and decryption. The use of PSO for perfect key decision makes the general technique proficient by extending the security level and making the computation procedure very easy.

Study and analysis of key generation techniques in internet of things

Wireless communication-based services compromised with security threats due to the open channel communication model. Free communication channel models have limited bandwidth and open port communication. Due to the limited bandwidth implementation of security channel is a very complex process in the internet of things (IoT). The trend of technology is interdisciplinary of the IoT puts the demands of secured communication. The key generation mechanism provides the end to end security communication process for the internet of things (IoT). In the process of approval and authentication used lightweight key generation methods for protection. The key generation mechanism used symmetric, asymmetric and hybrid cryptography. The process of a key generation faced a problem of high energy and time complexity. In this paper presents the study and analysis of key generation algorithms used in the internet of things (IoT). For the generation of key, four algorithms are used such as AES, 3DES, RSA and ECC. These algorithms used different key size and different file size and measured the computational cost. The measured computational cost gives the direction of key generation for wireless based device communication.

Secured Key Distribution by Concatenating Optical Communications and Inter-Device Hand-Held Video Transmission

Key distribution is a growing concern for symmetric cryptography. Most of the current key-distribution mechanisms assume the use of the Internet and WAN networks, which are exposed to security hazards. To overcome them, the use of comprehensive and robust cryptographic mechanisms such as Diffie–Hellman (DH) and RSA (Rivest–Shamir–Adleman) algorithms are proposed. These solutions are limited. DH and RSA have been under threat since the introduction of quantum computing. Hence, new ideas are required. This paper introduces a new security approach for a safe key transmission using undetected high-speed optical camera communication (OCC), which is based on the rolling shutter effect of modern smart cameras. The key transfer is done by blinking light-emitting diode (LED) lights in a specific sequence and frequency, following an encoding pattern. The receiver decodes the received blinks to a bit string using a corresponding image processing application. This optical media ensures secure transfer without the ability to quote it. We demonstrate in an experiment the feasibility of using basic wireless optical communication for key transmission, eliminating the need for a permanent, long, and costly setup. It is mobile, available everywhere anytime, and requires only simple connections to operate. The results show that this method is feasible, robust, efficient, and implementable.

Co-communication Protocol of Underwater Sensor Networks with Quantum and Acoustic Communication Capabilities

The concept of communication using acoustic media of underwater sensor networks is important in pollution monitoring, oceanographic data collection and meet future development needs. To improve communication security, it is proposed co-communication of underwater sensor networks with quantum and acoustic communication capabilities by taking advantage of quantum communication and entanglement correlation nonlocality. Between the surface base station and autonomous underwater vehicle, it shares quantum keys by quantum communication and classical communication. Between autonomous underwater vehicle and underwater nodes, it employs symmetric cryptography without causing much encryption and decryption overhead to relay information and correct received information with low-complex on current technique level. In addition, it particularly analyzes the security and throughput efficiency.