Indian Journal of Cryptography and Network Security (IJCNS)
The Indian Journal of Cryptography and Network Security (IJCNS) has ISSN 2582-9238 (online), an open-access, peer-reviewed, periodical half-yearly international journal, which is published by Lattice Science Publication (LSP) in May and November. Authors can electronically submit articles throughout the year using the Article Submission System. Authors can format their article either in (i) a single-column format or (ii) as per the journal template. The submitted articles should not have been previously published or are currently under consideration for publication elsewhere. The journal does not accept brief or short notes for publication. The editors retain the right to reject any articles that lack quality or originality without sending them for review. All articles must fall within the journal’s scope and will undergo a double-anonymized peer-review process. Authors must confirm that they have read and understood the content of their submitted article and ensure that it meets acceptable English grammar and usage standards. To help with the proofreading process, authors can use tools like Grammarly or similar applications. As an open-access journal, authors must pay an Article Processing Charge (APC) to publish their articles and retain copyright. Additionally, authors should familiarise themselves with the editorial and publishing policies of the journal.
CC-BY-NC-ND 4.0
Simplest (3,2) Threshold Secret Sharing Schemes Based on EXCLUSIVE-OR Function
This paper presents a new XOR-based secret sharing scheme designed for simplicity, efficiency, and strong security guarantees. Unlike traditional threshold schemes that rely on matrix operations and work on large data blocks, the proposed method operates on a per-byte basis, applying lightweight bytewise XOR calculations. The goal of this research is to create a minimalistic yet robust (3,2) threshold secret sharing algorithm that is practical for real-world systems with constrained computational resources. The proposed scheme divides a secret file into three independent shadow shares using a simple transformation: each share is generated as the XOR of the secret with a random byte string and a shifted version of that string. Specifically, the algorithm uses one random string and constructs the second and third shares by XOR-ing the secret with the random string and with the string shifted by one byte in opposite directions. This process is applied independently to each byte of the secret file. The resulting scheme is both perfect and ideal: each share is the same size as the original file, and no information about the secret can be obtained from a single share. Any two out of three shares are sufficient to reconstruct the original data, while fewer reveal nothing. The encoding and decoding procedures are transparent, computationally efficient, and well-suited for implementation in hardware or constrained environments. The algorithm was implemented in Fortran and can be easily integrated into secure cloud storage systems, distributed communication protocols, or embedded devices. This work contributes a lightweight alternative to existing XOR-based sharing methods, providing a novel balance between cryptographic strength and algorithmic simplicity.
Copyright (c) 2025 Sergei Kulikov (Author) https://creativecommons.org/licenses/by-nc-nd/4.0
Ring-LWE Identity-Based Encryption with Dynamic Revocation for Cloud Data Sharing
Cloud storage faces significant security and access control challenges due to reduced user oversight and the emerging threat of quantum computing to traditional cryptographic methods. Existing revocable Identity-Based Encryption (IBE) schemes are limited by their lack of postquantum security, inefficient revocation mechanisms that require re-encryption of data, and cumbersome key update procedures. We propose a post-quantum secure Ring-LWE IBE scheme with dynamic time-based revocation tailored for cloud environments. Our solution is built on the hardness of the Ring Learning with Errors (RLWE) problem to ensure quantum resistance and introduces a novel time-based revocation framework. In our approach, user access is bound to discrete periods and managed through a hierarchical binary tree structured over identities and time. This design eliminates the need to re-encrypt stored data upon user revocation. Instead, a trusted authority periodically distributes lightweight key updates exclusively to non-revoked users. Thanks to the binary tree structure, non-revoked users can compute updated decryption keys with only O (log Nₘₐₓ) overhead in both computation and communication, where Nₘₐₓ is the maximum number of users or periods. Revoked users, having no access to future updates, lose decryption capabilities. We provide formal security proofs showing the scheme’s resistance against adaptive identity and time-period-based attacks, grounded in the RLWE assumption. Overall, our scheme offers an effective combination of post-quantum security, efficient access control, and simplified key management, making it suitable for secure cloud data sharing in the quantum era.
Copyright (c) 2025 Gabriel Assamah, Alimatu Latiff Yussif, Benjamin Appiah, Regina Esi Turkson, Emmanuel Derry (Author) https://creativecommons.org/licenses/by-nc-nd/4.0
Design and Development of a Secure Data Encryption and Decryption System
In an increasingly interconnected world, the need to secure sensitive information has become paramount. This article presents the Design and development of a secure data storage system. An encryption and decryption system aimed at enhancing the confidentiality, integrity, and availability of digital data. The proposed system employs advanced cryptographic algorithms to provide robust protection against unauthorised access, data breaches, and cyberattacks. The design phase emphasises the integration of both symmetric and asymmetric encryption techniques, enabling the system to cater to a diverse range of applications, from secure file storage to encrypted communications. Key Management protocols are implemented to ensure the safe generation, distribution, and storage of encryption keys, a critical component of secure systems. The system was developed using modern programming tools and frameworks, adhering to industry standards such as AES (Advanced Encryption Standard) and RSA (Rivest-Shamir-Adleman). Extensive testing was conducted to evaluate the system’s performance, security resilience, and scalability. Results demonstrate the system’s ability to resist common attacks, including brute force and cryptanalysis, while maintaining high efficiency in data processing. This research contributes to the field of data security by providing a versatile and secure solution that can be adapted for use in industries such as finance, healthcare, and e-commerce. Future work includes integrating post-quantum cryptographic algorithms to prepare for the advent of quantum computing.
Copyright (c) 2025 Shepherd Mwaekwa Wamulume (Author) https://creativecommons.org/licenses/by-nc-nd/4.0
From Inception to Realization: NIST's Post-Quantum Cryptography Standardization
Cryptography is a term that safeguards the security of electronic banking transactions, and emails, and most importantly our country relies on cryptography for national security purposes. Post Quantum Cryptography (PQC) has a major aim of developing newer cryptographic schemes that make the cryptosystem secure against quantum computers. This is a state-of-the-art research topic, and it is encouraged by some security agencies like the National Security Agency (NSA). This paper presents a concise and up-to-date review of post-quantum cryptographic (PQC) algorithms submitted to the National Institute of Standards and Technology (NIST) for standardization. Highlighting the need for cryptographic resilience in the era of quantum computing, the study focuses on the technical evaluation of candidate algorithms, including their performance in terms of time and space efficiency. It also examines the progression of these algorithms through NIST’s multi-round selection process, highlighting key developments and implementation challenges. The paper aims to provide researchers with a clear overview of the current state of PQC standardization and the practical considerations involved in deploying secure, quantum-resistant cryptographic solutions.
Copyright (c) 2025 Renita J, Edna Elizabeth N, Suganya Annadurai (Author) https://creativecommons.org/licenses/by-nc-nd/4.0
Enhancing Home and Commercial Security: A Multi-Modal Authentication Framework for Keyless Door Lock Systems
The lock-and-key paradigm of yesteryears is vulnerable to the current scenario of more frequent cyber attacks and breaches of physical security, making the current systems ask for more innovative protection for homes and businesses. In this paper, an innovative triadic multimodal authentication framework has been proposed to have facial recognition, voicebased authentication, and number pad entry into the highly elevated security protocol for convenient usage. The current research is well-grounded within a comprehensive review of 50 peer-reviewed studies covering all the critical gaps in today's access control systems, mainly in smart environments where security demands are paramount. The architecture of the proposed system is elaborately delineated in a way that describes the seamless integration of hardware and software components into a robust and adaptable authentication mechanism. Performance evaluations show high accuracy rates in different environmental conditions, and users also give good feedback regarding the ease of use and reliability. This work provides a practical solution to the current security challenges and opens up future research directions by promoting adaptive authentication methodologies and new biometric technologies that can further enhance security in smart environments. The implications of this framework stretch far beyond the individual systems into proposing a template for security improvements in the wider scheme of smart homes and offices as connected systems.
Environmental Robustness in Biometric Systems
Copyright (c) 2025 Anand Desai, Chintan Shah, Mandar Bivalkar (Author) https://creativecommons.org/licenses/by-nc-nd/4.0
IoT Sensor-Based Convolutional Neural Network System for Concealed Weapon Detector for Security Enhancement
Security has been a major concern in our societies due to the rise in crime rate, most especially in a crowded area. Concealed weapons have been posing a significant threat to government, law enforcement, security agencies, and civilians. Existing weapons detection systems seem to be not culpable of detecting concealed weapons without the cooperation of the person being searched. There remains a need for a weapons detector that can detect and identify concealed weapons for security enhancement in Nigeria. For this purpose, computer vision methods and a deep learning approach were applied for the identification of a weapon from captured images downloaded from the internet as a prototype for the study. Recent work in deep learning and machine learning using convolutional neural networks has shown considerable progress in the areas of object detection and recognition. The CNN algorithms are trained on the collected datasets to identify and differentiate between weapons and non-weapons. We built a concealed weapon detection system prototype and conducted a series of experiments to test the system's accuracy, precision, and false positives. The models were compared by evaluating their average values of sensitivity, specificity, F1 score, accuracy, and the area under the receiver operating characteristic curve (AUC). The experimental findings clearly demonstrated that the ResNet-50 model performed better than the VGG-16 and AlexNet models in terms of sensitivity, specificity, and accuracy.
Copyright (c) 2025 Moradeke Grace Adewumi, Ese Sophia Mughele, Akinribido Comfort Tomiye, Rowland Ogunrinde, Stella Chinye Chiemeke, Olumide Sunday Adewale (Author) https://creativecommons.org/licenses/by-nc-nd/4.0
A Comprehensive Methodology for Data Compression and Decompression Utilizing Huffman Coding, LZW Compression, and Run-Length Encoding, Integrated with Data Encryption Standard (DES) and Advanced Encryption Standard (AES) for Enhanced Security
With advancements in communication technologies, transitioning from 5G to 6G systems has led to exponential data growth, requiring secure and efficient data transmission solutions. This study integrates data compression techniques—Huffman Coding, Lempel-Ziv-Welch (LZW), and Run-Length Encoding (RLE)—with symmetric encryption algorithms, AES (Advanced Encryption Standard) and DES (Data Encryption Standard). The primary goal is to enhance computational performance while ensuring data security. Using a 32-byte dataset and implementing the algorithms in Go language via Visual Studio IDE, results demonstrate the significant reduction in encryption time when combining compression and encryption. Among the AES combinations, AES with Huffman Coding showed the highest efficiency, reducing encryption time by approximately 15% compared to standalone AES. Similarly, DES paired with LZW compression achieved a 20% improvement in computational time over standalone DES. The findings emphasize that selecting the optimal combination depends on data type and user requirements, facilitating secure and efficient communication in high-bandwidth, low-latency 6G systems. This research underscores the potential of cryptography, combined with compression, to enhance data transmission efficiency without compromising security. The integration approach highlights cryptographic strength in safeguarding big data, addressing challenges in modern technologies like the Internet of Everything (IoE). These results establish a foundation for future secure communication frameworks, promoting reliable and scalable cryptographic solutions tailored for 6G and beyond
Copyright (c) 2024 Sangeen Khan (Author) https://creativecommons.org/licenses/by-nc-nd/4.0
An Analytical Approach to Understanding the Principles of Cryptography within the Kaṭapayādi System as Reflected in the Works of Nemicandra
The kaṭapayādi system is an alphabetic system of numeral notation developed in India. The purpose of this paper is to understand the ideas related to cryptography within the kaṭapayādi system, although this system was not developed to hide information. To do this, this paper studies the use of this system in the Gommaṭasāra-Jīvakāṇḍa and Trilokasāra of Nemicandra (981 CE) using an analytical approach. This paper finds that like the Caesar cipher and Vigenère cipher, the ciphertext in this system is also a substitution cipher, but unlike them, the letters of the Sanskrit alphabet substitute the digits of a number in it with no shift. This system provides multiple ways to encrypt a number. It has symmetric encryption. Correctness property is ensured in it. In it, the writer is the one who encrypts the number into ciphertext and the one who decrypts the ciphertext into number is the reader. The key in this system was not a public key, although it was publicly available.
Copyright (c) 2024 Prajna Jadhav (Author) https://creativecommons.org/licenses/by-nc-nd/4.0
Security of the Secp256k1 Elliptic Curve used in the Bitcoin Blockchain
The article delves into the intricate characteristics and security properties of the secp256k1 elliptic curve used for the generation of addresses in the Bitcoin blockchain. The Bitcoin blockchain is a decentralized digital ledger that records all transactions made with Bitcoin cryptocurrency. In this work, the secp256k1 elliptic curve and its parameters and the method of generating private and public keys using random numbers are described. While the private key allows for the signing of transactions to spend Bitcoin, the corresponding public key and address enable others to verify transactions and send funds to that specific address on the blockchain, ensuring security, authenticity, and privacy in the decentralized network. The attacks on the use of secp256k1 for generating the bitcoin addresses like the Brute force attack, twist attack, fault attacks, and side channel attacks in the implementation of the elliptic curve are discussed. By maintaining the security and integrity of secp256k1, we can ensure that cryptographic operations, such as digital signatures and key exchanges, remain uncompromised. If the curve's security were compromised, malicious users could potentially derive private keys from public keys, leading to unauthorized transactions, double-spending, or other malicious activities. The security of implementation can be enhanced by ensuring cryptographic libraries and software implementations that utilize secp256k1 undergo thorough testing and validation to ensure correct and secure operations. The important attacks on blockchain technology like the 51% attack, Sybil attack, Double-Spending attack, and Smart Contract vulnerabilities are discussed. Through a comprehensive exploration, readers will gain insights into why this particular elliptic curve was chosen for use in Bitcoin's cryptographic protocols, highlighting its role in ensuring the robustness and integrity of the blockchain ecosystem.
Copyright (c) 2024 Dr. Kannan Balasubramanian (Author) https://creativecommons.org/licenses/by-nc-nd/4.0
Cryptographic Security Approach for Biometric Verification System
This paper presents cryptography which is the science of encryption and decryption to protect fingerprint that can be transmitted from sender to receiver. This security approach (cryptography) can also be applicable to other biometric traits like face, iris, retina and palm print. The significant of this protective medium is to prevent intruders or attacker to easily perceive the presence of fingerprint images. The method that was utilized for implementation of this cryptographic security approach for fingerprint verification System was achieved through Elliptic Curve Cryptography and Hill Cipher Algorithm. An elliptic Curve Function was defined and its domain parameters were used to generate self invertible key matrix that was used for the encryption and decryption process of the biometric images (Fingerprint, Face and Ear ) The security approach was also improved by ensuring that the decryption can only be done through secret key. After decryption, fingerprint verification was done by extracting and matching distinct feature (ridges) from template fingerprint and distinct feature from input fingerprint. The result obtained from demonstration of the cryptographic approach allows end users to load fingerprint image, encrypt it at sending end. At receiver end, end user can decrypt the fingerprint image. Image enhancement was later done before authentication through extraction and matching of distinct features. This model will prevent destruction and manipulation of stored fingerprint image. Authentication can also be accomplished through biological traits instead of use of password that can be stolen or transferred to relative.
Copyright (c) 2024 Akinribido C.T, Olabode O.O, Adetunmbi O.A, Adewumi Moradeke. Grace (Author) https://creativecommons.org/licenses/by-nc-nd/4.0
Software Support for Arbitrary Precision Arithmetic in Programming Languages
Arbitrary precision arithmetic, also known as bignum arithmetic, is a computational technique that allows programmers to perform arithmetic operations on numbers with significantly higher precision and magnitude than what is typically supported by the built-in numerical data types in programming languages. This technique is especially useful when working with extremely large or extremely precise numbers, such as in cryptography or scientific computations. Arbitrary precision arithmetic has many applications in the areas of Cryptography, Numerical Computation, Statistical Analysis, and High Precision measurements. For example, the calculation of the modulus in the RSA algorithm involves numbers with 1024-bit numbers and higher. An arithmetic calculation involving Multiplication and exponentiation of such numbers using Modulo arithmetic cannot be easily carried out in the existing programming Languages unless special software is provided. We can calculate the mathematical constant Pi to many thousand decimal places using the support provided in Programming Languages. Many programming languages provide built-in support for libraries for arbitrary precision arithmetic. We discuss the support provided in C/C++, Java and Python Languages with examples. Besides Programming Languages, Toolkits like Matlab and Sagemath also are used for scientific computation and special software support provided in these toolkits can enable arbitrary precision arithmetic. Most Programming Languages have support for floating-point arithmetic. We also discuss how arbitrary precision floating point arithmetic. can be supported in C/C++, Java, and Python. In addition, we discuss support for arbitrary precision integer arithmetic in Ruby, Javascript and Matlab and support for arbitrary precision floating point arithmetic in the Perl Language. Finally, we provide an example of computing the constant Pi to many decimal places using the sagemath tool.
Blockchain Technology In Healthcare Services
The recent ransomware attack on AIIMS (All India Institute of Medical Sciences) has highlighted internal system weaknesses in the healthcare sector, and blockchain technology has emerged as a potential solution to improve security and reduce the risk of future attacks. The decentralized blockchain technology makes it much more difficult for ransomware attackers to focus on a single point of failure. Additionally, blockchain technology provides recipients and data providers with the reassurance that their data has not been changed, enabling enterprises to have confidence and assurance in the integrity of their sensitive data. The sharing of data also restores control of data to its owners. The information is dispersed so that no one company can control it, yet it is still organized around the owner. Thamrin and Xu’s research paper proposes a framework for healthcare data storage that includes hospital, city, and state blockchain networks. The proposed system uses a private cloud, but the researchers recommend a hybrid cloud for improved efficiency and adaptability. This innovative approach has the potential to enhance healthcare systems’ data security, privacy, and accountability. However, a comprehensive analysis of the problem and an assessment of the potential effectiveness of blockchain technology is necessary before implementing any solutions.
Copyright (c) 2024 Adesh Mukati (Author) https://creativecommons.org/licenses/by-nc-nd/4.0
Methodologies for Predicting Cybersecurity Incidents
Data science may be used to detect, prevent, and address ever-evolving cybersecurity risks. CSDS is a fast developing field. When it comes to cybersecurity, CSDS emphasises the use of data, concentrates on generating warnings that are specific to a particular threat and uses inferential methods to categorise user behaviour in the process of attempting to enhance cybersecurity operations. Data science is at the heart of recent developments in cybersecurity technology and operations. Automation and intelligence in security systems are only possible through the extraction of patterns and insights from cybersecurity data, as well as the creation of data-driven models that reflect those patterns and insights An attempt is made in this work to describe the various data-driven research approaches with a focus on security. In accordance with the phases of the technique, each work that anticipates cyber-incidents is thoroughly investigated to create an automated and intelligent security system.
Copyright (c) 2024 Yaser M.A. Abualkas, D. Lalitha Bhaskari (Author) https://creativecommons.org/licenses/by-nc-nd/4.0
The Role of Data Leakage Prevention System in CBDC
A centralized database-based Central Bank Digital Currency (CBDC) system’s vulnerability to cyberattacks and data leakage is a major concern. Any data leak can lead to large financial losses, irreversible reputational harm, and a decline in user confidence. To protect user information, the Reserve Bank of India has underlined the significance of a strong Data Leakage Prevention (DLP) system. While current incidents have demonstrated that the measures were insufficient to meet the standards, DLP may not be enough to defend CBDCs on its own. Incorporating Zero-Knowledge Proofs (ZKPs) and differential privacy tools into DLP solutions can improve their robustness and effectiveness. There is no one-size-fits-all solution for preventing data leakage, different solutions may be more effective in different scenarios. It’s always a good idea to assess an organization’s or system’s specific needs and requirements before deciding on the best solution. It is also important to remember that there is no such thing as absolute security, and the possibility of zero-day attacks is always there. It is essential to continuously monitor and enhance security measures to stay ahead of new threats. To preserve their Central Bank Digital Currency systems and data, financial institutions and central banks must continue to be proactive and vigilant.
Copyright (c) 2024 Adesh Mukati, Dr. Satya Prakash (Author) https://creativecommons.org/licenses/by-nc-nd/4.0
An Improved RSA Algorithm for Enhanced Security
The security of the Rivest-Shamir-Adelman (RSA) public key algorithm depends on the difficulty of factoring the modulus calculated by multiplying two large prime numbers. The usefulness of the RSA public key algorithm lies in using one key for encryption and another key for decryption. However, a poor choice of the keys used in encryption and decryption can affect the security of the RSA cryptosystem. Many proposals have been made to modify the RSA cryptosystem in such a way that the attacks on the RSA cryptosystem can be overcome. In this article, we propose concealing the publicly disclosed parameters, the encryption key and the common modulus of the RSA cryptosystem by altering the values sent publicly. The values sent publicly are different from the one used in the algorithm which conceals the actual parameters to others. The implementation of this idea uses two different algorithms and randomly choosing between the algorithms. The choice of the algorithm is done using a random number generator and this choice of the algorithm has to be communicated so the decrypt or uses the correct algorithm to decrypt the encrypted data. Finally we explore a faster way to implement the modular exponentiation algorithm used in the RSA encryption and decryption.
Copyright (c) 2024 Dr. Kannan Balasubramanian, M. Arun, Dr. K. R. Sekar (Author) https://creativecommons.org/licenses/by-nc-nd/4.0
Reliability of Trust Management Systems in Cloud Computing
Cloud computing is an innovation that conveys administrations like programming, stage, and framework over the web. This computing structure is wide spread and dynamic, which chips away at the compensation per-utilize model and supports virtualization. Distributed computing is expanding quickly among purchasers and has many organizations that offer types of assistance through the web. It gives an adaptable and on-request administration yet at the same time has different security dangers. Its dynamic nature makes it tweaked according to client and supplier’s necessities, subsequently making it an outstanding benefit of distributed computing. However, then again, this additionally makes trust issues and or issues like security, protection, personality, and legitimacy. In this way, the huge test in the cloud climate is selecting a perfect organization. For this, the trust component assumes a critical part, in view of the assessment of QoS and Feedback rating. Nonetheless, different difficulties are as yet present in the trust the board framework for observing and assessing the QoS. This paper talks about the current obstructions present in the trust framework. The objective of this paper is to audit the available trust models. The issues like insufficient trust between the supplier and client have made issues in information sharing likewise tended to here. Besides, it lays the limits and their enhancements to help specialists who mean to investigate this point.
Copyright (c) 2024 Ms. Pooja Goyal, Dr. Sukhvinder Singh Deora (Author) https://creativecommons.org/licenses/by-nc-nd/4.0
In this project, we are planning to create a strong robust calculation for executing cash in higher level security reason with high acknowledgment rates in a shifting environment. To begin with, Haar cascade based calculation has been connected for quick and basic confront location from the input picture. The confront picture is at that point being changed over into grayscale picture. After that, the iris, eyebrows, nose, mouth of candidates are extricated from the escalated valleys from the recognized confront.
Copyright (c) 2024 Abhishek Balamurugan, Sai Dhanush. R,, Sundeep. J, Sivasankari. K (Author) https://creativecommons.org/licenses/by-nc-nd/4.0
A Network Intrusion Detection System Based on Categorical Boosting Technique using NSL-KDD
Massive volumes of network traffic & data are generated by common technology including the Internet of Things, cloud computing & social networking. Intrusion Detection Systems are therefore required to track the network which dynamically analyses incoming traffic. The purpose of the IDS is to carry out attacks inspection or provide security management with desirable help along with intrusion data. To date, several approaches to intrusion detection have been suggested to anticipate network malicious traffic. The NSL-KDD dataset is being applied in the paper to test intrusion detection machine learning algorithms. We research the potential viability of ELM by evaluating the advantages and disadvantages of ELM. In the preceding part on this issue, we noted that ELM does not degrade the generalisation potential in the expectation sense by selecting the activation function correctly. In this paper, we initiate a separate analysis & demonstrate that the randomness of ELM often contributes to some negative effects. For this reason, we have employed a new technique of machine learning for overcoming the problems of ELM by using the Categorical Boosting technique (CAT Boost).
Copyright (c) 2024 Shiladitya Raj, Megha Jain, Dr. Pradeep Chouksey (Author) https://creativecommons.org/licenses/by-nc-nd/4.0
Cryptography is a key element in establishing trust and enabling services in the digital world. It is represented in a ways that are not accessible to human users. Hence, humans are left out the trust and security in the digital world. Cryptography is necessary in modern communication protocols and to many digital services. A primitive or protocol should be defined to reach the security goal. Beside the introduction part this paper represents the types of cryptography, algorithm of cryptography and techniques of cryptography and the interaction between Government and cryptography.
Copyright (c) 2024 Dr. Harjinder Kaur, Prof. Amandeep Kaur (Author) https://creativecommons.org/licenses/by-nc-nd/4.0