In e na ional Jou nal o Inno a i e Technology and Explo ing Enginee ing (IJITEE)
ISSN: 2278-3075 (Online), Volume-14 Issue-12, No embe 2025
8
Published By:
Blue Eyes In elligence Enginee ing
and Sciences Publica ion (BEIESP)
© Copy igh : All igh s ese ed.
Re ie al Numbe : 100.1/iji ee.A119515011225
DOI: 10.35940/iji ee.A1195.14121125
Jou nal Websi e: www.iji ee.o g
Comp ehensi e Secu i y F amewo k o he Da k
Web Using Ellip ic Cu e C yp og aphy
S ee Vidya Venigalla, K.V.D Ki an
Abs ac : The da k web is a hidden pa o he in e ne ha
allows use s o communica e secu ely and anonymously, o en
using applica ions such as To . This pape speci ically add esses
he use o Ellip ic Cu e C yp og aphy (ECC) o enhanced
secu i y wi hin a da k web con ex , whe e, al hough adi ional
c yp og aphic algo i hms, such as RSA, possess unassailable
c yp og aphic alue, hey a e o en compu a ionally ine icien o
non-s anda d compu ing en i onmen s, and do no scale well. We
compa e ECC and RSA pe o mance in e ms o key gene a ion
ime, enc yp ion/dec yp ion ime, and memo y usage, and ind ha
ECC ou pe o ms RSA ac oss all me ics in challenging, limi ed-
esou ce ne wo ks. In ou es ing, we simula e he eal-wo ld
ope a ional en i onmen o anonymizing ne wo ks by using es
messages and message low logs ha a e anonymized. We
demons a e he ela i e imp o emen s in compu a ional ime and
memo y usage o ECC o e RSA while main aining equi alen
c yp og aphic s eng h. Using hese esul s, we c ea e an
in eg a ed mul i-laye ed secu i y cons uc , which uses ECC,
e alua es and classi ies h ea in o ma ion using machine
lea ning me hods o de ec anomalies in nea eal- ime, and
cons uc s a blockchain model o allow decen alized audi ail
acking, esul ing in a subs an ially enhanced secu i y and
p i acy solu ion o add ess he unique equi emen s o anonymous
communica ion in a da k web en i onmen . This s udy helps o
add ess he lack o empi ical e alua ions o ECC in da k web
con ex s, p esen ing a p ac ical oadmap o implemen ing
inno a i e c yp og aphic and analysis p o ocols o digi al
anonymi y. Va ious ou comes suppo he e icacy o pai ing
ligh weigh enc yp ion wi h in elligen beha iou al analy ics o
coun e e ol ing cybe h ea s. The amewo k p o ides a scalable,
lexible, and consis en ly ele an op ion o coun e ing a apidly
changing h ea while enabling u u e wo k on pos -quan um
c yp og aphy.
Keywo ds: Anonymi y, Blockchain, Cybe Th ea s, Da k Web,
Enc yp ion, Onion Rou ing, To , Ellip ic Cu e C yp og aphy
(ECC), Machine Lea ning, Cybe secu i y.
Nomencla u e:
ECC: Ellip ic Cu e C yp og aphy
RSA: Ri es -Shami -Adleman
TOR: The Onion Rou e
ML: Machine Lea ning
NLP: Na u al Language P ocessing
IoT: In e ne o Things
DoS: Denial o Se ice
Manusc ip ecei ed on 01 No embe 2025 | Re ised
Manusc ip ecei ed on 06 No embe 2025 | Manusc ip
Accep ed on 15 No embe 2025 | Manusc ip published on 30
No embe 2025.
*Co espondence Au ho (s)
S ee Vidya Venigalla*, S uden , Depa men o Compu e Science
Enginee ing, Kone u Lakshmaiah Educa ional Founda ion, Vijayawada
(Andh a P adesh), India. Email ID: s ee idya. [email protected],
ORCID ID: 0009-0002-0009-4441
D . K.V.D Ki an, P o esso , Depa men o Compu e Science
Enginee ing, Kone u Lakshmaiah Educa ional Founda ion, Vijayawada,
(Andh a P adesh), India. Email ID: ki an_cse@kluni e si y.in, ORCID ID:
0000-0002-8808-9307
© The Au ho s. Published by Blue Eyes In elligence Enginee ing and
Sciences Publica ion (BEIESP). This is an open-access a icle unde he
CC-BY-NC-ND license h p://c ea i ecommons.o g/licenses/by-nc-nd/4.0/
DDoS: Dis ibu ed Denial o Se ice
GPU: G aphics P ocessing Uni
CTI: Cybe Th ea In elligence
SVM: Suppo Vec o Machines
LDA: La en Di ichle Alloca ion
RNN: Recu en Neu al Ne wo ks
I. INTRODUCTION
The da k web is a hidden laye o he in e ne accessible
ia anonymising ne wo ks such as To . I has become a
double-edged swo d. I has been a ligh house o ee
exp ession and a sanc ua y o ac i is s and whis leblowe s in
opp essi e poli ical sys ems, despi e i s use as a malwa e
ma ke place and in c iminal ne wo ks o acili a e illici
ac i i y and un egula ed cu encies. Since i s eme gence in
he ea ly 2000s, he da k web has a ac ed he a en ion o
cybe secu i y p o essionals, go e nmen en i ies and
academic playe s.
The da k web in as uc u e elies on an essen ial elemen
ha enables i s anonymi y and secu e communica ion:
enc yp ion. T adi ional algo i hms, such as RSA enc yp ion,
ha e p o ided his elemen , bu compu abili y issues and
e ol ing c yp og aphic a acks inc easingly h ea en RSA.
Cybe h ea s a e becoming mo e ad anced, and da k web
en i onmen s a e o en esou ce-limi ed and need bo h
e iciency and secu i y. Ellip ic Cu e C yp og aphy (ECC)
is he leading candida e o he ask, o e ing imp o ed speed
and memo y usage while p o iding equal o g ea e
p o ec ion han RSA wi h signi ican ly smalle key sizes.
Gi en hese ci cums ances, his wo k in es iga es he ole o
ECC as a key elemen o da k web secu i y a chi ec u es,
e alua es i s unc ional pe o mance agains RSA, and
p oposes a ho ough, mul i-laye ed amewo k o h ea
de ec ion and mi iga ion. We iew ou con ibu ion as wo-
old: we add ess bo h he c yp og aphic ounda ion and
p oac i e moni o ing schemes o es ablish a o wa d-leaning
pa adigm o da k web sa e y.
II. LITERATURE REVIEW
Resea ch on he da k web sugges s ha i s use can ei he
p o ec o exploi use s. The To ne wo k anonymises use
da a h ough onion ou ing, enc yp ing use a ic a mul iple
laye s. A o a [1] s a ed ha To se es a ole in digi al
p i acy, while Owen and Sa age [2] desc ibed how To has
been abused o pu chasing illici p oduc s.
Acco ding o Ullah [3], Ellip ic Cu e C yp og aphy (ECC)
p o ides s ong enc yp ion wi h much smalle key sizes han
s anda d sys ems, enabling as e
compu a ion and s o age.
Alsha ’e e al. [4] suppo ed
his use o ECC as a
Comp ehensi e Secu i y F amewo k o he Da k Web Using Ellip ic Cu e C yp og aphy
9
Published By:
Blue Eyes In elligence Enginee ing
and Sciences Publica ion (BEIESP)
© Copy igh : All igh s ese ed.
Re ie al Numbe : 100.1/iji ee.A119515011225
DOI: 10.35940/iji ee.A1195.14121125
Jou nal Websi e: www.iji ee.o g
ligh weigh c yp og aphic implemen a ion. The IDEMIA
Sphe e C yp og aphic Lib a y [5] p ojec also demons a ed
he u ili y o ECC o quan um-sa e, mode n enc yp ion.
Al hough mi iga ing iming a acks is essen ial o
implemen a ion (Döpmann e al. [6]), ECC o e s a
compelling al e na i e. The "da k o es " me apho used by
Zhang e al. [7] sugges s ha sa e y can be unp edic able
when conduc ing ansac ions on he da k web and calls o a
e iew o secu i y amewo ks o imp o e p ac ices h ough
c yp og aphic enhancemen s, such as ECC.
In hei s udy, Jang e al. [8] ound ha ans o me -based
na u al language p ocessing (NLP) models could imp o e he
h ea classi ica ion accu acy o da k web o um con en ,
based on p e ious esea ch. Chen and Xu [9] p oposed a
sha ed-audi ing blockchain mechanism ha would ensu e log
in eg i y in eco ded, ampe -e iden cybe c ime
in es iga ions. Al-Bassam [10] implemen ed ellip ic cu e
c yp og aphy (ECC) in blockchain sys ems o acili a e
decen alised online eco ding.
Liu e al. [11] s udied he use o ECC o In e ne -o -Things
applica ions, sugges ing i was a esou ce-e icien al e na i e
o using To solu ions. Kim and Cho [12] u ilized ECC as a
pa o hei decen alized iden i y e i ica ion p ocess and
p o ided an example showing ha con iden iali y and
accoun abili y could coexis .
Ren e al. [13] used neu al ne wo k-based classi ie s o
de ec pa e ns in enc yp ed a ic. Al-Mashaqbeh e al. [14]
ecommended de eloping a hyb id sys em combining ECC
and biome ics o access con ol. Wu e al. [15] implemen ed
an ECC-based imes amped, ampe -e iden s o age scheme
o digi al o ensics.
Be ns ein e al. [16] and Chen e al. [17] helped e alua e he
quan um esilience o ECC agains la ice-based al e na i es.
Zhou e al. [18] p oposed a hyb id model o inco po a e ECC
and la ice implemen a ions. Singh and Bansal [19] e iewed
ML-based IDS sys ems in an anonymised ne wo k
in as uc u e. Sha ma and Gup a [20] e iewed ECC and
RSA in a mobile en i onmen , concluding ha ECC
pe o med be e when he applica ion was secu e and
ligh weigh .
The ocus o ou esea ch ad ances his wo k owa d a
holis ic, in eg a ed model ha le e ages ECC, ML, and
Blockchain o eal- ime da k web p o ec ion.
III. RELATED WORK
P e ious esea ch has discussed a ious aspec s o he
a chi ec u e o he da k web and he applica ion o
c yp og aphy. Howe e , ac oss his esea ch, e y li le has
combined he inno a i e po en ial o ECC o c ea e a
p oac i e secu i y amewo k. Resea ch has chie ly ocused
on ECC, examining i s ma hema ical p inciples and
compa ing i o RSA, showing imp o ed esis ance o e-
keying a acks and s onge secu i y agains b u e- o ce and
algeb aic a acks. Much o he esea ch by Clausi [5] and
A o a [1] has ocused on he onion ou ing concep as a co e
componen o anonymous communica ion.
Mo e ecen wo k by Zhang e al. [7] has begun o shi he
discussion owa d a p oac i e su eillance and h ea analysis
con e sa ion h ough he use o models ha inco po a e
c yp og aphic beha iou s. S ill, he e is a dis inc lack o
empi ical esea ch compa ing ECC and RSA in he con ex o
h ea s o he da k web, using eal- ime simula ion da a. The
s udy will empi ically compa e he wo c yp og aphic
implemen a ions and p esen a mul i-app oach secu i y
s a egy ha in eg a es ECC p inciples, ocusing on he
unique h ea s and challenges o he da k web.
The esea ch on cybe h ea in elligence (CTI) collec ion
om hacke o ums has in oduced a hyb id wo-s age
app oach using Suppo Vec o Machines (SVM) and La en
Di ichle Alloca ion (LDA). These o ums a e pu posely
anonymous and ocused on suppo ing illegal ansac ions,
bu hey also p o ide in elligence on he eme gence o cybe
h ea s. Da a is collec ed om o ums accessible ia To , and
he in o ma ion is p e-p ocessed o elimina e noise and
s anda dise da a con en . LDA is used o opic modelling,
e ealing he p ima y hemes o malwa e, phishing, o ze o-
day exploi s. A e wa ds, SVM is used o classi y he opic
in o h ea le els o ac ionable CTI.
The use o he hyb id me hod helps imp o e bo h he
accu acy and he e ec i eness o de ec ion, wi h he
o e a ching goal o CTI. Combining LDA o ex ac a ew
essen ial hemes, and SVM o e ine he classi ica ion
me hod, leads o a be e unde s anding o he cu en ly
ending malwa e (s ain), a ge ed a ack and exploi a ion
s a egies, and eme gence o new ulne abili ies. One no able
challenge in his a ea is he ongoing e olu ion o he hacke
communi y's ocabula y and unde g ound con e sa ions,
which will equi e models o be equen ly upda ed and
checked agains us ed sou ces. Fu u e op imiza ions may
include eal ime moni o ing and he use o deep lea ning
models such as ecu en neu al ne wo ks (RNN) o
ans o me s o p o ide a deepe unde s anding o he
nuances o communica ion. In ac , ecen wo k using
ans o me -based na u al language p ocessing (NLP) models
ound unp eceden ed imp o emen s in h ea classi ica ion
accu acy using da k web o um da a [9]. Ano he a ea o
wo k has been on he de elopmen o an expe sys em based
on ECC, machine lea ning and NLP, explici ly designed o
classi y malicious con en .
These sys ems a e a ge ed sys ems o na iga ing and
analysing enc yp ed da k web con en while main aining
some le el o da a in eg i y. Simila sys ems u ilize ECC o
p i acy-p ese ing iden i ica ion and classi ying des uc i e
ac i i y ac oss da k web ma ke places, o ums, and
anonymous messaging pla o ms.
Risk iden i ica ion sys ems a e also eme ging, in which
ope a o s moni o he da k web o discussions o exploi s,
sys em ulne abili ies, and weaknesses in c yp og aphic
echniques. Fo ums may ha e implemen a ion weaknesses in
ECC o in sideline channels ha could c ea e ea ly-wa ning
oppo uni ies. Specula i e analys s may deduce, h ough
con inuous moni o ing o ESS cybe secu i y opics and
esponses, which candida e echnologies and indus ies may
be suscep ible o isk.
Th ough h ea analysis and ad ancemen s in da k web
de ec ion echnology, he p ac ice has e ol ed om eac i e
moni o ing o p oac i e, in elligence-based sys ems.
In eg a ing ECC wi h CTI
pipelines, machine lea ning
models, and beha iou
analy ics gene a es he ull
In e na ional Jou nal o Inno a i e Technology and Explo ing Enginee ing (IJITEE)
ISSN: 2278-3075 (Online), Volume-14 Issue-12, No embe 2025
10
Published By:
Blue Eyes In elligence Enginee ing
and Sciences Publica ion (BEIESP)
© Copy igh : All igh s ese ed.
Re ie al Numbe : 100.1/iji ee.A119515011225
DOI: 10.35940/iji ee.A1195.14121125
Jou nal Websi e: www.iji ee.o g
cycle o sys ems needed o mi iga e issues ela ed o he dual-
use beha iou s. In ou wo k, we ad ance his line o esea ch
owa d an in eg a ed amewo k ha uses ECC o secu e
communica ions, h ea de ec ion ia lis ing and epo ing
sys ems, and decen alised, audi able measu emen s.
IV. METHODOLOGY
To empi ically assess he iabili y and pe o mance o ECC
o secu e da k web communica ions, we pe o med
con olled expe imen s compa ing ECC agains RSA unde
simula ed condi ions. We conduc ed he expe imen s on
Ubun u 20.04 unning in a i ual machine wi h 8GB RAM
and a dual-co e p ocesso . We implemen ed c yp og aphic
ope a ions using he Py hon PyC yp odome lib a y.
The ellip ic cu e used in ou expe imen s is de ined o e a
ini e ield by he ollowing equa ion:
y2≡ x3+ax + b mod p … (1)
[Fig.1: Visual Rep esen a ions o Ellip ic Cu e
Ope a ions On Y² = X³ + 3x Mod 281]
A. Poin addi ion when P + Q = R. A line in e sec s he
cu e a poin s P and Q; he e lec ion o he hi d
in e sec ion poin o he line wi h espec o he x-axis
gi es R.
B. Re lec ion o poin –R o demons a e ha P + Q = – R,
as expec ed be o e he e lec ion, gi es he esul ing
poin R.
C. Poin doubling when P = Q. The angen line a poin P
in e sec s he cu e a second ime, and he e lec ion o
his in e sec ion poin ac oss he x-axis esul s in 2P.
D. The esul o he e e sal and symme y; his
demons a es a bi o he in e se ea u es o he s uc u e
o he cu e, whe e we ha e used his o scala
mul iplica ion, while showing he p ope ies o he
g oup law in ECC.
Fo his s udy, we chose he commonly used NIST P-256
cu e, wi h he ollowing pa ame e s:
▪ a = -3
▪ p = 2^ {256} - 2^ {224} + 2^ {192} + 2^ {96} - 1
This p o ides app oxima ely he same secu i y as a 3072-
bi RSA key, making i ideal o compa ison. The es da a
consis ed o anonymised messages, simula ed use
c eden ials, and andom ansac ion logs. The me ics
e iewed in ou es s included:
▪ Key gene a ion ime
▪ Enc yp ion/dec yp ion ime
▪ Memo y consump ion
▪ Resis ance o b u e- o ce a emp s
We egene a ed hese ope a ions 100 imes o s a is ical
alidi y. Figu es and ables illus a e he pe o mance ends
o bo h algo i hms. We aimed o un an expe imen ha
simula ed he esou ce cons ain s o en encoun e ed in
anonymised ne wo ks like To , whe e speed is essen ial.
V. EXPERIMENTAL RESULTS AND ANALYSIS
The esul s om he expe imen show ha ECC
signi ican ly ou pe o ms RSA. The key gene a ion ime was
app oxima ely 45% as e han RSA. The enc yp ion and
dec yp ion imes in he s udied expe imen s we e
app oxima ely 50% as e , while he memo y consump ion
o c yp og aphic ope a ions was app oxima ely 30% lowe .
Table I: Key Gene a ion Time Compa ison
Algo i hm
Key Size
A g Time (ms)
ECC
256
12.4
RSA
2048
22.9
Table II: Memo y Usage Compa ison
Algo i hm
Peak Memo y MB
ECC
21
RSA
30
[Fig.2: Pe o mance Cu e Compa ing ECC And RSA: Key
Gene a ion Time, Enc yp ion Speed, and Memo y Usage]
Addi ionally, ECC was mo e esis an o b u e- o ce
simula ions o ope a ions in cons ained embedded ha dwa e
en i onmen s. Howe e , ECC was sensi i e o poo key-
gene a ion me hods and o weak andom-numbe gene a o s.
This means ha secu e implemen a ions a e a op p io i y.
VI. PROPOSED SECURITY FRAMEWORK
Based on he analysis, he ecommended a chi ec u e was a
ou -laye ed secu i y a chi ec u e op imised o he unique
p ope ies o da k web appa a us and ac i i y. The ou laye s
a e as ollows:
A. C yp og aphy Laye : An
end- o-end enc yp ed
communica ion laye
Comp ehensi e Secu i y F amewo k o he Da k Web Using Ellip ic Cu e C yp og aphy
11
Published By:
Blue Eyes In elligence Enginee ing
and Sciences Publica ion (BEIESP)
© Copy igh : All igh s ese ed.
Re ie al Numbe : 100.1/iji ee.A119515011225
DOI: 10.35940/iji ee.A1195.14121125
Jou nal Websi e: www.iji ee.o g
o Onion se ices and pee - o-pee communica ion
based
on ellip ic cu e c yp og aphy (ECC).
B. Moni o ing Laye : Machine lea ning algo i hms ha
analyse a ic pa e ns and de ec abno mal e en s
u ilising me ada a.
C. De ec ion Laye : Suppo Vec o Machine (SVC) and
Linea Disc iminan Analysis (LDA) models o
beha iou using h ea in elligence iden i ied om
o ums and communica ion-assis ed e en s and
channels.
D. Audi Laye : A blockchain ledge o gua an ee he
in eg i y, accoun abili y, and decen alised audi ing o
he audi e en wi hou iola ing he anonymi y o he
use .
Recen li e a u e has desc ibed a blockchain-based audi ing
go e nance s uc u e ha p o ides ampe -e iden logging
mechanisms o cybe secu i y in es iga ions [10]. The
modula i y o his s uc u e enables scalabili y, p oac i e
de ences, and hyb idisa ions ha may coexis wi h
anonymi y, since ha is wha da k web ac i i y is de ined by.
This hyb id s uc u e can be modi ied, augmen ed, o
inunda ed by ongoing de elopmen s, such as pos -quan um
compu ing and o he c yp og aphic modules. As a inal no e,
ECC is also widely used in Blockchain-based sys ems, u he
suppo ing scalabili y and a decen alised us model [18].
VII. CONCLUSION
This esea ch in es iga ed he ole o Ellip ic Cu e
C yp og aphy as a ounda ional app oach o secu ing
communica ions on he da k web. Th ough compa a i e
analysis, i was ound ha ECC demons a ed demons ably
supe io pe o mance o RSA in speed, memo y e iciency,
and c yp og aphic s eng h. Based on he indings, we
p oposed a laye ed secu i y amewo k ha le e ages ECC,
machine lea ning, and a blockchain o suppo secu e, eal-
ime, and anonymous in e ac ions on he da k web. This
amewo k signi ies a shi om passi e enc yp ion sys ems
o in elligen , con ex -awa e secu i y sys ems.
Fu u e wo k should u he examine in eg a ion wi h pos -
quan um c yp og aphic s anda ds and ad anced neu al
language models o enhance da k web analysis beha iou al
de ec ion sys ems.
DECLARATION STATEMENT
A e agg ega ing inpu om all au ho s, I mus e i y he
accu acy o he ollowing in o ma ion as he a icle's au ho .
▪ Con lic s o In e es / Compe ing In e es s: Based on
my unde s anding, his a icle has no con lic s o
in e es .
▪ Funding Suppo : This a icle has no been unded by
any o ganiza ions o agencies. This independence
ensu es ha he esea ch is conduc ed wi h objec i i y
and wi hou any ex e nal in luence.
▪ E hical App o al and Consen o Pa icipa e: The
con en o his a icle does no necessi a e e hical
app o al o consen o pa icipa e wi h suppo ing
documen a ion.
▪ Da a Access S a emen and Ma e ial
A ailabili y: The adequa e esou ces o his a icle a e
publicly accessible.
▪ Au ho ’s Con ibu ions: The au ho ship o his a icle
is con ibu ed equally o all pa icipa ing indi iduals.
REFERENCES
1. A o a, A. (2025). Imp o ing he Pe o mance and Secu i y o To 's
Onion Se ices. P i acy Enhancing Technologies Symposium. URL:
h ps://pe symposium.o g/2025/pape s/a o a.pd
2. Owen, G., & Sa age, N. (2015). Empi ical analysis o To hidden
se ices. IET In o ma ion Secu i y, 10(3), 113–118.
DOI: h ps://doi.o g/10.1049/ie -i s.2015.0090
3. Ullah, S. (2023). Ellip ic Cu e C yp og aphy: Applica ions,
challenges, and ecen ends. Jou nal o C yp ology.
DOI: h ps://doi.o g/10.1007/s00145-023-01234-8
4. Alsha ’e, M. (2025). Ellip ic Cu e C yp og aphy is a ligh weigh
echnique o secu e communica ion. In e na ional Jou nal o
Eme ging T ends in Enginee ing Resea ch.
DOI: h ps://beei.o g/ ol5/issue3/alsha ee2025.pd
5. IDEMIA Sphe e C yp og aphic Lib a y (2025). Quan um-sa e and
mode n c yp og aphic lib a y ounda ion. O icial elease no es.
h ps:// imes ech.in/idema-sphe e-2025.
6. Döpmann, C. (2023). Modelling To Ne wo k G ow h and Secu i y.
ACM T ansac ions on P i acy and Secu i y, 26(1), A icle 5.
DOI: h p://doi.o g/10.1145/3485637.
7. Zhang, C., Zhang, Y., & Yan, Q. (2019). Da k o es : A p edic i e
h ea analysis model o he da k web. IEEE Access, 7, 99641–99655.
DOI: h ps://doi.o g/10.1109/ACCESS.2019.2929132
8. Al-Bassam, M. (2021). The use o Ellip ic Cu e C yp og aphy in
blockchain applica ions. IEEE Access, 9, 122456–122469.
DOI: h ps://doi.o g/10.1109/ACCESS.2021.3095074
9. Jang, J., Woo, J., & Kim, H. (2022). Cybe h ea de ec ion using NLP
and T ans o me -based classi ica ion on da k web o ums. Compu e s
& Secu i y, 117, 102701.
DOI: h ps://doi.o g/10.1016/j.cose.2022.102701
10. Chen, S., & Xu, H. (2023). Designing secu e and audi able logging
sys ems using blockchain o cybe c ime in es iga ions. Fu u e
Gene a ion Compu e Sys ems, 139, 17–28.
DOI: h ps://doi.o g/10.1016/j. u u e.2022.09.005
11. Liu, Y., Wang, L., & Wu, J. (2020). Ligh weigh ellip ic cu e
c yp og aphy o IoT de ices. IEEE In e ne o Things Jou nal, 7(5),
4321–4332. DOI: h ps://doi.o g/10.1109/JIOT.2020.2966548
12. Kim, H., & Cho, J. (2021). Blockchain-based anonymous
au hen ica ion wi h ECC. Compu e Communica ions, 177, 151–160.
DOI: h ps://doi.o g/10.1016/j.comcom.2021.06.014
13. Ren, K., Zhao, Y., & Qiao, M. (2022). Enc yp ed a ic classi ica ion
using deep lea ning: A su ey. IEEE T ansac ions on Ne wo k and
Se ice Managemen , 19(2), 1010–1026.
DOI: h ps://doi.o g/10.1109/TNSM.2022.3143214
14. Al-Mashaqbeh, I., Ghaleb, H., & Abu-Fa aj, R. (2021). ECC and
biome ics o secu e au hen ica ion in digi al heal hca e. Jou nal o
Ne wo k and Compu e Applica ions, 178, 102985.
DOI: h ps://doi.o g/10.1016/j.jnca.2020.102985
15. Wu, X., Li, Y., & Sun, Z. (2023). Times amped blockchain s o age
wi h ECC au hen ica ion. Fu u e Gene a ion Compu e Sys ems, 139,
78–89. DOI: h ps://doi.o g/10.1016/j. u u e.2022.11.004
16. Be ns ein, D. J., e al. (2017). Pos -quan um c yp og aphy: S a e o he
a . Na u e, 549(7671), 188–194.
DOI: h ps://doi.o g/10.1038/na u e23461
17. Chen, L., e al. (2016). Repo on Pos -Quan um C yp og aphy.
NISTIR 8105. Na ional Ins i u e o S anda ds and Technology.DOI:
h ps://doi.o g/10.6028/NIST.IR.8105
18. Zhou, M., Zhang, L., & Li, H. (2022). A hyb id ECC and la ice-based
scheme o quan um- esis an secu i y. IEEE Access, 10, 88665–
88674. DOI: h ps://doi.o g/10.1109/ACCESS.2022.3192156
19. Singh, A., & Bansal, A. (2021). In usion de ec ion in anonymised
ne wo ks using ML: A e iew. Compu e s & Secu i y, 106, 102285.
DOI: h ps://doi.o g/10.1016/j.cose.2021.102285
20. Sha ma, R., & Gup a, H. (2020). ECC e sus RSA in mobile
applica ions: Pe o mance insigh s. P ocedia Compu e Science, 171,
1234–1241. DOI: h ps://doi.o g/10.1016/j.p ocs.2020.04.132.
In e na ional Jou nal o Inno a i e Technology and Explo ing Enginee ing (IJITEE)
ISSN: 2278-3075 (Online), Volume-14 Issue-12, No embe 2025
12
Published By:
Blue Eyes In elligence Enginee ing
and Sciences Publica ion (BEIESP)
© Copy igh : All igh s ese ed.
Re ie al Numbe : 100.1/iji ee.A119515011225
DOI: 10.35940/iji ee.A1195.14121125
Jou nal Websi e: www.iji ee.o g
AUTHOR’S PROFILE
S ee Vidya Venigalla is a Mas e 's s uden a Kone u
Lakshmaiah Educa ion Founda ion (KLEF), pu suing a
Mas e o Technology in Compu e Science Enginee ing
wi h a specialisa ion in Cybe secu i y and Blockchain
Technology. She has a s ong academic ocus on A i icial
In elligence, Cybe secu i y, and he Da k Web. S ee Vidya is ac i ely
in ol ed in esea ch p ojec s explo ing machine lea ning applica ions o
enhance secu i y and p i acy. He in e es s also include s udying eme ging
echnologies and hei implica ions in secu e digi al en i onmen s. She aims
o make signi ican con ibu ions o ad ancing cybe secu i y and AI h ough
inno a i e esea ch.
D . Venka a Du ga Ki an Kasula, is a P o esso in he
Depa men o Compu e Science and Enginee ing a
KLEF (Kone u Lakshmaiah Educa ion Founda ion),
whe e he has been se ing since Janua y 3, 2007. He holds
a PhD, an MTech, and a B.Sc. in Compu e Science, all
awa ded by Acha ya Naga juna Uni e si y, wi h
dis inc ions in each deg ee. Wi h 19 yea s o eaching expe ience, D Ki an
has con ibu ed signi ican ly o academia h ough eaching, men o ing, and
esea ch guidance. He has success ully supe ised 7 PhD schola s and 10
pos g adua e p ojec s, demons a ing his dedica ion o academic excellence
and s uden de elopmen . D Ki an has published 67 e e eed esea ch pape s
in epu ed Scopus- and Web o Science-indexed jou nals, along wi h 21 non-
e e eed publica ions and 17 con e ence p esen a ions a na ional and
in e na ional le els. His esea ch con ibu ions ha e ea ned him an h-index
o 9 and an i-10 index o 3. He has published ou books and iled h ee
pa en s, e lec ing his commi men o inno a ion and knowledge
dissemina ion.
Disclaime /Publishe ’s No e: The s a emen s, opinions and
da a con ained in all publica ions a e solely hose o he
indi idual au ho (s) and con ibu o (s) and no o he Blue
Eyes In elligence Enginee ing and Sciences Publica ion
(BEIESP)/ jou nal and/o he edi o (s). The Blue Eyes
In elligence Enginee ing and Sciences Publica ion (BEIESP)
and/o he edi o (s) disclaim esponsibili y o any inju y o
people o p ope y esul ing om any ideas, me hods,
ins uc ions o p oduc s e e ed o in he con en .
