Concept Of Cryptography Research Articles

New Proxy Signature Scheme over Elliptic Curves using Chaotic Maps Applicable during Pandemic COVID-19

Abstract: Digitalization has attracted the world to collect increasing data. Background: Proxy signature is a digital alternative for signing documents in the absence of the original signer. Methods: In this paper, we have used the mathematical methods and concepts of Chaotic maps (CMs) and elliptic curve cryptography. Results: We have proposed a new proxy signature scheme (PSS). Security of our PSS relies on "elliptic curve discrete logarithm (ECDL) and integer factorization (FAC) problems". It requires only low-complexity computation, which increases efficiency. Conclusion: It is the first PSS in such a security setting and can also be assumed to be secure in the post-quantum cryptographic world. It can be highly used digitally during thePandemic conditions like COVID-19.

An Approach for Cipher Communication Utilizing the Concepts of Elliptic Curve Cryptography

Message encryption is a process of protection of the original data in transmission. Several cryptosystems were designed in the history for different environments. Public key or Asymmetric cryptosystem has become more popular in recent era where the key space consists both public and private keys. Elliptic curve cryptography dominates public key cryptosystems like Diffie Hellman key exchange and RSA. ECC is more powerful and alternative technique of RSA, with a simple replacement of exponent calculations of large prime numbers to mathematical representation of Elliptic curve points. Besides the computation ECC works with shorter key length than RSA. The present paper describes an encryption algorithm using elliptic curves over finite fields. Here a group of authentic users transmit.

A designated private set based trapdoor authentication scheme for privacy preserving trust management in decentralized systems

Authentication is crucial for network system security, relying on methods such as passwords, ID cards, biometrics, and behavioral characteristics. The conventional centralized authentication may lead to potential performance bottlenecks and privacy risks such as key exposure, single point of failure. Decentralized authentication systems using cryptographic techniques aim to address these issues but often tradeoff between flexibility and communication efficiency. In this paper we propose a new cryptographic concept called designated private set-based trapdoor authentication (DPSBTA) for flexible and efficient trust management in decentralized systems. DPSBTA eliminates the need for a trusted authority, with users’ access privileges defined by their private sets. During the authentication process, each server can designate an element set and only if a user holds adequate elements which are contained in the designated set can he obtains a credential from the server. The key features of DPSBTA include: decentralized trapdoor authentication management, without a trusted authority, conducted in a double threshold manner; privacy preservation, as servers do not know users’ element holdings or credential generation; round-optimal communication, with only two rounds of interaction between users and servers. We present the generic construction, security models, and concrete algorithms with correctness proof. The theoretical proof and the performance evaluations demonstrate the tangible security and high efficacy of the proposed DPSBTA.

A Novel Authenticated Quantum Anonymous Secret Sharing for Classical and Quantum Information

AbstractAnonymous secret sharing (ASS) is an essential cryptographic concept that facilitates the sharing and reconstruction of secret information while safeguarding the identity of the involved secret receivers, which has broad applications in key management, data backup, and distributed systems. In this study, a novel authenticated quantum anonymous secret sharing (QASS) protocol that emphasizes information privacy and identity anonymity protection is proposed. Employing ‐level multipartite GHZ states as a quantum resource, one‐sided anonymous entanglement (AE) is innovatively established between the dealer and anonymous receivers, enabling the dealer to distribute a random share of secret information. Additionally, by establishing a one‐sided AE between anonymous receivers and restorer, the restorer can securely collect and reconstruct the secret information using quantum teleportation (QT). Rigorous security analysis demonstrates that protocol can resist attacks from active adversaries and potentially dishonest users. Quantum experiments on IBM Qiskit validate the correctness and feasibility of the proposed QASS protocol. This work contributes to the advancement of quantum anonymous communication, addressing the requirements for information privacy and identity anonymity in practical application environments.

Secure Patient Data Monitoring and Efficient Routing Optimization using a Hyperelliptic Curve Cryptography with Fuzzy-based Priority in WBSN

