Public Key Cryptographic Algorithms Research Articles

Implementasi MD5 dan Paillier Cryptosystem Untuk Membuat Tanda Tangan Digital

Of the several benefits of cryptographic techniques is data authentication. Before the digital era, signatures were used as a means to prove the authenticity of printed documents such as letters, certificates, certificates, books and so on. Documents that do not have a signature will be doubtful for their authenticity. One of the characteristics of these signatures is that all the signature patterns are the same, so this situation can easily be manipulated with signature forgery, if the related parties use a different signature on each document that is signed it will also have an impact on changing doubts on the parties who are signed. reserves the right to verify. To overcome the need, documents should be given a digital signature. The intended digital signature is not a manual signature that is scanned and then embedded in a digital document. Digital signatures will be built from cryptographic techniques. In this study, the signature that will be used is a signature with a combination of a hash function algorithm and a web-based public-key cryptography. The methods used are the MD5 algorithm and Paillier Cryptosystem. Paillier cryposystem is a public-key cryptographic algorithm which is believed to be difficult to attack because it uses n-residue class calculations so that it will be very difficult to find the key pair used, this is known as the Composite Residuosity (CR) assumption.

An efficient two‐factor authentication protocol based on elliptic curve cryptosystem with provable security

AbstractWith the gradual penetration of computers and communication networks into people's lives, more and more people begin to pay attention to the information security. Key agreement protocol provides identity authentication for participants in communication system and generates a temporary session key for participants to encrypt messages. Recently, Wang et al designed an authentication and key agreement (AKA) protocol based elliptic curve cryptosystem and proved that their scheme can resist various known attacks. In this article, we analyze the security of their scheme and demonstrate that it is vulnerable to the temporary factor leakage attacks and insider attacks. Then, based on the elliptic curve public key cryptographic algorithm, we design a secure anonymous two‐factor user AKA protocol. And we use the well‐known random oracle model (ROM) and traditional heuristic discussion to prove the security of the proposed protocol. By comparing with several existing protocols based on public key cryptography algorithm, it is found that this protocol is more secure and efficient. The security analysis shows that the protocol designed in this article can meet all kinds of security requirements and consumes the less computing resources on users and servers, and is especially suitable for the scenarios with high security and efficiency requirements.

Efficient and Secure ECDSA Algorithm and its Applications: A Survey

Public-key cryptography algorithms, especially elliptic curve cryptography (ECC)and elliptic curve digital signature algorithm (ECDSA) have been attracting attention frommany researchers in different institutions because these algorithms provide security andhigh performance when being used in many areas such as electronic-healthcare, electronicbanking,electronic-commerce, electronic-vehicular, and electronic-governance. These algorithmsheighten security against various attacks and the same time improve performanceto obtain efficiencies (time, memory, reduced computation complexity, and energy saving)in an environment of constrained source and large systems. This paper presents detailedand a comprehensive survey of an update of the ECDSA algorithm in terms of performance,security, and applications.

Fast Constant-Time Modular Inversion over Fp Resistant to Simple Power Analysis Attacks for IoT Applications.

The advent of the Internet of Things (IoT) has enabled millions of potential new uses for consumers and businesses. However, with these new uses emerge some of the more pronounced risks in the connected object domain. Finite fields play a crucial role in many public-key cryptographic algorithms (PKCs), which are used extensively for the security and privacy of IoT devices, consumer electronic equipment, and software systems. Given that inversion is the most sensitive and costly finite field arithmetic operation in PKCs, this paper proposes a new, fast, constant-time inverter over prime fields based on the traditional Binary Extended Euclidean (BEE) algorithm. A modified BEE algorithm (MBEEA) resistant to simple power analysis attacks (SPA) is presented, and the design performance area-delay over is explored. Furthermore, the BEE algorithm, modular addition, and subtraction are revisited to optimize and balance the MBEEA signal flow and resource utilization efficiency. The proposed MBEEA architecture was implemented and tested on Xilinx FPGA Virtex #5, #6, and #7 devices. Our implementation over (length of p = 256 bits) with 2035 slices achieved one modular inversion in only 1.12 μs on Virtex-7. Finally, we conducted a thorough comparison and performance analysis to demonstrate that the proposed design outperforms the competing designs, i.e., has a lower area-delay product (ADP) than the reported inverters.

Digital Signature with RSA Public Key Cryptography for Data Integrity in SOSE-Based E-Government Systems

