Post-Quantum AI: Building Secure Machine Learning Systems in the Quantum Era | Book Publisher International

 

This book explores the intersection of artificial intelligence (AI) and quantum computing, focusing on the urgent need to secure machine learning systems in the face of emerging quantum threats. As quantum computers advance, they expose vulnerabilities in classical cryptographic methods, potentially undermining data integrity, privacy, and trust in AI-driven applications. To address these challenges, this study introduces the concept of post-quantum AI—a framework for integrating quantum-resistant cryptographic algorithms, Anomaly detection mechanisms, and Resilient machine learning architectures. This book makes three core contributions: it motivates a quantum-era threat model for machine learning (ii) it maps a migration path to standardised post-quantum cryptography Crypto-agile architectures (iii) it presents a defence-in-depth blueprint across the data → training → inference lifecycle that integrates privacy-preserving learning Governance. This work explicitly highlights key contributions, including proposed frameworks, algorithms, and case studies. Future research directions are also outlined to guide continued exploration in this emergent field. The final candidate algorithms from the NIST PQC standardisation process (NIST, 2022–2023) further strengthen this discussion.

 

Key themes include the foundations of quantum mechanics relevant to computation, the fundamental differences between classical and quantum computing, and the transformative potential of quantum algorithms for optimisation, pattern recognition, and predictive analytics. The book highlights case studies spanning drug discovery, finance, mobile networks, and supply chain optimisation, illustrating how quantum-enhanced AI can revolutionise industry while simultaneously raising complex security and ethical concerns.

 

A central focus is the development and deployment of post-quantum cryptography (PQC)), such as lattice-based and hash-based algorithms, to safeguard AI models against adversarial and quantum-accelerated attacks. The discussion extends to adversarial machine learning, explainable AI (XAI), and hybrid classical–quantum systems as strategies for strengthening resilience.

 

The ethical, legal, and regulatory dimensions of post-quantum AI are also examined, emphasising fairness, transparency, accountability, and international cooperation. By combining technical innovations with responsible governance, the book advocates for building trustworthy AI systems that remain robust in the quantum era. Future work includes post-quantum cryptography (PQC) performance benchmarking in ML pipelines Patterns for crypto-agile key management, Assurance methods for privacy-preserving Federated learning as standards, and Implementations that are mature.

 

Author(s) Details

Amit Taneja
Vellore Institute of Technology, Tamil Nadu, India.

 

Please see the book here :- https://doi.org/10.9734/bpi/mono/978-93-88417-99-0

Enhancing Data Security in Telemedicine IoT Applications through Hybrid Cryptography | Chapter 2 | Current Research Progress in Physical Science Vol. 3

 

IoT is a network of physical things or objects that are integrated with sensors, software, electronics, and network connectivity. By 2030, the total number of IoT devices is expected to reach 75.4 billion. With the aid of various medical sensors, a remote patient monitoring system will be designed for Internet of Things (IoT)-based telemedicine applications. With the aid of AI algorithms, the healthcare sensor data will eventually be identified and forecasted. In the current healthcare sector, a lot of sensitive data is exchanged. The integration of an increasing number of digital technologies in hospitals, together with laboratory and outpatient examinations of patients and their accompanying files, have all contributed to the growth of data related to patient care in recent years. Electronic health record systems are medical management systems that include all of a patient’s personal and medical data. As a consequence, this data must be stored and secured in the cloud. This paper describes a data storage and security solution that is well-suited for the Internet of Medical Things. The proposed model consists of a security framework for IoT-based telemedicine applications. Because of the shorter key length, the improved Elliptic Curve Cryptography (ECC) approach using Blake2 hashing takes substantially less time to encrypt. The data is encrypted with the created key and the Advanced Encrypted Standard (AES). The proposed security approach is a hybrid cryptography technique that combines symmetric and asymmetric key encryption, resulting in a more secure system.

 

Author(s) Details

Arasada Subashini
Department of Electronics, Gayatri Vidya Parishad for Degree and P.G Courses (A), Visakhapatnam, 530007, India.

K. Nataraju
Department of Electronics, Gayatri Vidya Parishad for Degree and P.G Courses (A), Visakhapatnam, 530007, India.

 

Please see the book here:- https://doi.org/10.9734/bpi/crpps/v3/200

