GAGanesh Aithal

Ganesh Aithal

*This is an algorithmically generated author record based on publicly available information.

Ganesh Aithal has a total of 27 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Fuzzy logic based sliding surface adjustment of second-order sliding mode controllers

    by Basheer V P, Abdul Kareem, Ganesh Aithal

    This research work designs a variant of second-order sliding mode control scheme, making use of varying sliding surface inferred using a fuzzy inference system. The varying sliding surface is an effective strategy to improve controller performance. A surface with a relative degree of two is first built by accounting for the uncertainties and perturbances of the system. Thereafter, in order to enhance the dynamics of the system being controlled, a varying sliding surface based on a straightforward double input-single output fuzzy logic inference architecture is proposed. The controller ensures system's reaching conditions, and also the stability and robustness. The designed control scheme is studied in comparison with a sliding mode controller of second order having a constant surface of sliding using SIMULINK based simulation for a nonlinear system. The comparison shows that the proposed strategy exhibits an improved dynamic performance than the conventional sliding mode control of second order having a constant surface of sliding.


  • Open Access

    A Novel and Secure Fake-Modulus Based Rabin-Ӡ Cryptosystem

    by Raghunandan Kemmannu Ramesh, Radhakrishna Dodmane, Surendra Shetty, Ganesh Aithal, Monalisa Sahu, Aditya Kumar Sahu

    Electronic commerce (E-commerce) transactions require secure communication to protect sensitive information such as credit card numbers, personal identification, and financial data from unauthorized access and fraud. Encryption using public key cryptography is essential to ensure secure electronic commerce transactions. RSA and Rabin cryptosystem algorithms are widely used public key cryptography techniques, and their security is based on the assumption that it is computationally infeasible to factorize the product of two large prime numbers into its constituent primes. However, existing variants of RSA and Rabin cryptosystems suffer from issues like high computational complexity, low speed, and vulnerability to factorization attacks. To overcome the issue, this article proposes a new method that introduces the concept of fake-modulus during encryption. The proposed method aims to increase the security of the Rabin cryptosystem by introducing a fake-modulus during encryption, which is used to confuse attackers who attempt to factorize the public key. The fake-modulus is added to the original modulus during encryption, and the attacker is unable to distinguish between the two. As a result, the attacker is unable to factorize the public key and cannot access the sensitive information transmitted during electronic commerce transactions. The proposed method’s performance is evaluated using qualitative and quantitative measures. Qualitative measures such as visual analysis and histogram analysis are used to evaluate the proposed system’s quality. To quantify the performance of the proposed method, the entropy of a number of occurrences for the pixels of cipher text and differential analysis of plaintext and cipher text is used. When the proposed method’s complexity is compared to a recent variant of the Rabin cryptosystem, it can be seen that it is more complex to break the proposed method—represented as O(ɲ× τ) which is higher than Rabin-P (O(ɲ)) algorithms.


  • Open Access

    Key Generation Using Generalized Pell’s Equation in Public Key Cryptography Based on the Prime Fake Modulus Principle to Image Encryption and Its Security Analysis

    by K. R. Raghunandan, Aithal Ganesh, Shetty Surendra, K. Bhavya

    RSA is one among the most popular public key cryptographic algorithm for security systems. It is explored in the results that RSA is prone to factorization problem, since it is sharing common modulus and public key exponent. In this paper the concept of fake modulus and generalized Pell’s equation is used for enhancing the security of RSA. Using generalized Pell’s equation it is explored that public key exponent depends on several parameters, hence obtaining private key parameter itself is a big challenge. Fake modulus concept eliminates the distribution of common modulus, by replacing it with a prime integer, which will reduce the problem of factorization. It also emphasizes the algebraic cryptanalysis methods by exploring Fermat’s factorization, Wiener’s attack, and Trial and division attacks.


  • Time Complexity Reduction for the Application of Stream Cipher System Based XOR Free Operation

    by Radhakrishna Dodmane, Ganesh Aithal, Svmit Bantakal Vice-Principal, Surendra Shetty

    Providing security to user information are the most important aspects of today’s internet applications. Due to the very fast increase in the internet applications, the value of data exchange also became important. Hence, the better security and fast processing of the system is at high demand in the communication-related communities. Cryptography is one such area of providing data security. The two major criteria that specify the significance of a cryptographic algorithm are the security provided against the various attacks and the time to perform the operations. The proposed system is a solution to the cryptographic system to reduce the time complexity by retaining the security of the algorithm as it is. The solution proposed is to reduce the processing time required for the XOR function. This solution is by generating; XOR values for the vector space mentioned by the tuple, later replace the same wherever required. These values of XOR depend on the tuple, which represents the vector. Algorithm and time complexity for the generation of the vector space of XOR values for the proposed space evaluated. The result of the work compared based on two Standard symmetric-key cipher systems, Advanced Encryption Standard (AES) and Blowfish. The results are also tested and analyzed for different data size for the time complexity.


  • Generation of pseudo random number sequence from discrete oscillating samples of equally spread objects and application for stream cipher system

    by Sudeepa K.B., Ganesh Aithal

    Summary: The demand on security privileged information has widely increased due to the sensitivity of the exchanged information over public communication channels. Nowadays, almost all organizations, mainly, business, financial, and government related areas, and also other regions are computerized, and sometimes, the data will be highly confidential. Since some areas dealing with confidential data, it is very much essential to provide the security for the data to avoid unauthorized access. Multimedia data security and security related issues have attracted many researchers towards it. Cryptography is necessary to protect the confidential information transmitting over the network. The strength of the cryptographic system, especially, stream cipher, is not only depending upon its encryption/decryption algorithm but also depends upon the randomness properties of the key sequence such as length, uniformity, independence, etc. In this work, a novel method of generating the pseudo random number that is based on the discrete equally spread oscillating points viewed orthogonally as an envelope has been considered for the generation. Depending on the number of samples, it is possible to get the higher length of the sequence. The random patterns generated by the discrete points of a moving wave are used to generate non binary random numbers. These numbers are used as key in stream cipher system. These are having greater advantages like one time padding to achieve perfect security in cryptographic application. The same non binary key sequence generated is applied for the cryptographic application, and the security parameters of the result obtained from cryptographic applications are also evaluated to observe the strength of security level.


  • Flood and Heat Wave Prediction using Weighted Moving Average, Anomaly Detection and K-Nearest Neighbours for the City Of Mangalore

    by Clyde Shelton Bangera, Priya S Kotian, Chrislene Dias, T Divya, Ganesh Aithal

    Natural calamity is a naturally occurring event in nature that usually is out of the control of human beings. Little to nothing can be done to avoid it. Natural disasters cause damage to living beings and other structures and property. Floods and heat waves are relatively common natural calamities that affect lives. Flood is an abnormal overflow of water and heat wave is an abnormal increase in temperature.Flood and heat wave are natural calamities that claim many lives every year in India. This paper describes a method to forecast the occurrence of flood and heat wave using weather data for the city of Mangalore. In this method, a combination of weighted moving average and K-Nearest Neighbours is used on the weather data to predict floods and anomaly detection is used to detect heat wave. The prediction of flood is based on temperature, humidity and pressure parameters obtained from weather stations. The combination of K-Nearest Neighbours and weighted moving algorithms is used to forecast rain and then infer the prediction of flood. Heat wave is detected by finding anomalous temperature behaviour in the weather readings considering the temperature readings for an extended period of time.


  • Open Access

    A Survey on Key(s) and Keyless Image Encryption Techniques

    by Kumar H. S. Ranjan, Safeeriya S. P. Fathimath, Ganesh Aithal, Surendra Shetty

    As in recent years digital data transmission and image application have been increasing, maintaining secure transmission of image is of high importance. Image Encryption is implemented to achieve security on image applications. This paper exhibits a survey on various existing image encryption techniques. The paper mainly focuses on two types: Image encryption with Key(s) and Image Encryption without Key(s). In addition it also describes several properties of a good image encryption technique. The paper presents a survey of most popular algorithms and research papers that are related with different image encryption techniques.


  • Key generation and security analysis of text cryptography using cubic power of Pell's equation

    by K R Raghunandan, Rashmitha Shetty, Ganesh Aithal

    Security is major aspect when information is shared in a communication era. To keep the information secure various algorithm are proposed in public key cryptography. In this paper we are introducing new way of approach which overcomes the drawback of RSA in terms of integer factorization method and Wiener's attack which calculates the decryption key. The key generation process of cubic power of Pell's equation is different from traditional RSA method. The public key “K” is dependent on alpha, prime numbers and variables of Pell's equation. It is difficult to obtain the private key using public key exponent “K”. The paper aims to satisfy efficient, secure and reliable comparing with RSA by proving various attacks and histogram analysis.