Purpose: SOSE is a novel software paradigm suitable for development of flexible, loose-coupled and end-to-end E-government system. However, the use of this innovation for E-government system is dwindled by security challenge. Apparently, the TLS (transport layer security) solution traditionally applied to protect SOSE-based E-government systems is inadequate since it can only secure point-to-point channels of communicating. Whereas, an end-to-end security protection is necessary to adequately protect SOSE-based applications. Design/Methodology/Approach: Consequently, this paper proposed use of Digital Signature by RSA (Rivest-Shamir-Adleman) public key cryptographic algorithm at the message level to achieve data integrity in SOSE-based E-government system. Findings/Result: The SOAP message content shows adequate formulation of digital signature with appropriate indicators of RSA public key to ensure data integrity. The SOAP message shows that SignedInfo, Signature Value and KeyInfo were formulated correctly. The SignedInfo contains Canonicalization Method, Signature Method and Reference subelements. Also, SignatureValue element has encrypted digest and the KeyInfo element has security token reference. Originality/Value: This security solution integrates many technologies including OASIS’s web service security standard and W3C’s (World Wide Web Consortium) XML digital signature into SOAP envelope to ensure data integrity for E-government system at the message level. Paper Type: Applied Research.

Evaluating the performance of post-quantum secure algorithms in the TLS protocol

Aim: The imminent advent of large-scale quantum computers within the next years is expected to highly affect the security of several cryptosystems that are now considered secure; this mainly holds for classical, long-established, public key cryptographic algorithms such as RSA and elliptic curve cryptography. Apparently, any security protocol that relies on such ciphers, including the transport layer security (TLS) protocol which constitutes a somewhat de facto standard for the security on the web, will not be considered secure in the post-quantum era. To alleviate the security risks stemming from quantum computing, several proposals have been submitted to the relevant procedure initiated by NIST towards evaluating and standardizing one or more quantum-resistant public-key cryptographic algorithms. This paper focuses on embedding post-quantum secure cryptographic algorithms into the TLS protocol to analyze its performance. More precisely, the paper aims to analyze whether this transition to post-quantum secure algorithms will have a significant impact on the user experience due to the possible increase of client--server communication times. Methods: Having as the starting point several important works in the field, several experiments were carried out, using combinations of cloud and local virtual machines per case and considering all the post-quantum cryptographic algorithm finalists for key exchange from the third round of the ongoing NIST process, for various cryptographic as well as network parameters. Results: Our results exhibit that, for key exchange in TLS, the best performance among the post-quantum secure ciphers is achieved by the Saber and CRYSTAL-Kyber variants for all security levels, regardless of the underlying computing power. The performance is comparable to that of the corresponding one achieved by a classical elliptic curve algorithm for key exchange for both RTT and packet loss ratio — i.e., the network parameters seem to have the same effect on post-quantum secure algorithms as in the case of a conventional elliptic curve algorithm. However, the effect of the network parameters on the performance is more crucial than the effect of the underlying chosen ciphers. Conclusion: According to the experiments, we conclude that there exist very promising algorithms that could be utilized in TLS in the near future, which may behave even better than the conventional elliptic curve algorithms for key exchange. It should also be pointed out that NIST announced on 5 July 2022 (i.e., after the completion of our research experiments) that, for general encryption used when we access secure websites, the CRYSTALS-Kyber algorithm has been selected, having as one of its advantages the speed of operation. Hence, the results of our paper are fully in line with the progress of the NIST process. Taking into account that the NIST process is still ongoing (now in its fourth round) with the aim to select more algorithms, as well as that some algorithms may be standardized outside NIST, it becomes evident that our results provide very useful insights on performance aspects of the post-quantum secure algorithms.

Integration of Hardware Security Modules and Permissioned Blockchain in Industrial IoT Networks

Hardware Security Modules (HSM) serve as a hardware based root of trust that offers physical protection while adding a new security layer in the system architecture. When combined with decentralized access technologies as Blockchain, HSM offers robustness and complete reliability enabling secured end-to-end mechanisms for authenticity, authorization and integrity. This work proposes an efficient integration of HSM and Blockchain technologies focusing on, mainly, public-key cryptography algorithms and standards, that result crucial in order to achieve a successful combination of the mentioned technologies to improve the overall security in Industrial IoT systems. To prove the suitability of the proposal and the interaction of an IoT node and a Blockchain network using HSM a proof of concept is developed. Results of time performance analysis of the prototype reveal how promising the combination of HSMs in Blockchain environments is.

Comparative Analysis of Energy Costs of Asymmetric vs Symmetric Encryption-Based Security Applications

