Key Cryptographic Technique Research Articles

A review of research on secret sharing

This article explores the importance and challenges of secret sharing technology in the context of rapid advancements in information technology. With increasing attention on data security and privacy protection, secret sharing serves as a key cryptographic technique that ensures secure data transmission, storage, and multi-party computation by dividing secrets into multiple shares. However, existing solutions encounter performance bottlenecks when dealing with large-scale datasets, managing share updates in dynamic environments, and facing quantum computing threats. This article systematically summarizes the basic concepts, theories, classifications, and characteristics of secret sharing while analyzing its applications in financial security, medical privacy, and other fields. Furthermore, it presents recent research progress on dynamic secret sharing and anti-quantum secret sharing. The findings indicate that dynamic secret sharing schemes improve long-term key storage security, while anti-quantum secret sharing provides a solution to counteract quantum computing threats. This study not only deepens understanding of secret sharing technology but also offers insights for future research directions, significantly contributing to enhancing data protection levels.

A Novel and Secure Fake-Modulus Based Rabin-Ӡ Cryptosystem

Electronic commerce (E-commerce) transactions require secure communication to protect sensitive information such as credit card numbers, personal identification, and financial data from unauthorized access and fraud. Encryption using public key cryptography is essential to ensure secure electronic commerce transactions. RSA and Rabin cryptosystem algorithms are widely used public key cryptography techniques, and their security is based on the assumption that it is computationally infeasible to factorize the product of two large prime numbers into its constituent primes. However, existing variants of RSA and Rabin cryptosystems suffer from issues like high computational complexity, low speed, and vulnerability to factorization attacks. To overcome the issue, this article proposes a new method that introduces the concept of fake-modulus during encryption. The proposed method aims to increase the security of the Rabin cryptosystem by introducing a fake-modulus during encryption, which is used to confuse attackers who attempt to factorize the public key. The fake-modulus is added to the original modulus during encryption, and the attacker is unable to distinguish between the two. As a result, the attacker is unable to factorize the public key and cannot access the sensitive information transmitted during electronic commerce transactions. The proposed method’s performance is evaluated using qualitative and quantitative measures. Qualitative measures such as visual analysis and histogram analysis are used to evaluate the proposed system’s quality. To quantify the performance of the proposed method, the entropy of a number of occurrences for the pixels of cipher text and differential analysis of plaintext and cipher text is used. When the proposed method’s complexity is compared to a recent variant of the Rabin cryptosystem, it can be seen that it is more complex to break the proposed method—represented as O(ɲ× τ) which is higher than Rabin-P (O(ɲ)) algorithms.

Performance Comparison between RSA and El-Gamal Algorithms for Speech Data Encryption and Decryption

This article presents a performance comparison of two known public key cryptography techniques namely RSA (Rivest–Shamir–Adleman) and El-Gamal algorithms to encrypt/decrypt the speech signals during transferring over open networks. Specifically, this work is divided into two stages. The first stage is enciphering-deciphering the input speech file by employing the RSA method. The second stage is enciphering-deciphering the same input speech file by employing the El-Gamal method. Then, a comparative analysis is performed to test the performance of both cryptosystems using diverse experimental and statistical analyses for the ciphering and deciphering procedures like some known speech quality measures: histogram, spectrogram, correlation, differential, speed performance and noise effect analyses. The analyses outcomes reveal that the RSA and El-Gamal approaches are efficient and adequate for providing high degree of security, confidentiality and reliability. Additionally, the outcomes indicate that the RSA speech cryptosystem outperforms its counterpart the El-Gamal speech cryptosystem in most of ciphering/deciphering speech performance metrics.

A SURVEY ON EFFICIENT AUDITING SCHEME FOR SECURE DATA STORAGE IN FOG-TO-CLOUD COMPUTING