Comparative Analysis of Symmetric Cryptographic Algorithms for Varying Text File Sizes | Chapter 6 | Mathematics and Computer Science: Contemporary Developments Vol. 4

 

This research aims to investigate five different symmetric algorithms: AES, DES, 3DES, Rijndael, and RC2. The primary objective is to identify the most suitable algorithm for encrypting text files of varying sizes and to promote a positive cryptographic culture for text file security.

 

Each algorithm is evaluated based on its performance in encrypting and decrypting text files of different sizes, specifically 10 KB, 20 KB, 50 KB, 1 MB, 2 MB, and 5 MB. The study focuses on measuring the time duration each algorithm requires for these processes. While numerous encryption algorithms can secure computerized information across different organizations, the time efficiency of each algorithm varies with the size of the text file. Some algorithms perform optimally for small files, while others are more suitable for larger files.

 

In this study, five symmetric algorithms are integrated into a single program using object-oriented programming concepts such as classes and inheritance. The program automatically selects the appropriate encryption algorithm based on the size of the text file to be encrypted. The file size remains stable before and after encryption, ensuring the same process is applied during decryption. The encryption and decryption code is developed using Visual Studio 2013, and the results are analyzed using the R programming language.

 

The encrypted text, or ciphertext, is represented in UTF-8 format, where "UTF-8" stands for Unicode Transformation Format, with "8" indicating that each character is represented by 8 bits. The file sizes are measured in kilobytes (KB). The performance analysis prioritizes smaller text files and arranges the algorithms in ascending order of their suitability: AES, 3DES, DES, RC2, and Rijndael. AES is found to be most effective for small text files, while Rijndael is more suitable for larger text files.

 

Author (s) Details

Allajabu Dafalla Khamis
College of Computer and Information Science, Faculty of Graduate Studies, Alzaem Alazhari University, Khartoum, Sudan.

 

Saad Subair
College of Computer Studies, International University of Africa, Khartoum, Sudan.

 

Please see the book here:- https://doi.org/10.9734/bpi/mcscd/v4/1704

RSA Public Key Cryptography Encryption and Decryption Technique Involving Pythagorean Prime Numbers | Chapter 14 | Explorations in Diophantine Equations

 In this communication, we have attempted to apply the idea of encryption and decryption using RSA public key cryptography in number theory to the problem of Pythagorean Prime.

Author(s) Details:

G. Janaki,
PG & Research Department of Mathematics, Cauvery College for Women (Autonomous), Tiruchirappalli – 620 018, Tamil Nadu, India.

P. Sangeetha,
PG & Research Department of Mathematics, Cauvery College for Women (Autonomous), Tiruchirappalli – 620 018, Tamil Nadu, India.

Please see the link here: https://stm.bookpi.org/EDE/article/view/12441

Encryption and Decryption Algorithm Using Balancing Numbers | Chapter 13 | Explorations in Diophantine Equations

 Cryptography is an interdisciplinary discipline with major practical applications. The complexity of particular mathematical computation tasks influences the security of a public-key cryptosystem. In this article, we introduced a new square matrix Q1,2  Q1,3 and Q1,4 whose elements are first three k-balancing numbers and developed new encryption and decryption procedures followed from Q1,m for m=2, 3 and 4. Since the transmission of sensitive information has become a more serious problem in recent years, encryption and decryption techniques have become essential in strengthening information security.

Author(s) Details:

G. Janaki,
PG & Research Department of Mathematics, Cauvery College for Women (Autonomous), Tiruchirappalli – 620 018, Tamil Nadu, India.

A. Gowri Shankari,
PG & Research Department of Mathematics, Cauvery College for Women (Autonomous), Tiruchirappalli – 620 018, Tamil Nadu, India.

Please see the link here: https://stm.bookpi.org/EDE/article/view/12440

A Cryptographic Algorithm Based on Large Gaussian Primes and Primes | Chapter 5 | Research Highlights in Mathematics and Computer Science Vol. 2

 This work presents a systematize and decoding technique engaging large prime numbers in Gaussian integers, that will provide great freedom.

Author(s) Details:

G. Janaki,
PG and Research Department of Mathematics, Cauvery College for Women (Autonomous), Trichy – 18, India.

A. Gowri Shankari,
PG and Research Department of Mathematics, Cauvery College for Women (Autonomous), Trichy – 18, India.