Aims and Background: Wireless Body Sensor Network (WBSN) technology is one of the major research areas in the medical and entertainment industries. A wireless sensor network (WSN) is a dense sensor network that senses environmental conditions, processes, and outgoing data at the sink node. A WBSN develops patient monitoring systems that provide the flexibility and mobility needed to monitor patient health. In data communications, it is difficult to find flexible optical routing paths, switching capabilities, and packet processing in the composition of optical networks. Information-centric networks (ICNs) are a new network model and are different from information- centric models. The priority of the information-centric model is the communication network. Objectives: In the existing literature, such methods are typically developed using computationally expensive procedures, such as bilinear pairing, elliptic curve operations, etc., which are unsuitable for biomedical devices with limited resources. Using the concept of hyperelliptic curve cryptography (HECC), we propose a new solution: a smart card-based two-factor mutual authentication scheme. In this new scheme, HECC’s finest properties, such as compact parameters and key sizes, are utilized to enhance the real-time performance of an IoT-based TMIS system. Methodology: A fuzzy–based Priority Aware Data Sharing (FPADS) method is introduced to schedule the priority data and monitor the transmission length. The child node adjusts the transmission speed of the cluster head with the help of a fuzzy logic controller (FLC). Results: The proposed model estimated the traffic load of the child node and the priority of the different amounts of data to be transmitted. The principle of scheduling data packets to be developed is based on the precedence of the data with the lowest transmit length in the network. Conclusion: The proposed FPADS performance increases in terms of scheduling time utilisation, traffic distribution, and mean delay. Simulations have been done using NS2, and the outcomes have shown that the proposed methodology is efficient and improves the overall QoS of the system.

Implementation of Least Significant Bit Steganography to Secure Text Messages in Images

Steganography is a technique of securing secret messages in other messages that are not known. Simulation of the steganography method using the Least Significant Bit technique is used to change the last bit in one byte of data by using a text message as the container medium. This study aims to implement the security of text messages in images using the Least Significant Bit technique which is supported by the steganography method. Simulation techniques are used to conduct studies using Cryptool2 which can describe the concept of cryptography. The results obtained from this study regarding the security of text message insertion into an image in *.jpg and *.png format with 5 sampling trials are (1) the encrypted image cannot be distinguished directly through human eyes, (2) there is an increase in file size the image after being encrypted with an average for five trials is 0.31%, this increase depends on the length of the text message and a key to be inserted, the longer the insertion, the larger the resulting file size, (3) The higher the resolution of the image where the description encryption is inserted, the longer the process required, (4) The simulation time of steganographic decryption is faster than steganographic encryption. The decryption simulation process is the same as 50% of the encryption process.

APLIKASI PENGAMANAN DATA METODE RIVEST SHAMIR ADLEMEN DAN ADVANCE ENCRYPTION STANDARD (STUDI KASUS PT. BESS FINANCE CABANG TALAGA KAB. MAJALENGKA)

The rapid development of information technology has made news a basic need for everyone. Information is also important for a company. because information can help a company to continue to grow in world competition. Problems that occur in the data security process at the company if there is damage and loss of data on a computer or laptop, the company's data will be threatened if there is no data backup on company data and will cause big losses for the company. One way to secure data or information from damage and loss on computers and laptops is to use the concept of cryptography. After testing, if there is damage to the computer, the administrator can make it easier to secure important company data and the system can successfully encrypt and decrypt and back up important files using the Rivest Shamir Adleman Method and Advance Encryption Standard and the results are in accordance with what is needed, the system can manage the data files you want to save. secure it well.

Data Security and Cryptography Substitution Techniques Algorithms implementation

Cryptography and data security have been usedto make data more secure for many years, militarycommunications are having a major impact on growingcryptography field. Although the internet have been invitedin the ends 1960's, but it is not appear to public until inventthe World Wide Web (www) in 1989. The World Wide Weballows people to e-mail each other and transfer data. Thisappeared as one reason in growing use of computer. Inaddition needs to make e-commerce more secure.Cryptography understanding helps to find better ways orprotocols to make transfer data faster and more efficient.This paper starts with a brief background about securityand cryptography. It provides central concepts ofcryptography. Also provides an account of substitutiontechniques algorithms and their implementation. Theimplementation will be as an application in c# language thatreads a text, encodes it by a specified algorithm and decodesthe encrypted text. In addition explaining the mathematicalfunctions used in the algorithms