With the rise of the Internet of Things, fog-to-cloud computing has emerged as a new cutting-edge approach (IoT). Except for the cloud service provider, fog-to-cloud computing necessitates the participation of additional entities, such as mobile sinks and fog nodes (CSP). As a result, fog-to-cloud storage integrity audits will differ from standard cloud storage auditing. Tian et al. has completed the first stage in developing a public auditing system for fog-to-cloud computing. However, because they employ complex public key cryptography techniques like bilinear mapping and proof of knowledge, their system becomes inefficient. We offer a more broad and efficient auditing system based on MAC and HMAC, two prominent private key cryptography algorithms in this study. By implementing MAC and HMAC, we give a real instantiation of our auditing system. Finally, theoretical analysis and actual findings show that our suggested system has lower communication and computing costs.

Secure and Compact Elliptic Curve Scalar Multiplication with Optimized Inversion

Abstract Elliptic curve cryptography (ECC) is a typical public key cryptography technique that can ensure equivalent security with considerably smaller key sizes than Rivest-Shamir-Adleman (RSA). Hence, various implementations based on ECC are recommended for block chain and Internet of Things (IoT) devices. Because elliptic curve scalar multiplication (ECSM) is a fundamental computation in ECC, enhancing the security and efficiency of ECSM is important. ECSM specifies a scalar multiplication algorithm and elliptic curve addition formulae. Elliptic curve addition formulae on affine coordinates are compact from a memory cost perspective but weak against side channel attacks. Elliptic curve complete addition (CA) formulae can achieve secure ECSMs but are inefficient. A newly proposed secure ECSM, which uses a right-to-left (RL) scalar multiplication algorithm and (extended) affine coordinates, takes advantage of elliptic curve addition formulae on affine coordinates. However, it can only scan the input scalars from right to left. We propose new ECSMs, which can scan the input scalars from left to right (LR) based on (extended) affine coordinates. We also prove that our LR ECSMs satisfy secure generality without requiring exceptional computations. We enhance the efficiency of both LR and RL ECSMs with optimized inversion. Our LR ECSM with a memory of 12 field elements reduces that of the Montgomery ladder and Joye’s LR with CA formulae by 36.84% and that of 2-ary RL with (extended) affine coordinates by 14.29%, respectively. Our compact ECSMs are fit for applications on IoT devices and block chain, with a critical memory requirement.

An Efficient Key Management and Multi-Layered Security Framework for SCADA Systems

Supervisory Control and Data Acquisition (SCADA) networks play a vital role in industrial control systems. Industrial organizations perform operations remotely through SCADA systems to accelerate their processes. However, this enhancement in network capabilities comes at the cost of exposing the systems to cyber-attacks. Consequently, effective solutions are required to secure industrial infrastructure as cyber-attacks on SCADA systems can have severe financial and/or safety implications. Moreover, SCADA field devices are equipped with microcontrollers for processing information and have limited computational power and resources. This makes the deployment of sophisticated security features challenging. As a result, effective lightweight cryptography solutions are needed to strengthen the security of industrial plants against cyber threats. In this paper, we have proposed a multi-layered framework by combining both symmetric and asymmetric key cryptographic techniques to ensure high availability, integrity, confidentiality, authentication and scalability. Further, an efficient session key management mechanism is proposed by merging random number generation with a hashed message authentication code. Moreover, for each session, we have introduced three symmetric key cryptography techniques based on the concept of Vernam cipher and a pre-shared session key, namely, random prime number generator, prime counter, and hash chaining. The proposed scheme satisfies the SCADA requirements of real-time request response mechanism by supporting broadcast, multicast, and point to point communication.

A Secure and Efficient Multi-Factor Authentication Algorithm for Mobile Money Applications