Please see the link here: https://stm.bookpi.org/RHMCS-V2/article/view/8572

Determination of Efficient Algorithm for Factoring Semiprime Number| Chapter 3 | Research Highlights in Mathematics and Computer Science Vol. 1

 The trouble of figuring enormous semiprime numbers is central to public key cryptography. It is basic to find conditions in which semiprime factoriza-tion can be performed effectively. Our goal is to find use situations where semi prime factorization calculation can be run effectively. The numerical methodology for semiprime factorization is presented in this article. Ideally, it will help research-ers in shutting further holes and unveiling key cryptography more secure.

Author(s) Details:

Yonatan Zilpa,
Department of Mathematics, the Hebrew University of Jerusalem, Jerusalem, Israel.

Please see the link here: https://stm.bookpi.org/RHMCS-V1/article/view/8242

Assessment of Copyright Protection Using Watermarking and Cryptography for Online Text Information | Chapter 13 | New Visions in Science and Technology Vol. 9

 

Information and security are two factors that are interdependent. To reach its relevance, information security has evolved into a global issue that necessitates a variety of tools, regulations, and assurance of technologies against any relevant security concerns. Thousands of writers are being drawn to the internet flood, which offers a flexible means of disseminating online content at a low cost. Because text is such an important component of online information sharing, there is a high need for text and web copyright protection. In this work, a variety of visible watermarking approaches are investigated for text documents, but only a handful for web-based content. The goal of this research is to underline the importance of using watermarking and cryptography approaches to protect online text data that is exposed to a range of threats.

Author(S) Details

B. N. Lakshmi
Department of CSE, BMS Institute of Technology and Management Bangalore-560064, India.

N. Ashwini
Department of CSE, BMS Institute of Technology and Management Bangalore-560064, India.

Aditya Abrol
Department of CSE, BMS Institute of Technology and Management Bangalore-560064, India.

View Book:- https://stm.bookpi.org/NVST-V9/article/view/4792

Significant Study of Data Encryption and Steganography | Chapter 10 | Recent Advances in Mathematical Research and Computer Science Vol. 1

The usage of the internet is increasing over the world these days, making security a big worry for consumers. Any information that is saved on a digital platform is referred to as data. The safeguarding of data is what security is all about. Data security refers to the use of digital safeguards to secure data from hackers. Data encryption is one of the data security procedures employed. If the data is already encrypted, anyone who steals it will be unable to access it. In computer science, data encryption techniques are created to protect the data of senders and receivers. On the internet, communication security is a critical concern. Text, audio, picture, video, and other types of data are used in various encryption schemes. In today's world, security has become a must-have. The preservation of information is possibly the most crucial of all. In our framework, the data is exposed to a high level of danger. For various security considerations, we use a variety of ways. We now all rely on the cloud platform for security and storage, but it is also exposed to a variety of dangers. Because anyone with our credentials can access our data on the cloud, and cloud providers have fair access to us, the data is not well-secured. This article covers a wide range of data encryption techniques as well as other topics.

 

Author (S) Details

B. P. Patil
Nowrosjee Wadia College, Pune, India.

K. G. Kharade
Department of Computer Science, Shivaji University, Kolhapur, India.

S. K. Kharade
Department of Mathematics, Shivaji University, Kolhapur, India.

R. K. Kamat
Department of Electronics, Shivaji University, Kolhapur, India.

View Book:- https://stm.bookpi.org/RAMRCS-V1/article/view/4340

Fast Approach to Factorize Odd Integers: An algorithm Based Study | Chapter 7 | Current Topics on Mathematics and Computer Science Vol. 10

 The paper proves that an odd composite integer N can be factorized in O ((log₂N)⁴) bit operations if N = pq, the divisor q is of the form 2^au +1 or 2^au -1 with u being an odd integer and α being a positive integer and the other divisor p satisfies 1 < p < 2^a +1 or 2^a +1 < p <2^a+1-1. Theorems and corollaries are proved with detail mathematical reasoning. Algorithm to factorize the odd composite integers is designed and tested in Maple. The results in the paper demonstrate that fast factorization of odd integers is possible with the help of valuated binary tree.

Author(s) Details

Xingbo Wang
Department of Mechatronic Engineering, Foshan University, Foshan City, PRC, 528000, China and State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China and Guangdong Engineering Center of Information Security for Intelligent Manufacturing System, China.