Combination Concept of LSB and PlayFair Cipher for Optimizing Data Security

Data security is now something that is very necessary, with the aim of ensuring that important data and information does not fall into the hands of unauthorized people. The widespread data exchange process provides opportunities for unauthorized parties to take, copy or steal the exchanged data. This is what triggers the importance of securing data when exchange occurs. In the field of computer science, there are many ways that data can be secured. These methods include the concepts of steganography and cryptography. Steganography is a way to hide data in various media, while cryptography is a way to encode data into a form that has no meaning. This research aims to design a system to secure messages in the form of text data using the Playfair cipher cryptography method and Least Significant Bit (LSB) steganography using image media and the image containing the message is not visible to the eye that the image contains a secret message

Polar code-based secure transmission with higher message rate combining channel entropy and computational entropy

The existing physical layer security schemes, which are based on the key generation model and the wire-tap channel model, achieve security by utilizing channel reciprocity entropy and noise entropy, respectively. In contrast, we propose a novel secure transmission framework that combines noise entropy with reciprocity entropy, achieved by inserting reciprocity entropy into the frozen bits of polar codes. Note that in real-world scenarios, when eavesdroppers employ polynomial-time attacks, the bit error rate (BER) increases due to the introduction of computational entropy. To achieve indistinguishability security, we convert the practical physical layer security metric, BER, into the average min-entropy, a widely accepted concept in cryptography. The simulation results demonstrate that the eavesdropper’s BER can be significantly increased without compromising the communication performance of the legitimate receiver. Under concrete parameters we selected, when compared to the joint scheme of physical layer key generation and one time pad, the modular semantically-secure scheme based on the wire-tap channel model, and the simple channel entropy combination scheme, our scheme achieves a message rate approximately 1.2 times, 3.8 times, and 1.4 times better, respectively. Experimental testing validates the feasibility of our scheme.

Evaluating GPT-4’s proficiency in addressing cryptography examinations

In the rapidly advancing domain of artificial intelligence, ChatGPT, powered by the GPT-4 model, has emerged as a state-of-the-art interactive agent, exhibiting substantial capabilities across various domains. This paper aims to assess the efficacy of GPT-4 in addressing and solving problems found within cryptographic examinations. We devised a multi-faceted methodology, presenting the model with a series of cryptographic questions of varying complexities derived from real academic examinations. Our evaluation encompasses both classical and modern cryptographic challenges, focusing on the model’s ability to understand, interpret, and generate correct solutions while discerning its limitations. The model was challenged with a spectrum of cryptographic tasks, earning 202 out of 208 points by solving fundamental queries inspired by an oral exam, 80.5 out of 90 points on a written Crypto 1 exam, and 287 out of 385 points on advanced exercises from the Crypto 2 course. The results demonstrate that while GPT-4 shows significant promise in grasping fundamental cryptographic concepts and techniques, certain intricate problems necessitate domain-specific knowledge that may sometimes lie beyond the model’s general training. Insights from this study can provide educators, researchers, and examiners with a deeper understanding of how cutting-edge AI models can be both an asset and a potential concern in academic settings related to cryptology. To enhance the clarity and coherence of our work, we utilized ChatGPT-4 to help us in formulating sentences in this paper.

Blockchain technology in pharmaceutical supply chain : Ensuring transparency, traceability, and security

