Preethi Preethi

Dr. Preethi Preethi

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 January 2025 in SN Computer Science
Verified
Journal Article
Open access
PDF file
PPPreethi Preethi
Preethi Preethi
DMD. H. R. Murthy
D. H. R. Murthy
VHVani Hiremani
Vani Hiremani
RDRaghavendra Devadas
Raghavendra Devadas
RSR. Sapna
R. Sapna
This study investigates the effectiveness of various regression models for predicting housing prices using the California Housing dataset. The models evaluated include Linear Regression, Ridge Regression, Best Polynomial Ridge Regression, Lasso Regression, Elastic Net Regression, and Support Vector Regression (SVR) with an RBF kernel. The analysis reveals that SVR with an RBF kernel exhibits the poorest performance, characterized by the highest Mean Squared Error (MSE) and the lowest R² score, indicating limited effectiveness for this dataset. Conversely, Linear Regression, Ridge Regression, and Best Polynomial Ridge Regression demonstrate significantly lower MSE values and nearly identical R² scores, each explaining approximately 60% of the variance in housing prices. Among these, Best Polynomial Ridge Regression marginally outperforms Linear and Ridge Regression, suggesting that including polynomial features enhances model performance. Although Lasso Regression shows slightly higher MSE than the leading models, it still performs better than Elastic Net and SVR. Overall, the study identifies linear regression, ridge regression, and best polynomial ridge regression as the most effective models for this dataset, with SVR and an RBF kernel being the least effective.

18 November 2023 in Journal of ICT Standardization
Verified
Journal Article
Open access
PDF file
MUMohammed Mujeer Ulla
Mohammed Mujeer Ulla
PPPreethi Preethi
Preethi Preethi
SKSameeruddin Khan
Sameeruddin Khan
DSDeepak S. Sakkari
Deepak S. Sakkari
Very recent attacks like ladder leaks demonstrated the feasibility of recovering private keys with side-channel attacks using just one bit of secret nonce. ECDSA nonce bias can be exploited in many ways. Some attacks on ECDSA involve complicated Fourier analysis and lattice mathematics. This paper will enable cryptographers to identify efficient ways in which ECDSA can be cracked on curves NIST256p, SECP256k1, NIST521p, and weak nonce, kind of attacks that can crack ECDSA and how to protect yourself. Initially, we begin with an ECDSA signature to sign a message using the private key and validate the generated signature using the shared public key. Then we use a nonce or a random value to randomize the generated signature. Every time we sign, a new verifiable random nonce value is created, and a way in which the intruder can discover the private key if the signer leaks any one of the nonce values. Then we use Lenstra–Lenstra–Lovasz (LLL) method as a black box, we will try to attack signatures generated from bad nonce or bad random number generator (RAG) on NIST256p, SECP256k1 curves. The combination of nonce generation, post-message signing, and validation in ECDSA helps achieve Uniqueness, Authentication, Integrity, and Non-Repudiation. The analysis is performed by considering all three curves for the implementation of the Elliptic Curve Digital Signature Algorithm (ECDSA). The comparative analysis for each of the selected curves in terms of computational time is done with the leak of nonce and with the Lenstra–Lenstra–Lovasz method to crack ECDSA. The average computational costs to break ECDSA with curves NIST256p, NIST521p, and SECP256k1 are 0.016, 0.34,0.46 respectively which is almost zero depicting the strength of the algorithm. The average computational costs to break ECDSA with curves SECP256K1 and NIST256p using LLL are 2.9 and 3.4 respectively

27 December 2022 in SN Computer Science
Verified
Journal Article
Closed access
PDF file
PPPreethi Preethi
Preethi Preethi
KMK. G. Mohan
K. G. Mohan
SKSudeendra Kumar K.
Sudeendra Kumar K.
KMK. K. Mahapatra
K. K. Mahapatra

2 January 2026
Verified
Book Chapter
Closed access
PDF file
PPPreethi Preethi
Preethi Preethi
MUMohammed Mujeer Ulla
Mohammed Mujeer Ulla
RSR. Sapna
R. Sapna
RDRaghavendra Devadas
Raghavendra Devadas
VHVani Hiremani
Vani Hiremani
PNPavithra N
Pavithra N

6 September 2023 in Research Square
Verified
Preprint
Open access
PDF file
KRKumar Sekhar Roy
Kumar Sekhar Roy
MSMurikipudi Sujith
Murikipudi Sujith
BBBandi Bhanu
Bandi Bhanu
PPPreethi Preethi
Preethi Preethi
RHRuhul Amin Hazarika
Ruhul Amin Hazarika
Authentication is the process of verifying the identity of an individual, system, or entity. The goal of authentication is to ensure that the entity requesting access is who they claim to be. The authentication of drones presents several challenges due to the unique characteristics and operating environment of unmanned aerial vehicles (UAVs). Some of the challenges include Identity Management, Secure Key Management, Secure Communication Channels, Limited Resources, Tampering and Spoofing etc. Therefore, Addressing these challenges requires a comprehensive approach that combines secure hardware and software design, encryption techniques, and standardized authentication schemes to ensure best practices and standards for drone authentication and security. Authentication of drones using Field-Programmable Gate Arrays (FPGAs) can provide a hardware-based approach to enhance security and performance. FPGAs are programmable integrated circuits that can be configured and reconfigured to implement custom digital logic circuits, making them suitable for implementing authentication mechanisms in drones. Using FPGA in drones can provide several advantages such as secure key storage, hardware acceleration, secure boot, secure communication, tamper detection and protection, customization and flexibility, etc. For our proposal, we have evaluated some of the well-known cryptosystems and accordingly proved the security of our scheme.