Public key algorithms are heavily used in many digital applications including key establishment schemes, secure messaging apps, and digital signature schemes in cryptocurrencies. Recent developments in the field of quantum computation have placed these algorithms at risk as they enable the implementation of more effective attacks to derive the secret key. Most notably Shor’s algorithm exponentially speeds up solving the factoring, discrete logarithm (DLP), and elliptic-curve discrete logarithm (ECDLP) problems. To address this challenge, NIST has initiated a process to develop and standardize a new quantum-resistant public-key cryptographic algorithm. However, asymmetric encryption schemes are known to be computationally intensive, hence energy demanding. The proliferation of energy-constrained internet of things devices, combined with the need to adopt higher complexity quantum resilient cryptographic algorithms, makes it more challenging to continue to use public-key algorithms for all applications. One approach to address these challenges is to adopt symmetric key systems, which are known to be more energy-efficient and more resilient to quantum computers-based attacks. This work performs a comprehensive comparison of energy costs between asymmetric and symmetric key schemes. This comparison is performed using two methods. The first approach uses the energy cost of data usage (ECDU) metric to evaluate the global energy costs associated with internet data usage. It was found that the annual energy consumed by applications associated with public-key cryptography globally is sufficient to provide electricity for 1000 UK households for a year. The second method uses an experimental technique based on constructing a small-scale network of wireless embedded devices. This is subsequently used to compare two key establishment schemes, symmetric and asymmetric, which allows for comparing the computation and communication costs of each solution in a controlled environment, and more importantly estimating the energy consumed by each device participating in the protocol. Our results show that a 58% saving in global energy costs of public key-based applications can be achieved by adopting symmetric key systems. It was also found that a 20% reduction of the energy consumed by a wireless device during a key agreement protocol, can be achieved if symmetric key encryption is used.

Building Blockchains with Secure and Practical Public-Key Cryptographic Algorithms: Background, Motivations and Example

Building Blockchains with Secure and Practical Public-Key Cryptographic Algorithms: Background, Motivations and Example

Analysis of hardware implementations of electronic signature algorithms qTesla, Crystals-Dilitium and MQDSS at different levels of security

It is known, that existing public-key cryptography algorithms based on RSA and elliptic curves provide security guarantees accompanied by complexity. Based on this one can talk about the impossibility to solve problems of integer factorization and discrete logarithm. However, experts predict that the creation of a quantum computer will be able to crack classical cryptographic algorithms. Due to this future problem, the National Institute of Standards and Technologies (NIST), together with leading scientists in the field of cryptography, began an open process of standardizing public-key algorithms for quantum attacks. An important feature of the post-quantum period in cryptography is the significant uncertainty regarding the source data for cryptanalysis and counteraction in terms of the capabilities of quantum computers, their mathematical and software, as well as the application of quantum cryptanalysis to existing cryptotransformations and cryptoprotocols. Mathematical methods of electronic signature (ES) have been chosen as the main methods of NIST USA, which have undergone significant analysis and substantiation in the process of extensive research by cryptographers and mathematicians at the highest level. These methods are described in detail and passed the research at the first stage of the international competition NIST USA PQC. Historically, in 1997, NIST sought public advice to determine the replacement of the data encryption standard (DES), Advanced Encryption Standard (AES). Since then, open cryptographic estimations have become a way of choosing cryptographic standards. For example, NESSIE (2000-2002), eSTREAM (2004-2008), CRYPTREC (2000-2002), SHA-3 (2007-2012) and CAESAR (2013-2019) have adopted this approach. Security was the main parameter in these estimations. Performance in software, performance in application-specific integrated circuits (ASICs), performance in FPGAs, and feasibility with limited resources (small microprocessors and low-power hardware) are secondary criteria. This paper presents the comparison of the hardware of three signature algorithms (qTesla, Crystals-Dilitium, MQDSS), which, in particular, are the candidates for the 2nd round of the NIST PQC competition, and the Crystals-Dilitium algorithm is the finalist of this competition. The objective of this work is to analyze and compare three hardware implementations of candidates for the second round of the NIST PQC contest for an electronic signature algorithm.

Area and power efficient post-quantum cryptosystem for IoT resource-constrained devices