With the expansion of smartphone and financial technologies (FinTech), mobile money emerged to improve financial inclusion in many developing nations. The majority of the mobile money schemes used in these nations implement two-factor authentication (2FA) as the only means of verifying mobile money users. These 2FA schemes are vulnerable to numerous security attacks because they only use a personal identification number (PIN) and subscriber identity module (SIM). This study aims to develop a secure and efficient multi-factor authentication algorithm for mobile money applications. It uses a novel approach combining PIN, a one-time password (OTP), and a biometric fingerprint to enforce extra security during mobile money authentication. It also uses a biometric fingerprint and quick response (QR) code to confirm mobile money withdrawal. The security of the PIN and OTP is enforced by using secure hashing algorithm-256 (SHA-256), a biometric fingerprint by Fast IDentity Online (FIDO) that uses a standard public key cryptography technique (RSA), and Fernet encryption to secure a QR code and the records in the databases. The evolutionary prototyping model was adopted when developing the native mobile money application prototypes to prove that the algorithm is feasible and provides a higher degree of security. The developed applications were tested, and a detailed security analysis was conducted. The results show that the proposed algorithm is secure, efficient, and highly effective against the various threat models. It also offers secure and efficient authentication and ensures data confidentiality, integrity, non-repudiation, user anonymity, and privacy. The performance analysis indicates that it achieves better overall performance compared with the existing mobile money systems.

Information security in the post quantum era for 5G and beyond networks: Threats to existing cryptography, and post-quantum cryptography

Quantum computing is an emerging field that uses the concepts of quantum mechanics to outperform classical computers. Quantum computing finds plethora of applications in the 5G and Beyond networks. It can process data at an exponential rate, which can address numerous business and scientific challenges. In this paper, we provide a detailed review of the field, starting from the most important applications of quantum computers and then diving into the future of cryptography. The major applications of quantum computing include unstructured search, quantum simulation, and optimization. It can also provide improvements in terms of speed and accuracy for some existing technologies, such as machine learning. These technologies have numerous applications in 5G and beyond networks. However, due to such abilities of quantum computing, it can also pose a serious risk to many existing security systems, especially the asymmetric key cryptography schemes. The risk of quantum computing has also influenced the mobile broadband standards to move from a symmetric key cryptography techniques to PKI-based trust model. We also discuss in detail various alternate cryptosystems based on mathematical problems that are believed to be hard even for a quantum computer to solve. In parallel, we discuss the developments in the field of quantum key distribution that makes use of quantum phenomenon to develop a quantum-resistant crypto systems. Such quantum-resistant systems have a great potential in provisioning secure 5G and beyond networks.

A new provable hierarchical anonymous certificateless authentication protocol with aggregate verification in ADS-B systems

Automatic Dependent Surveillance-Broadcast (ADS-B) technology is a new solution for communication among aircraft and ground controller stations. In this new surveillance technology, critical messages (e.g., the location of aircraft) are achieved by navigation satellites, and then an on-board equipment multicasts the unencrypted messages twice per second to the others. The former ADS-B protocols suffer from weak authentication protocols with a few security vulnerabilities and privacy issues including key-escrow problem, user profiling, time consuming verification processes, and difficulties with certificate management. In this paper, we propose a new hierarchical authentication protocol used Certificateless Public Key Cryptography (CL-PKC) technique to avoid using Public Key Infrastructure (PKI) certificate management and solve the key-escrow concern in Identity-based Public Key Cryptography (ID-PKC). Further, unlike many of certificateless schemes, our proposed scheme is secure against malicious-but-passive Key Generation Center (KGC). We prove that our scheme preserves conditional privacy, which means that distinct identities map to varied pseudonyms. The security and privacy features of our scheme are provably modeled under the widely-accepted random oracle model by computational Diffie-Hellman (CDH) assumption against adaptive chosen-message attack. Finally, we show that the time needed to aggregate verification of 50 messages reduced by 84% and 48% compared to those of Yang et al.’s and He et al.’s schemes respectively.

DNA Computing Based Encryption Algorithm for Wireless Multimedia Communication System

