Secure and Resilient Authenticated Encryption Approach Based on Chaotic Neural Networks and Duplex Construction | Chapter 8 | Advances and Challenges in Science and Technology Vol. 6

 This episode delves deep into the intricate interaction of procedures that mark the foundations of Authenticated Encryption (AE) and its importance in preserving the secrecy and authenticity of our mathematical communications. As the mathematical age progresses, telecommunication systems have shifted towards mathematical paradigms, compelled not only by the affordability and approachability of digital parts but also by the basic benefits they bring. Herein, we present a distinct approach from the Standard Duplex Construction (SDC) popular as the Modified Duplex Construction (MDC). The MDC incorporates two important phases: the initialization chapter and the duplexing phase, each encompassing a Chaotic Neural Network Revised (CNNR) delineated by a singular-hide neural form enriched accompanying non-linear functionalities. The chapter further confers the implementation of MDC in two distinguishing widths of 512 and 1024 bits. A exact evaluation concerning this construction against various cryptanalytic warnings showcases its elasticity and robustness. In this discourse, lectors will encounter the development, achievement, and analysis of a novel Authenticated Encryption with Associated Data Scheme (AEADS), created from the chaotic worlds of neural networks. The episode explicates the encryption and decryption processes of AEADS, stressing the crucial duty of variables such as IV, K, AD, and M in encryption, and C and T in decryption. The dependability of the decryption is liable to be subjected the alignment of computed and taken tags, dictating either the explanation of the original message or the generation of an wrong. The decryption complications, encompassing variables like C, T, IV, K, and AD, are still elucidated. Two distinct processes have existed instituted for message lengths connecting 64 and 128 bytes, providing a comprehensive view of the blueprint’s versatility.

Author(s) Details:

Nabil Abdoun,
School of Arts and Sciences, Lebanese American University, Beirut, Lebanon.

Safwan El Assad,
Nantes Universit ´ e, CNRS, IETR, UMR 6164, F-44000 Nantes, France.

Thang Manh Hoang,
Vietnam-Japan International Institute for Science of Technology, School of Electrical and Electronic Engineering, Hanoi University of Science and Technology, 1 Dai Co Viet, Hai Ba Trung, Hanoi 10999, Vietnam.

Olivier Deforges,
INSA de Rennes, CNRS, IETR, UMR 6164, F-35708 Rennes, France.

Rima Assaf,
Faculty of Engineering, Lebanese University, Beirut, Lebanon.

Mohamad Khalil,
Faculty of Engineering, Lebanese University, Beirut, Lebanon.

Please see the link here: https://stm.bookpi.org/ACST-V6/article/view/12135

Hybrid One Time Password Algorithm for Secure Healthcare IoT Data Access | Chapter 5 | Research Highlights in Mathematics and Computer Science Vol. 8

 The use of the Internet of Things (IoT) in constantly life is a climbing reality today. Even though skilled are many challenges in this surroundings, such as safety risks, energy consumption issues, and variety, But, the number of connected schemes is rapidly extending. This interconnected network of gadgets has enhance indispensable to routine life as a result of the epidemic growth in news sharing. As more society use this potent IoT platform, protection flaws enhance more severe. One habit to address numerous security exposures is by utilising One Time Passwords (OTP) to authenticate IoT consumers.  The OTP has added an supplementary coating to the conventional username-identification authentication plan. But there is a need for an OTP invention to secure the healthcare IoT data while accessing it from Central Medical Servers (CMS) of the IoT healthcare surroundings without the use of some external schemes. Thus, this research suggests the AroSheb Jo, a hybrid One-time Password era algorithm for healthcare IoT dossier and provides an analysis of the invention's security. The contrasting of its inconsequential attributes and resistance to security assaults is further included in this place research. This research additionally expands on the experimental and performance studies of the algorithm.

Author(s) Details:

R. Shantha Mary Joshitta,
Jayaraj Annapackiam College for Women (Autonomous), Periyakulam, Affiliated to Mother Teresa Women’s University, Kodaikanal, Tamil Nadu, India.

A. Jenifer Jothi Mary,
St. Joseph’s College (Autonomous), Affiliated to Bharathidasan University, Trichy, Tamil Nadu, India.

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

Confidence Analysis of a Solo Sign-On Device for Distributed Computer Networks: A Modeling Approach | Chapter 9 | Recent Advances in Mathematical Research and Computer Science Vol. 5

 SSO is a new authentication system that allows a legal user to be authenticated by several service providers in a distributed computer network with just one credential. By offering well-organized security reasons, an SSO technique recently offered and claimed security. Their method, however, is insecure since it compromises credential privacy and authentication soundness. We focus on two types of impersonation attacks: credential recovery attacks and impersonation attacks that don't require credentials. As a result, we provide a stronger authentication solution that overcomes these attacks and shortcomings by using efficient verifiable encryption of RSA signatures. We endorse the formal examination of the soundness of authentication as one open problem.

Author(S) Details

C. M. Sumanth
Department of CSE, Canara Engineering College, Mangalore, India.

Suresha D.
Department of CSE, Canara Engineering College, Mangalore, India.

View Book:- https://stm.bookpi.org/RAMRCS-V5/article/view/4971