Transparency, traceability, and security are three major challenges that blockchain technology has addressed in the pharmaceutical supply chain, making it a disruptive solution. The incorporation of blockchain technology to produce an immutable, decentralized ledger that documents the full path taken by pharmaceutical products from producer to end-user is examined in this abstract. The solution ensures tamper-resistant records by utilizing smart contracts and cryptography concepts, hence mitigating the risk of counterfeit medications. Transparency is improved via real-time supply chain visibility, which gives stakeholders the ability to monitor batch information and confirm product authenticity. Blockchain’s decentralized structure improves security by reducing the possibility of fraud and unauthorized access. By means of blockchain implementation, the pharmaceutical business may create a strong, dependable, and effective supply chain ecosystem, thereby promoting safer and more dependable medicine access for patients across the globe.

Logistic regression-based side-channel analysis attacks

Advanced Encryption Standard (AES) is a modern concept in cryptography. Most of modern encryption schemes and devises are built based on this standard. Those encryption systems have really high resistance to most of modern attacking methods. However, this passage will introduce the most powerful way of attacking: Side-Channel Analysis (SCA). By performing such attacking by artificial intelligence model, it shows that they can break the encryption system in a very efficient and effective way. By using ASCAD database, this passage analysis some properties when using logistic regression to perform Side-Channel-Attack on the traces of the encryption system. Since in the original article, the authors only analysis the performance of multilayer perceptron (MLP) and convolution neural network (CNN), this passage aims to apply similar methodology to logistic regression and analyse its performance in different circumstances. Moreover, some interesting properties about logistic regression was found, and it can sometimes perform better than systems in the original passage in certain situation.

Secure Arcade: A Gamified Defense Against Cyber Attacks

In modernity, we continually receive increasingly intricate technologies that allow us to increase our lives’ convenience and efficiency. Our technology, particularly technology available over the internet, is advancing at unprecedented speed. However, this speed of advancement allows those behind malicious attacks to have an increasingly easier time taking advantage of those who know little about computer security. Unfortunately, education in the computer security field is generally limited only to tertiary education. This research addresses this problem through a gamified web-based application that drives users to reach learning goals to help them become more vigilant internet users: 1. Learn and memorize general computer security terminology, 2. Become familiar with basic cryptography concepts, 3. Learn to recognize potential phishing scams via email quickly, and 4. Learn common attacks on servers and how to deal with them.

The Asymmetric five-card trick: working with variable encoding in card-based protocols

Recently, card-based protocols have been extensively explored to illustrate relatively complex cryptographic concepts, such as Secure Multiparty Computations, so that even non-specialists can understand them. These protocols rely on three elements: a given alphabet with a set number of physical cards, encoding those cards, and shuffling operations. However, the execution is becoming over-complicated, as most follow the same encoding: fixed uniform disclosed encoding, which constrains other elements and decreases their expressiveness. This paper introduces the asymmetric five-card trick, a generalization of the five-card trick (a seminal work in the field of card-based cryptography) with the added feature of allowing variable encoding. To do so, we propose a pre-process called “handshake” that allows protocols to adapt operations based on players’ encoding. The protocol handshake is included as part of the protocol’s production phase in the proposed general framework, which is negotiated before its execution. Finally, this paper also introduces the notion of time and space complexity in card-based protocols to assess their production and execution’s lower bounds.

Securing Internet of Things (IoT) Ecosystems: A Quantum Cryptography Approach

In order to strengthen the stability of IoT ecosystems, this study explores the interface between Internet of Things (IoT) security and quantum cryptography. Our study goals included assessing the applicability of quantum key distribution, correcting flaws, and investigating the influence of environmental variables on security. We reveal fascinating insights through experimental research that alter IoT security paradigms. A comparison of the typical key setup durations and data transmission rates across various IoT devices and communication protocols shows how effective quantum cryptography is in speeding up key distribution. This effectiveness fits the changing environment of secure communication technologies. Our vulnerability evaluation also shows that quantum key distribution is a potent defense against weaknesses like man-in-the-middle and replay assaults. It is made clear how contextual factors and security interact, emphasizing the importance of adaptable security measures in line with environmental circumstances. We present a comprehensive methodology that balances security with deployment circumstances by merging this contextual sensitivity with quantum cryptography concepts. Our research points to prospective directions for joint investigation between quantum physicists and IoT developers to close the gap between theoretical promise and actual use. Comprehensive insights will be obtained by scaling the use of quantum cryptography to larger IoT networks and other circumstances, but caution is needed to survive the upcoming quantum computing era. The study's conclusion ignites a paradigm change and pushes the quantum revolution into IoT security. Our research promotes more investigation, innovation, and application as we stand on the brink of a new era, protecting IoT ecosystems in a quantum-secure embrace.