Transmission of digital images for wireless multimedia communication system requires reliable security in storage which is a challenging task. So many works are carried out to develop and implement the cryptographic techniques for a wireless multimedia communication system. A traditional symmetric key cryptographic algorithm such as Light weight Data Encryption Standard cipher, Advanced Encryption Standard cipher, Triple-DES, Twofish, Blowfish, RC5 etc played a major role to transmit and receive the multimedia (text, image and video) data. Proposed DNA computing based authentication algorithm provides secure transmission of multimedia data by using symmetric key cryptography techniques. DNA computing techniques provides a higher level of security and enables the user to store a large amount of data. Finally, it shows the implemented result analysis the performance of different symmetric key cryptographic techniques using the simulation parameters such as power consumption, key size, processing time, memory space, speed and latency. It also improves the security level by incorporating the advantage of DNA cryptography to achieve a high level of security against various attacks.

Safe Light Weight Cipher using Ethernet and Pentatop Number

Current essential factor in this world to send a sensi-tive information over the unsecured network like the internet is security. Protection of sensitive data is becoming a major raising problem due to rising technologies. A recent attack on Electron-ic Mail of CBI shows that attacker’s efficiency rate. Standard cryptographic algorithms can be exploited by the attackers fre-quently and unable to apply for standard devices because of their energy consumption due to high computation with slow processing. Lightweight cryptography based algorithms can reduce these problems. This paper deals with symmetric key cryptography technique to encrypt the data where the sender and receiver share a common key which can also be called a secret key cryptography. To encrypt and decrypt the data, randomly generated Pentatope Number has used as a key. Next level of security will be provided using EHA (Ethernet Hardware Ad-dress or MAC Address) which is globally unique, to provide secure data transmission. The increasing of attacks on related key attacks motivates this. In particular, we investigate the effi-ciency impact comparatively other standard algorithms and observed that applications do not always use cryptographic algorithms without their intended use.

Partial and Fully Homomorphic Encryption Schemes for Privacy Preserving

Nowadays security and authentication of user’s data is a major concern over cloud environment. Unauthorized users try to attack outsourced data over the cloud. Different researchers proposed various algorithms based upon data security. Authentication technique such as homomorphic encryption is the latest advancement in privacy preserving. Homomorphic encryption operations are applied to cipher text which provides the similar results that would have been derived from original text. Homomorphic public key cryptography technique preserves user’s data security. This paper focuses on various partial and fully homomorphic encryption schemes and gives a comparative analysis.

Design of Secure Chatting Application with End to End Encryption for Android Platform

In this paper, a secure chatting application with end to end encryption for smart phones that used the android OS has beenproposed. This is achieved by the use of public key cryptography techniques. The proposed application used the Elliptic Curve DiffieHellman Key Exchange (ECDH) algorithm to generate the key pair and exchange to produce the shared key that will be used for theencryption of data by symmetric algorithms. The proposed Application allows the users to communicate via text messages, voicemessages and photos. For the text message security the standard AES algorithm with a 128 bit key are used. The generated key (160 bit)minimized to 128 bit length by selecting the first 128 bit of the generated key in order to be used by the AES algorithm. For the voice andimage security processes the proposed application used the symmetric algorithm RC4 for this purpose.

Identity Based Proxy Signature from RSA without Pairings

RSA is a key cryptography technique and provides various interfaces for the applied software in real-life scenarios. Although some good results were achieved in speeding up the computation of pairing function in re- cent years, the computation cost of the pairings is much higher than that of the exponentiation in a RSA group. So it is still interesting to design efficient cryptosystems based on RSA primitive. A proxy signature scheme allows a proxy signer to sign messages on behalf of an original signer within a given context. Most identity based proxy signature schemes currently known employ bilinear pairings. In this paper, an identity based proxy ring signature (IBPS) scheme from RSA without pairings is constructed, and the security is proved under the random oracle model.

A Study on Modern Cryptographic Primitives and Signature Schemes