Internet of Things (IoT) connects a myriad of small devices over a huge network, encompassing many different and varied applications and environments. As the IoT network continues to grow, providing end-to-end security over IoT is becoming a paramount issue. To mitigate existing and future security risks within IoT, two important factors should be considered. First, some resource-constrained edge devices have an insufficient area to contain the security part. Second, the advent of quantum computers threatens the security of current public-key cryptography algorithms. In response to these challenges, lattice-based cryptography (LBC) has emerged as a promising technique for IoT security in the quantum era. The feasibility of LBC integration onto resource-constrained devices has been demonstrated in previous research. Multiplication is the main operation in Ring-BinLWE, a type of LBC. In this paper, a new multiplication method is proposed, which is called In-place modular Reduction and anti-circular Rotation Column-based Multiplication (In-place Rot-Col-Mul), and new Ring-BinLWE architecture is designed. In-place Rot-Col-Mul performs a column-based multiplication in which one rotation is executed per cycle. The design was implemented on TSMC-65nm technology and FPGA platforms. ASIC implementation results show a respective improvement in power and area over the state-of-the-art design by 48.42% and 57.8%, respectively.

Research Intuitions of Asymmetric Crypto System

The fast moving world full of data exchange and communication technology, with all sensitive information of an individual virtually available anywhere and anytime, make the Internet world more critical in security aspects. The areas of risks are attended and assured to be safe by means of some sought of crypto mechanisms. The strength and vulnerability of the crypto mechanism defines the durability of the system. The encryption on the communication channel can implement either public or private key algorithms based on the area of applications. The public key cryptography is specifically designed to keep the key itself safe between the sender and receiver themselves. There are plenty of public key cryptographic algorithms but only a few are renowned. This paper is aimed to collect all possible public key cryptographic methods and analyze its pros and cons so as to find a better algorithm to suite almost all conditions in Internet communication world and e-commerce. Research in quantum computers is booming now and it is anticipated that the supremacy of quantum computers will crack the present public key crypto algorithms. This paper highlights issues and challenges to be faced from quantum computing and draws the attention of network researchers to march towards researching on quantum-safe algorithms.

Research on Post-Quantum Cryptosystem Based on IoT Devices

With the emergence of quantum computers, public-key cryptographic algorithms commonly used in classical computers are no longer secure. However, the current post-quantum cryptographic algorithms are mainly concentrated on the desktop CPU of Intel and AMD. For the Internet of Things, which is increasingly widely used, the research on post-quantum cryptographic algorithms is still scarce. Based on the research of post-quantum cryptosystem, this paper explores the post-quantum key algorithm based on Internet of Things devices.

Implementasi Algoritma Luc Pada Aplikasi Keamanan Short Message Service (SMS) Berbasis Android