Junjian Zhong
Department of Mechatronic Engineering, Foshan University, Foshan City, PRC, 528000, China.

View Book :- https://stm.bookpi.org/CTMCS-V10/article/view/3752

New Approach in Cryptography Using RC4 Protocol | Chapter 12 | New Approaches in Engineering Research Vol. 13

 In cryptography, the RC4 protocol is the most widely used. The goal of this project is to investigate the efficient design of the RC4 stream cypher and to propose an efficient cypher architecture. The loop unrolling and pipeline concepts were used to generate two RC4 key stream bytes every clock cycle. The design is compared to prior weeks' designs to see how many cycles are needed to finish the individual KSA and PRGA modules, as well as the RC4 Stream Cipher as a whole. The XILINX 13.2 on Vertex ML605 Evaluation FPGA Board was used to create the design.

Author (S) Details

G. V. R. Sagar
G. Pulla Reddy Engineering College (Autonomous), Kurnool, Andhra Pradesh, India.

View Book :- https://stm.bookpi.org/NAER-V13/article/view/3497

End-to-end Secured Fiber Optic Communication Using a Novel Encryption Algorithm | Chapter 18 | Current Topics on Mathematics and Computer Science Vol. 7

 Fiber optic communication has become increasingly popular in recent decades due to its several advantages over traditional cable connection. Fiber optic connectivity enables for a download speed of 100 Mb/s and a fast upload speed with little latency. Despite the fact that fibre optics can send large volumes of data across long distances quickly, it is vulnerable to a range of security concerns. It's easy to connect to the fibre optic line. A fibre optic cable is a thin strand of glass or plastic used to send data from one location to another. To offer end-to-end secure fibre optic communication, a unique encryption technology based on the Advanced Encryption Standard (AES) is used. It uses a variable key cypher, in which the original key is utilised to construct a series of AES sub keys, using feedback from previous cypher blocks, and each sub block is encrypted with multiple sub keys. The proposed encryption algorithm's performance is simulated and evaluated. According to the simulation results, the suggested fibre optic communication technology provides strong end-to-end security.

Author (S) Details

Dr. Bosco Paul Alapatt
Department of Computer Science, CHRIST (Deemed to be University), Delhi NCR Campus, India.

View Book :- https://stm.bookpi.org/CTMCS-V7/article/view/3286

Determination of Information Security Using Cryptography and Image Steganography | Chapter 7 | Advanced Aspects of Engineering Research Vol. 16

 For their own vested interests, hackers are frequently willing to hack secret documents. Establishing a secure relationship between the secret message and image quality is the most difficult task. To prevent illegal attacks by an unknown person, the suggested approach combines cryptography and visual steganography techniques. Image and message security will be enabled by this approach. Cryptographic algorithms based on the International Data Encryption Algorithm (IDEA) and steganography algorithms based on the Discrete Cosine Transform (DCT). Cryptography's goal is to encrypt and decrypt the document. Steganography is a technique for securely transmitting secret data over the internet that involves hiding documents within an image with increasing payload. We show a single application in this paper to mask the sender's information, which is an important document and a secret file. Unauthorized users will be unable to see the form. With a payload of 52,400 bytes of information in an image, the PSNR is 90.06 dB.

Author (S) Details

G. Mallikharjuna Rao
ECE Department, Affiliated to Osmania University, Hyderabad, India.

View Book :- https://stm.bookpi.org/AAER-V16/article/view/1992

Cryptography in Mathematics Teaching | Chapter 3 | Recent Studies in Mathematics and Computer Science Vol. 3

 Cryptography is of great importance to people of all generations and is presented as an application of

mathematical sciences. On the other way, giving mathematics as basics of cryptography reduces the application
of mathematical insights to the message “Cryptography contains Mathematics”. This paper introduces
cryptography from Caesar Cipher to Public Key Cryptography with simple examples. Using the Fermat’s little
Theorem in RSA Cryptography specific mathematical competencies are highlighted that complement standard
teaching and deepen mathematical concepts. Prohibitions in cryptography will also be discussed in this paper.

Author(s) Details

Dr. Kiran Bala,
Department of Mathematics, Govt. P.G. College for Women, Sector 14, Panchkula, India.

View Book :- http://bp.bookpi.org/index.php/bpi/catalog/book/233