<div><p class="Default"><em>The access to digital data by the users has increased in recent times with the advent of data communication technologies and its popularization. The data which is in digital form has to pass through insecure channels, for example when a user accesses the Internet, the privacy of data becomes a major issue. The area of Information Security has to play a crucial role when it comes to protecting the privacy of digital data. Cryptography is one such part of Information Security field where a sender’s message gets encrypted and the message gets decrypted at the receiver’s end. From time to time, various cryptographic schemes have been developed among which the Private Key Cryptography and Public Key Cryptography techniques are prominent. Moreover many special Signature Schemes which are part of cryptographic protocols have been providing security in dealing with digital transactions. This paper focuses on the use of modern cryptographic schemes and their importance in digital data communication system.</em></p></div>

Improved the Security Strength of Visual Cryptography using Feature based Watermarking Technique

Data integrity and confidentiality is major issue in internet based communication. For the integrity and confidently used various cryptography and stenography technique. The traditional message hiding technique faced a problem of intruder. The intruder easily decrypts the image and gets information. For the improvement of security strength used various key cryptography technique for hiding of information. In consequence of data hiding visual cryptography is another milestone. The process of visual cryptography used technique of share generation for the authentication of image. The process of share generation used mathematical formula and derivations. In this paper proposed feature based watermarking technique for visual cryptography. The feature based process used two feature property of image, color and texture feature. The color feature property generates a key value and texture feature property generates the value of share for the visual cryptography. The proposed method is simulated in MATLAB software and applies some geometrical attack for the measuring of security strength. General Terms Visual Cryptography, Watermarking, Geometrical Attack Share Generation

Symmetric Key Encryption Technique: A Cellular Automata based Approach in Wireless Sensor Networks

Cellular Automata (CAs) is one of the most engrossing field for encrypting sensor data applied in Wireless Sensor Networks (WSN). In wireless communications, requirement of security and privacy of information is must. Therefore, transmission of sensor data over wireless communication channel plays a crucial role using cryptography techniques. The usage of cryptography characteristics of cellular automata are still not much explored in WSN. Hence in this paper, we present a symmetric key cryptography technique of block cipher using cellular automata (CAs) rules applied to sensor data in WSN. This cryptography technique uses non- complemented cellular automata rules and hybrid CA rule vector to form a group cellular automata that would be used to encrypt and decrypt sensor data. Proposed methodology has been implemented in C to validate the results.

Certificateless ring signature based on RSA problem and DL problem

Certificateless public key cryptography solves the certificate management problem in the traditional public key cryptography and the key escrow problem in identity-based cryptography. RSA is a key cryptography technique and provides various interfaces for the applied software in real-life scenarios. To the best of our knowledge, all of the known certificateless ring signature schemes employed bilinear pairings. But the computation cost of the pairings is much higher than that of the exponentiation in a RSA group. In this paper, we present the first certificateless ring signature scheme without pairing and prove the security in the random oracle model. The security of the scheme is closely related to the RSA problem and the discrete logarithm (DL) problem.

Symmetric Key Cryptography: Technological Developments in the Field

This paper presents the various developments and emerging trends in the symmetric key cryptography technique. It provides an overview of latest inventions and approaches that are implemented in the recent scenario for the betterment of private key cryptography technique with respect to its efficiency, effectiveness, etc. General Terms Safety, Key, Hiding, Symmetric, Stream, Block, Security, Algorithms.

Secured Communication Key Establishment for Cluster-Based Wireless Sensor Networks

The resource-constraint nature of wireless sensor networks (WSNs) has caused the security one of biggest challenges. An efficient key management scheme is the pre-requisite to ensure security in WSN. In this paper the authors present two versions of a secured key management scheme adopted on cluster-based topology of sensor network. The proposed schemes use partial key pre-distribution and symmetric cryptography techniques, and shows high resilience to different security attacks. Whereas one version of the proposed protocol uses shared partial keys in a cluster, the other version uses private partial keys. Both versions of the proposed key management scheme outperform other random key pre- distribution protocols in the sense that it requires lower space, lower communication overhead and offers very high session key candidates.