Expertise
- Computer Science Information Systems
Publications
Publications
No publication activity to display at the moment.
Scopus
h-index
0
CrossRef
Citations
0
h-index
0
Google Scholar
Loading Scholar statistics...
Professional Recognition
No Data Found
There is currently nothing to display here.
Community & Membership
No Data Found
There is currently nothing to display here.
No Data Found
There is currently nothing to display here.
Bio
Information Technology
Personal Details
- Female
- Assistant Professor , Malla Reddy Engineering College
- Maisammaguda Road, Maisamma Gudem, Bhadurpalle, Hyderabad, Telangana, India
Related Profiles
Experts (0)
Assistant Professor
Assistant Professor
N/A
Assistant Professor
Assistant Professor
Doctor
Assistant Professor (Grade-I)
Assistant Professor
Research Scholar
Junior Research Fellow
Organisations (339+)
View All
Assistant Professor
Professor
Professor
Associate Professor
Assistant Professor
Assistant Professor
Assistant Professor
Assistant Professor
Assistant Professor
Professor
Co-Authors (0)
Scholarly Work
and according to the
Funding Agency:
-0001 - Ongoing
it is important to address data security concerns.
Funding Agency:
N/A
which is generally regarded
Funding Agency:
N/A
integrity
Funding Agency:
and authentication.
N/A
and then it is encrypted and decrypted using the
Funding Agency:
N/A
there are numerous
Funding Agency:
N/A
the use of the cloud for both a technological and social reality.
Funding Agency:
N/A
it is an evolving technology
Funding Agency:
N/A
encryption
Funding Agency:
N/A
the need is far more significant. Therefore
Funding Agency:
N/A
Funding Agency:
N/A
asymmetric algorithms
Funding Agency:
N/A
while the receiver is the only one with access to secret key
Funding Agency:
N/A
a prime number
Funding Agency:
N/A
Adi Shamir
Funding Agency:
N/A
which was published in 1978 at the Massachusetts Institute of Technology
Funding Agency:
N/A
both the public and private keys are generated using a pair of prime
Funding Agency:
N/A
all of the plaintext is scrambled
Funding Agency:
N/A
Technical University
Funding Agency:
N/A
upon the selection of modulus
Funding Agency:
N/A
1
Funding Agency: 1 … t − 1) such
just one
N/A
there can be a compromise by factoring
Funding Agency:
N/A
the computation time will be great to factor
Funding Agency:
N/A
numerous studies have been done to discover more effective strategies for enhancing
Funding Agency:
N/A
while others paid more attention to enhancing data security. This paper's main goal is
Funding Agency:
N/A
the suggested approach aims to improve
Funding Agency:
N/A
Integrity (preventing
Funding Agency:
N/A
Availability (should be easily available to authorized
Funding Agency:
N/A
we will use the concept of RSA.
Funding Agency:
N/A
there is therefore the need for a review of literary works
Funding Agency:
N/A
the author put out a modified RSA
Funding Agency:
N/A
Wazery and Amin [10] proposed a different RSA variant that
Funding Agency:
N/A
first encrypting the
Funding Agency:
N/A
according to [11]. The client secured
Funding Agency:
N/A
for the assurance of correctness of the scheme
Funding Agency:
N/A
but it was
Funding Agency:
N/A
which first scrambles the data and then decodes it to reveal the
Funding Agency:
N/A
served as the foundation for their scheme. Utilizing R Prime RSA
Funding Agency:
N/A
which would be based on double prime values and is based on huge
Funding Agency:
N/A
Budiman et alwork .'s was further enhanced by [13]. The n-modulus is the
Funding Agency:
N/A
the greater the modulus. Therefore
Funding Agency:
N/A
decryption rates
Funding Agency:
N/A
Leena introduced an Enhanced RSA (ERSA) in [16] that introduces two
Funding Agency:
N/A
this seeks to reduce the execution time while enhancing the algorithm's
Funding Agency:
N/A
encrypted using RSA
Funding Agency:
N/A
Blowfish
Funding Agency:
N/A
respectively
Funding Agency:
N/A
AES
Funding Agency:
N/A
including Moment Difficulty
Funding Agency:
and Area
N/A
the scrambling is done
Funding Agency:
N/A
the encryption. There is still a gap
Funding Agency:
N/A
despite the numerous efforts to help develop algorithms to help
Funding Agency:
N/A
you typically either compile it or interpret it.
Funding Agency:
N/A
Python is a unique programming
Funding Agency:
N/A
the
Funding Agency:
N/A
who also
Funding Agency:
N/A
interpretation
Funding Agency:
N/A
understandable code for both small and large-scale projects.
Funding Agency:
N/A
is procedural
Funding Agency:
and
N/A
map
Funding Agency:
N/A
dict
Funding Agency:
N/A
PyCharm etc.
Funding Agency:
N/A
object-oriented programming language.
Funding Agency:
N/A
and
Funding Agency:
N/A
yet it's also a great language for data analysis.
Funding Agency:
N/A
making
Funding Agency:
N/A
machine learning is similar in that it
Funding Agency:
N/A
I believe there has never been a
Funding Agency:
N/A
the one you're using right now can probably finish most of this series
Funding Agency:
N/A
data science
Funding Agency:
N/A
large-scale data processing
Funding Agency:
N/A
Inc. created and keeps up with it. For Windows
Funding Agency:
N/A
and macOS
Funding Agency:
a package
N/A
is used to maintain packaged versions
Funding Agency:
N/A
so it
Funding Agency:
N/A
Funding Agency:
N/A
as well as a few other packages. Anaconda Console
Funding Agency:
N/A
various derived objects (like masked arrays and
Funding Agency:
N/A
and a variety of routines for quick operations on arrays are provided by this
Funding Agency:
N/A
discrete Fourier
Funding Agency:
N/A
elementary statistical procedures
Funding Agency:
and many more.
N/A
and many operations are performed quickly
Funding Agency:
N/A
NumPy arrays are created with a predetermined
Funding Agency:
N/A
Funding Agency:
N/A
including NumPy)
Funding Agency:
N/A
NumPy arrays make
Funding Agency:
N/A
they often transform it to NumPy arrays before
Funding Agency:
N/A
it's not enough to merely be familiar
Funding Agency:
N/A
see also the
Funding Agency:
N/A
time and calendar modules.
Funding Agency:
N/A
not all functions are available on all platforms.
Funding Agency:
N/A
which varies according on the platform
Funding Agency:
N/A
1970. (UTC). Consider the passage of time to identify
Funding Agency:
N/A
The number of seconds since the epoch is expressed as a sum of all seconds
Funding Agency:
N/A
which is commonly 2038 for 32-bit
Funding Agency:
N/A
is determined by the C library.
Funding Agency:
N/A
2-digit years are translated as follows: values
Funding Agency:
N/A
whereas values 0-69 are mapped for 1969–1999 .
Funding Agency:
N/A
or
Funding Agency:
N/A
Funding Agency:
N/A
which provides a
Funding Agency:
N/A
for flexibility
Funding Agency:
N/A
the various real-time
Funding Agency:
N/A
the clock only ticks 50
Funding Agency:
N/A
time() uses Unix gettimeofday() when
Funding Agency:
N/A
and sleep() will take a time with a nonzero
Funding Agency:
N/A
time() and sleep()
Funding Agency:
N/A
Funding Agency:
N/A
and strptime
Funding Agency:
strftime() and mktim
N/A
strptime() and localtime().
Funding Agency:
N/A
as of
Funding Agency:
N/A
the os.path module can
Funding Agency:
N/A
and the file input module can be applied to read every line in
Funding Agency:
N/A
and the shutil module should be utilised to handle high-level file and
Funding Agency:
N/A
the function os.stat(path) gives stat information about path in the same manner
Funding Agency:
N/A
Access is provided by the OS module to extensions specific to a given
Funding Agency:
N/A
although using them obviously compromises portability.
Funding Agency:
N/A
nd an
Funding Agency:
N/A
os.popen
Funding Agency:
or os.spawn*p*.
N/A
financial institutions
Funding Agency:
N/A
according to the National Security Agency
Funding Agency:
N/A
for
Funding Agency:
N/A
is utilised to provide pervasive encryption
Funding Agency:
N/A
by the IBM z14 mainframe series. The symmetric algorithm AES
Funding Agency:
N/A
192
Funding Agency:
N/A
even with a 128-bit key
Funding Agency:
N/A
and given the technological state is expected to remain
Funding Agency:
N/A
it has the drawback of using the same key for both
Funding Agency:
N/A
but decrypts using a key that is only known towards the direction of the
Funding Agency:
N/A
Funding Agency:
N/A
2048
Funding Agency:
in order to use
N/A
you must comprehend the two essential components of that product. Since
Funding Agency:
N/A
only the individual who
Funding Agency:
N/A
and it
Funding Agency:
N/A
operating environment
Funding Agency:
N/A
input formats
Funding Agency: detailed design
user interfaces
N/A
and external interfaces are all covered in the modules at System Design.
Funding Agency:
N/A
he can download the file
Funding Agency:
N/A
and anyone
Funding Agency:
N/A
signatures cannot be faked. Furthermore
Funding Agency:
N/A
such
Funding Agency:
N/A
in addition to electronic mail. The challenge of factoring very large integers
Funding Agency:
N/A
where p and q are large prime numbers
Funding Agency:
N/A
E and D
Funding Agency:
N/A
which in RSA are specifically sets of two unique numbers. Of course
Funding Agency:
N/A
represented by the letter M. A public-
Funding Agency:
N/A
specifically D(E(M)) = M . (1) b)
Funding Agency:
N/A
there is still no efficient method for calculating D. If
Funding Agency:
N/A
then trying to figure out D by trying to satisfy an M in E(M) = C
Funding Agency:
N/A
(c)
Funding Agency:
N/A
but otherwise hard. It is one-way because it is
Funding Agency:
N/A
but hard in the other. Because it satisfies (b)
Funding Agency:
N/A
it is a
Funding Agency:
N/A
only signatures are required as stated in statement (b). Now that we
Funding Agency:
N/A
consider users A and B (Alice and Bob) on a two-user public-
Funding Agency:
N/A
EB
Funding Agency:
DB.
N/A
encryption has become a common
Funding Agency:
N/A
which is effectively
Funding Agency:
N/A
like the NBS standard
Funding Agency:
N/A
which is an additional step that would make NBS
Funding Agency: ineffective
slow
N/A
with RSA being used solely for securely transmitting
Funding Agency:
N/A
would it be of any use. Consequently
Funding Agency:
N/A
a powerful computing method of D must be discovered. If it's reliable
Funding Agency:
N/A
which is simpler to compute on a general-purpose
Funding Agency:
N/A
which require better hardware
Funding Agency:
N/A
Bob wishes to contact Alice privately. He will retrieve EA
Funding Agency:
N/A
Alice then decodes that using her own DA
Funding Agency:
N/A
all that is necessary for both users to agree to utilise the
Funding Agency:
N/A
no eavesdropper may infer D by
Funding Agency:
N/A
and was not just sent
Funding Agency:
N/A
we need a digital signature to come with the message. This clearly has important
Funding Agency:
N/A
presuming RSA algorithm is fast and trustworthy mainly owing
Funding Agency:
N/A
which state that every message is the
Funding Agency:
N/A
DB(M) = S. (3) We next use Alice's encryption
Funding Agency:
N/A
we can assure only she is able to decrypt document. When she does
Funding Agency:
N/A
she is now certain that
Funding Agency:
N/A
No separate delivery of the
Funding Agency:
N/A
and Bob's encrypted message is dependent on S
Funding Agency:
N/A
so both can be deduced from its
Funding Agency:
N/A
for example)
Funding Agency:
N/A
which is impossibly as she is not acquainted with DB by property (d). Therefore
Funding Agency:
N/A
but she also cannot
Funding Agency:
N/A
supposing a intruder tried
Funding Agency:
N/A
Funding Agency:
N/A
which is saved on their system
Funding Agency:
N/A
he would
Funding Agency:
N/A
since he never joined it.
Funding Agency:
N/A
predictions
Funding Agency:
N/A
ensuring the security of financial information. Additional steps would need
Funding Agency:
N/A
including implementing distinct check numbers that would only permit one check
Funding Agency:
N/A
RSA would be
Funding Agency:
N/A
These are the things
Funding Agency:
N/A
we anticipate making E and D are simple to compute using basic arithmetic. We
Funding Agency:
N/A
n) Let d
Funding Agency:
n and e be positive
N/A
n) is the decryption key
Funding Agency:
the
N/A
we now encrypt the information by elevating it to a ninth power modulo n. Then
Funding Agency:
N/A
we raise C to a dth power modulo. For E and D
Funding Agency:
N/A
decryption algorithms: Me (mod n) = C E(M) (5) M D C d
Funding Agency:
N/A
It is to be noted that the information size remains constant. Also note
Funding Agency:
N/A
n) (d
Funding Agency:
N/A
but we'll focus on the
Funding Agency:
N/A
Funding Agency:
N/A
p and also q
Funding Agency:
N/A
It will not reveal p
Funding Agency:
ensuring
N/A
which means that
Funding Agency:
N/A
(p 1) *(q 1)) = 1. (6) gcd is an abbreviation for
Funding Agency:
N/A
It will develop
Funding Agency:
N/A
p
Funding Agency:
where e is d's mult
N/A
e · d = 1 (mod φ(n)) . (7) Here
Funding Agency:
N/A
which returns the number of integers
Funding Agency:
N/A
this clearly becomes φ(p) = p − 1 . For n
Funding Agency:
N/A
that φ(n) = φ(p) * φ(q) = (p − 1) *(q − 1) (8) = n
Funding Agency:
N/A
since d and φ(n) are co-prime
Funding Agency:
N/A
we can rest assured of the following:: D(E(M)) ≡
Funding Agency:
N/A
since e · d = k · φ(n) + 1
Funding Agency:
we can rest assured
N/A
we want it to equal M. To demonstrate this
Funding Agency:
N/A
we have Mφ(n) ≡ 1 (mod n) . (9) Because we previously stated that 0 ≤ M < n
Funding Agency:
N/A
then
Funding Agency:
among some of the
N/A
the likelihood of M occurring is increased to be p or
Funding Agency:
N/A
therefore equation (9) holds and
Funding Agency:
we evaluate: Me·d ≡
N/A
and
Funding Agency:
N/A
0 ≤ M < n. Therefore D and E are inverse
Funding Agency:
N/A
decryption operations:
Funding Agency:
N/A
3b for i =
Funding Agency:
N/A
k − 1
Funding Agency:
0: Step 3a. Set C t
N/A
but this one is good too. Also
Funding Agency:
N/A
we can implement the whole operation on
Funding Agency:
N/A
“the encryption time per block
Funding Agency:
N/A
decryption of keys. But the p q numbers whose product
Funding Agency:
N/A
will not be explicitly shown. They are almost impossible to deduce. Indeed
Funding Agency:
N/A
especially if we choose 100-digit primes p
Funding Agency:
N/A
today we must use far larger numbers. The scale of these
Funding Agency:
N/A
q. To do such thing
Funding Agency: random odd
say
N/A
there will be about (ln 10100)/2 = 115 number to test. To test a large
Funding Agency:
N/A
we can use an algorithm due to Solovay and Strassen. First
Funding Agency:
N/A
...
Funding Agency: b)
b) = 1 and J(a
N/A
No Data Found
There is currently nothing to display here.
No Data Found
There is currently nothing to display here.