Cryptanalysis of Some Graph Theory Based Encryption Techniques K Krishna Sowmya, V Srinivas Wseas Transactions on Mathematics, 2025 Any cryptographic technique plays a crucial role in ensuring the transfer of important, sensitive and confidential data through any sort of insecure medium and delivers the message intact to the intended and authenticated parties. Failing in any of these functionalities makes such cryptosystem obsolete in the modern technology. The study of any algorithm about its weakness and using that to decrypt the message without using any key is called cryptanalysis. In this paper, we present the cryptanalysis of two algorithms based on graph theory . The algorithms are studied in detail through different examples and explored all possible vulnerabilities.
Data Encryption and Decryption using Some Integral Transforms Gobburi Rekha Advances in Nonlinear Variational Inequalities, 2024 Ever since the beginning of time, people have valued privacy and information security. Information security is becoming increasingly vital in our digital society. The authentication system's protection of hidden information is crucial. One of the most significant methods used to protect data and secure message transmission is cryptography. There are the two components for the encoding and decoding process which includes the algorithm and key. Cryptography is made more secured by utilising a key for both encryption and decryption. Introduction: In many circumstances, the sender wants to keep the message private from the public or from unauthorised users. Information is protected using encryption, and the original message is unlocked using decryption. Various Techniques are found in literature and further we extend the findings by combining the Elzaki and Aboodh transforms to encrypt the message and apply their inverse transforms to decrypt it with the ASCII values under modulo 255. Objectives: In this paper we focused on two stages of encryption and two stages of decryption under modulo 255. Methods: Using different transformation techniques, we have encrypted and decrypted the data. One is Laplace transform technique while the other is Aboodh-Elzaki transform technique. Results: The text message is converted to coded message by using both Laplace transform technique and Aboodh-Elzaki transforms technique. Conclusions: In the current paper, we present a novel method that encrypts data using Laplace transform and decrypts it using the private key, which is under modulo255. The two integral transforms are used to increase the message's level of security during decryption by selecting a new function and altering the other elements.
Some Results of Data Encryption and Decryption using Euler’s Totient Function Gobburi Rekha Communications on Applied Nonlinear Analysis, 2024 In this paper, we discuss about the Hill Cipher cryptosystem, the RSA public-key cryptosystem, developed by Rivest, Shamir, Adleman for text encoding and decoding. To encrypt and decrypt the message, we use the Euler Phi-function, congruences, and matrix multiplication. Further, we employ two keys for coding and decoding.Introduction: In present, computer networks, internet and mobile communications are important and inevitable part of our society and security of information from hackers is a big task. One of the most widely used applications for information security is Cryptography. Usually in Hill cipher there are two keys, of which one acts as encryption key and the other one acts as decryption key. In this paper we discuss about Hill Cipher using only one key for data encryption and data decryption. Further, we extend our result with dual encryption and decryption process which is explained by using the RSA public key cryptosystem and Hill Cipher and they together execute a powerful cryptosystem to secure the data.Objectives: The purpose of this paper is to obtain and compare the result of data encryption and data decryption using:A matrix which is invertible.A matrix which is Involutory.An RSA cryptosystem which is applied for Hill Cipher where the matrix is Involutory.Methods: Using Hill Cipher and thereafter Hill Cipher - RSA together we have encrypted and decrypted the data under modulo 255.Results: The text message is converted to coded message and then original message is retrieved by using the three different techniques.Conclusions: As the paper involves two stages of encryption and decryption where public key and private key which are unthinkable by the third parities, the security of information is highly appreciable.
Encryption and Decryption using Hill Cipher and Integral Transforms Gobburi Rekha Communications on Applied Nonlinear Analysis, 2024 We know that Hill Cipher is one of the regular methods that is used in cryptography for encryption and decryption of data using modular arithmetic under different modulus. Moreover, we have seen results using some integral transforms like Laplace transforms, Aboodh transforms and many more. This paper extracts the result of dual encryption and decryption with a combination of Hill Cipher and few integral transforms.Introduction: In many circumstances, the sender wants to keep the message private from the public or from unauthorized users. Here, we combine Hill Cipher with Laplace and Kamal transforms to encrypt the message and apply their inverse transforms to decrypt it. In contrast to cipher text, which is a coded version of plaintext, the original message written by the user is referred to as plaintext.Objectives: In this paper, we focus on two stages of encryption and two stages of decryption under modulo 255.Methods: Using Hill Cipher with different transformation techniques, we have encrypted and decrypted the data. One is Hill Cipher with Laplace transform technique while the other is Hill Cipher with Kamal transform technique.Results: In this paper, we see that the original text is transformed to cipher text which could be retrievable using some techniques.Conclusions: This is a novel method that uses dual techniques to safeguard data: first, it encrypts the encrypted cipher text, and then it decrypts it again. The data is protected all along the way because the key that is transmitted to the recipient is very big and difficult to crack.
Some Results on Conditionally Sequential Absorbing Maps in Multiplicative Metric Space T. Thirupathi, V. Srinivas International Journal of Analysis and Applications, 2023 This paper aims to prove two general fixed point theorems in multiplicative metric space (MMS) by using reciprocally continuous mappings and conditionally sequential absorbing mappings. Further our outcomes are validated by discussing two appropriate examples.
An Affirmative Result on Banach Space V. Srinivas, T. Thirupathi International Journal of Analysis and Applications, 2022 The aim of this paper is to establish a common fixed point theorem on Banach space using occasionally weakly compatible (OWC) mappings.
Some Results of Conditionally Sequential Absorbing and Pseudo Reciprocally Continuous Mappings in Probabilistic 2-Metric Space K. Satyanna, V. Srinivas International Journal of Analysis and Applications, 2022 The objective of this paper is to generate two results in probabilistic 2-metric space by using the concepts of conditionally sequential absorbing mappings and pseudo reciprocally continuous mappings. These results stand as generalizations of the theorem proved by V. K. Gupta, Arihant Jain and Rajesh Kumar. Further these two outcomes are justified by supporting examples.
COMMON FIXED POINT OF FOUR MAPS IN Sm-METRIC SPACE K. Mallaiah, V. Srinivas International Journal of Analysis and Applications, 2021 In this paper, first, we deal with new metric space Sm-metric space that combines multiplicative metric space and S-metric space. We generate a common fixed point theorem in a Sm-metric space using the notions of reciprocally continuous mappings, faintly compatible mappings and occasionally weakly compatible mappings (OWC). We are also studying the well-posedness of Sm metric space. Further, some examples are presented to support our outcome.
SOME RESULTS BY USING CLR’s-PROPERTY IN PROBABILISTIC 2-METRIC SPACE V. Srinivas, K. Satyanna International Journal of Analysis and Applications, 2021 The aim of this paper is to generate two fixed point theorems in probabilistic 2-metric space by applying CLR’S-property and occasionally weakly compatible mappings (OWC), these two results generalize the theorem proved by V. K. Gupta, Arihant Jain and Rajesh Kumar. Further these results are justified with suitable examples.
Outcomes of Weakly Compatible Type(P) Mappings in Fuzzy Menger Space TT K.Satyanna,V.Srinivas International Journal of Multidiciplinary Education Research 15 (1), 63-78 , 2026 2026
Cryptanalysis of Some Graph Theory Based Encryption Techniques VSK Sowmya WSEAS Transactions on Mathematics 24, 707-713 , 2025 2025
Some Outcomes using Conditionally Sequential Absorbing and Pseudo Reciprocally Continuous in Multiplicative Metric Space T Thota, S Veladi Indian Journal of Science and Technology 17 (13), 1340-1348 , 2024 2024
A Novel Asymmetric Encryption Technique Using Onto Functions KK Sowmya, V Srinivas 2024
Some Outcomes on Fuzzy Menger Space via Common Property (EA) and Absorbing Maps K Satyanna, V Srinivas, RR Umamaheshwar Communications in Mathematics and Applications 15 (2), 777 , 2024 2024 Citations: 1
Applications of Onto Functions in Cryptography KK Sowmya, V Srinivas Mathematics and Statistics 12 (2), 135-141 , 2024 2024 Citations: 1
Results on Expansion Maps in Fuzzy Menger Space via Property-(EA) and (EA)-like Property K Satyanna, V Srinivas Ratio Mathematica 51 , 2024 2024 Citations: 1
Some Results on Conditionally Sequential Absorbing Maps in Multiplicative Metric Space T Thirupathi, V Srinivas International Journal of Analysis and Applications 21, 13-13 , 2023 2023 Citations: 3
Some fixed point results in fuzzy metric space using intimate mappings BVBR V.Srinivas Ratio Mathematica , 2023 2023 Citations: 1
Some Results of Conditionally Sequential Absorbing and Pseudo Reciprocally Continuous Mappings in Probabilistic 2-Metric Space K Satyanna, V Srinivas International Journal of Analysis and Applications 20, 12-12 , 2022 2022 Citations: 3
Some results on weakly semi compatible mappings in fuzzy metric space V Srinivas, K Satyanna J. Math. Comput. Sci. 12, Article ID 61 , 2022 2022
A fixed point theorem in multiplicative metric space based on common EA-like property M Katta, S Veladi Communications in Mathematics and Applications 13 (5), 1363 , 2022 2022 Citations: 1
Some Results in Cone Metric Space, Using Semi-Compatible and Reciprocally Continuous Mappings C Perala, V Srinivas Communications in Mathematics and Applications 13 (5), 1413 , 2022 2022
SOME RESULTS IN WEAKLY RECIPROCALLY CONTINUOUS AND OCCASIONALLY WEAKLY COMPATIBLE MAPPINGS ON PARTIAL METRIC SPACES S RAVI, V SRINIVAS 2022
Some Results on Conditionally Compatible and Conditionally Semi-Compatible Mappings in Probabilistic 2-Metric Space K Satyanna, V Srinivas Communications in Mathematics and Applications 13 (1), 265 , 2022 2022
Some Results of Conditionally Sequential Absorbing Maps in 2-Menger Space V Srinivas, K Satyanna Communications in Mathematics and Applications 13 (1), 27 , 2022 2022 Citations: 2
An Affirmative Result on Banach Space T V.Srinivas International Journal of Analysis and Applications 20 (2), 1-8 , 2022 2022 Citations: 1
Outcomes of Common Fixed Point Theorems in S-metric Space M V.Srinivas Mathematics and Statistics 10 (1), 160-165 , 2022 2022 Citations: 1
A Result on Probabilistic 2-Metric Space Using Strong Semi Compatible Mappings V Srinivas, K Satyanna Indian J. Sci. Technol 14, 3467-3474 , 2021 2021 Citations: 1
Common fixed point of four maps in sm-metric space K Mallaiah, V Srinivas International Journal of Analysis and Applications 19 (6), 915-928 , 2021 2021 Citations: 3
MOST CITED SCHOLAR PUBLICATIONS
Mathematical modelling for cryptography using laplace transform CH Jayanthi, V Srinivas International Journal of Mathematics Trends and Technology-IJMTT 65 , 2019 2019 Citations: 21
A fixed point theorem using EA property on multiplicative metric space V Srinivas, T Tirupathi, K Mallaiah J. Math. Comput. Sci. 10 (5), 1788-1800 , 2020 2020 Citations: 14
A result on multiplicative metric space V Srinivas, K Mallaiah J. Math. Comput. Sci. 10 (5), 1384-1398 , 2020 2020 Citations: 10
Fixed point results on multiplicative semi-metric space B Vijayabaskerreddy, V Srinivas Journal of Scientific research 12 (3), 341-348 , 2020 2020 Citations: 10
Application of the New Integral J-transform in Cryptography V Srinivas, CH Jayanthi International Journal of Emerging Technologies 11 (2), 678-682 , 2020 2020 Citations: 9
A common fixed point theorem using A-Compatible and S-compatible mappings V Srinivas, BVB Reddy, RU Rao Int. J. Theor. Appl. Sci 5, 154-161 , 2013 2013 Citations: 8
Common Fixed Point Theorem on Compatible Mappings of Type (P) V Srinivas, VN Raju Gen 21 (2), 87-94 , 2014 2014 Citations: 7
A common fixed point theorem under certain conditions, Gen V Srinivas, RU Rao Math. Notes 8 (2), 28-33 , 2012 2012 Citations: 7
A Fixed Point Theorem on Four Self Maps Under Weakly Compatible V Srinivas, RU Rao Proceedings of the World Congress on Engineering 2 , 2008 2008 Citations: 6
A fixed point theorem on reciprocally continuous self maps RU Rao, V Srinivas, PS Rao Indian Journal of Mathematics and Mathematical Sciences 3 (2), 207-215 , 2007 2007 Citations: 6
Some outcomes on b-metric space T Thirupathi, V Srinivas J. Math. Comput. Sci. 10 (6), 3012-3025 , 2020 2020 Citations: 5
A fixed point theorem using weakly Semicompatible mappings in metric space R Sriramula, V Srinivas International Journal of Mathematical Analysis 11 (15), 695-706 , 2017 2017 Citations: 5
Certain results in b-metric space using subcompatible, faintly compatible mappings T Thirupathi, V Srinivas J. Math. Comput. Sci. 11 (6), 8382-8399 , 2021 2021 Citations: 4
Some results in multiplicative metric space using absorbing mappings B Vijayabaskerreddy, V Srinivas Indian J. Sci. Technol 13 (39), 4161-4167 , 2020 2020 Citations: 4
A result on Banach space using EA like property V Srinivas, T Thirupathi Malaya Journal of Mathematik , 2020 2020 Citations: 4
A common fixed point theorem on fuzzy metric space V Srinivas, BVB Reddy, RU Rao Kathmandu University Journal of Science Engineering and Technology 8 (2) , 2012 2012 Citations: 4
Some Results on Conditionally Sequential Absorbing Maps in Multiplicative Metric Space T Thirupathi, V Srinivas International Journal of Analysis and Applications 21, 13-13 , 2023 2023 Citations: 3
Some Results of Conditionally Sequential Absorbing and Pseudo Reciprocally Continuous Mappings in Probabilistic 2-Metric Space K Satyanna, V Srinivas International Journal of Analysis and Applications 20, 12-12 , 2022 2022 Citations: 3
Common fixed point of four maps in sm-metric space K Mallaiah, V Srinivas International Journal of Analysis and Applications 19 (6), 915-928 , 2021 2021 Citations: 3
Some results in Menger space by using sub compatible, faintly compatible mappings V Srinivas, K Satyanna Malaya Journal of Mathematik , 2021 2021 Citations: 3