Short Message Service (SMS) still has security problems with attempts to steal messages, intercept messages, hijack messages by parties who are not responsible for obtaining information. Cryptography is the science of maintaining the confidentiality of information from aspects that can threaten information security with certain mathematical algorithms and techniques. The Luc algorithm is a public key cryptographic algorithm that was developed using the lucas function. This study aims to implement the Luc algorithm on an Android-based SMS security application in the National Narcotics Agency of Central Sulawesi Province to maintain privacy in communication between the sender and recipient of the message. This application was created using an Android studio developer with the Java programming language. Based on the results of the first test for a sample of plain messages in the word KOTA PALU that uses public key 13 produces the message cipher P=Se!CQa. The second test result for the message sample on the word KOTA PALU that uses public key 29 generates the AD*`_$(NQ cipher message

Hardware performance analysis of RSA cryptosystems on FPGA for wireless sensor nodes

In order to enhance the speed with good flexibility and physical security of design it is required to implement public key cryptographic algorithm on reconfigurable devices. The dedicated accelerators or coprocessors are combined with hardware solutions to support high-speed data cryptographic techniques in wireless sensor nodes. Two architectures are proposed (a) RSA-CIPHER128 and (b) mMMM42 to check the appropriateness for implementation in Wireless Sensor Nodes. Synthesis and simulation of VHDL code is carried out using Xilinx-ISE for the architectures. Results are obtained on different FPGA devices to compare the performance with speed and area. RSACIPHER128 multiplier gives the good execution speed. Where area is not a constraint, RSA cryptosystem with mMMM42 is appropriate for Wireless Sensor Network(WSN) nodes. Cryptosystem with mMMM42 consumes adoptable hardware in FPGA for WSN nodes. On Atrix-7 device the cryptosystem with RSA-CIPHER128 gives less area utilization and mMMM42 delivers good throughput. This trade-off between the design metrics leads to the designer to select the architecture depending on the applications. Throughput achievement with utilization of Slices(TPS) and LUTs(TPL) is analyzed to evaluate the performance of architectures.

Digital signature based on ISRSAC

Digital signature has recently played an increasingly important role in cyberspace security. Most of them are based on the public key cryptography. Public key cryptography is a mainstream cryptographic algorithm system that has been widely used in cyberspace security in recent years. The most classic public key cryptography algorithm is RSA and its difficulty is based on the large integer decomposition problem. In 2017, ISRSAC was proposed by M.Thangaval. ISRSAC has made security improvements to the RSA algorithm by increasing the complexity in factoring the value of modulus ‘n’. A digital signature algorithm based on ISRSAC algorithm was completed in this paper, and furthermore, a proxy signature algorithm based on ISRSAC and two kinds of multi-signature algorithms were presented, which include sequential multi-signature and broadcasting multi-signature.

An Experimental Study of Building Blocks of Lattice-Based NIST Post-Quantum Cryptographic Algorithms

Security of currently deployed public-key cryptography algorithms is foreseen to be vulnerable against quantum computer attacks. Hence, a community effort exists to develop post-quantum cryptography (PQC) algorithms, most notably the NIST PQC standardization competition. In this work, we have investigated how lattice-based candidate algorithms fare when implemented in hardware. To achieve this, we have assessed 12 lattice-based algorithms in order to identify their basic building blocks. We assume the algorithms will be implemented in an application-specific integrated circuit (ASIC) platform and the targeted technology is 65 nm. To estimate the characteristics of each algorithm, we have assessed the following characteristics: memory requirements, use of multipliers, and use of hashing functions. Furthermore, for these building blocks, we have collected area and power figures for all studied algorithms by making use of commercial memory compilers and standard cells. Our results reveal interesting insights about the relative importance of each building block for the overall cryptosystem, which can be used for guiding ASIC designers when selecting an algorithm or when deciding where to focus optimization efforts such that the final design respects requirements and design constraints.

Safeguarding unmanned aerial systems: an approach for identifying malicious aerial nodes

The coordination between aerial and ground nodes has enhanced the versatility and quality of the traditional networks. The application of aerial systems in mission-critical operations, as well as civilian applications, brings in the context of safeguarding unmanned aerial systems (UAS) from malicious attackers. This study discusses the threats and attacks mounted on UAS, alongside the challenges introduced by the unmanned aerial vehicle (UAV) network structure itself. A framework for safeguarding UAS against malicious attackers and recovering the rogue UAVs is proposed in the study. The proposed framework enforces a dynamic conceptual grid-based layout over the actual geographical deployment. The dynamically shuffling grid ascertains the security of transmission channels, as every time the grid is shuffled periodically or based on abnormal behaviour, the safety paradigm is reinitiated. Public key cryptographic algorithms are deployed for securing the communication links. Neural networks-based predictions are used for detecting abnormality in behavioural, statistical, and mobility patterns. Principal component analysis based on multivariate statistical analysis is used for detecting outliers in the aerial network environment. The behaviour prediction and outlier detection algorithms significantly improve the overall performance of the network and provide immunity against the intruders with reduced false positives, high accuracy, and better detection rate.

RSA Encryption and Decryption System

For communication in the wireless networking, transmission of data over network sometimes is not safe. In such case security of network is one of the essential aspect in computer networking. Cryptography is antechnique of transforming an plaindata into encrypted one, and then retransform that encrypted data back to its plain (original) form. In this we authenticate the sender to whom you want to send that data file. There are two different techniques of cryptography, symmetric key cryptography (called public-key cryptography) algorithms and asymmetric key cryptography (called public-key cryptography) algorithms. There are also various algorithms for encrypted data using either public or private key or both. This paper describes RSA algorithm which first convert our data into other form and then encrypt it using RSA public key encryption at sender side & at receiver side, first it authenticate the receiver then decrypt the data/ file and convert into original form.

Key Generation Using Generalized Pell’s Equation in Public Key Cryptography Based on the Prime Fake Modulus Principle to Image Encryption and Its Security Analysis

Abstract RSA is one among the most popular public key cryptographic algorithm for security systems. It is explored in the results that RSA is prone to factorization problem, since it is sharing common modulus and public key exponent. In this paper the concept of fake modulus and generalized Pell’s equation is used for enhancing the security of RSA. Using generalized Pell’s equation it is explored that public key exponent depends on several parameters, hence obtaining private key parameter itself is a big challenge. Fake modulus concept eliminates the distribution of common modulus, by replacing it with a prime integer, which will reduce the problem of factorization. It also emphasizes the algebraic cryptanalysis methods by exploring Fermat’s factorization, Wiener’s attack, and Trial and division attacks.