A Secure Method of Communication in Conventional Cryptography using Quantum Key Distribution

Security knowledge is one of the foremost challenges in the present day. When the topic is about Information security, the concept of cryptography comes into the picture. Every day, people and organizations use cryptography to maintain the confidentiality of their communications and data as well as to preserve their privacy. Today, one of the most successful methods used by businesses to protect their storage systems, whether at rest or in transit, is cryptography. Yet, cryptography is an effective technique to secure the data, the modern technology can break the cryptographic techniques. But some data encryption algorithms are several times stronger than today's conventional cryptography and can be constructed using quantum computing. They are "Quantum Cryptographic Algorithms ". Quantum cryptography uses the rules of quantum physics instead of classical encryption, which is based on mathematics, to protect and transmit data in a way that cannot be intercepted. Quantum key distribution is the greatest illustration of quantum cryptography and offers a safe solution to the key exchange issue. The proposed work deals with quantum cryptography and mainly focuses on how the quantum cryptographic algorithm is more secure than traditional cryptography.

System for Medical Record Department (MRD) using Blockchain

This paper is developed by overcome the upcoming troubling situation for implement a project here we briefly describe a design of project and how it construction done. The system is fundamentally made for govt dental hospitals to store their patients data with security ,backup and user-friendly interface. Initially the system for medical record using blockchain is take some information from user which is medical employee for authentication and take access to store and handle patient data which have some essential details about patient including category and according to their category bifurgate a patients to pay a medical service fees. For eg. senior citizen, prisoner's BPL holders no medical fees for them. While thinking about security we have to put a concept of cryptography in blockchain according to that the data is encrypted and decrypted with generating a secrete common key because of secrete key the conversation between two sites is private and it also retrieving a data is possible

Combined image encryption and steganography technique for enhanced security using multiple chaotic maps

This paper proposes a novel security algorithm which combines the concepts of Cryptography and Steganography to provide enhanced security to digital images. The proposed algorithm, named CIEST, enciphers the secret image (cryptography) which is hidden into the cover image (steganography) for secured transfer of information. A two-stage encryption process, with one of the stages being DNA encoding is used here. The cover image is also modified before the data embedding phase to improve the effectiveness of the algorithm. Multiple Combined Chaotic maps are utilised in the encryption and embedding stages to improve the randomness of the algorithm. The use of chaotic maps also makes the algorithm more robust to different types of attacks. The CIEST scheme is shown to be robust, offering high embedding capacity with high sensitivity with a near zero correlation value, information entropy value of 7.9972, maximum SSIM of 0.9992, and a maximum PSNR of 56.1071. The experimental results presented establish the immunity of the proposed method against attacks along with the feasibility and effectiveness of the algorithm in real time.

Image encryption based on 2DNA encoding and chaotic 2D logistic map

DNA has recently been investigated as a possible medium concerning ultra-compact information storage and ultra-scale computation. The development of secure image encryption systems has recently received a certain effective and new direction from chaos-based cryptographic algorithms. This paper proposes a novel image encryption algorithm, 2DNALM, based on double-dynamic DNA sequence encryption and a chaotic 2D logistic map. The three phases regarding the suggested approach are as follows: the first phase involves permuting the positions of the pixels using a position key-based scrambling operation. The second phase involves double DNA encoding on scrambled images using various rules by DNA cryptography concept to produce an encoded image, and in the final step, an image which has been encoded is encrypted using XOR operation and chaotic keys created through a chaotic 2D logistic map. The entropy analysis and experimental findings show that the suggested scheme exhibits great encryption and withstands several common attacks.