Vidwan Image

Ms . BANDARI PRAGATHI

vidwan id: 443138

Assistant Professor, N/A, Malla Reddy Engineering College

Expertise

  • Computer Science Information Systems
    • View All

Publications

Total Articles 0
Books 0
Proceedings 0

Publications 1992-2022

Scopus

Citations 0
h-index 0

CrossRef

CrossRef Icon
Citations 0
h-index 0

Google Scholar

Loading Scholar statistics...

Honours and Awards

No awards available.

Professional Recognition

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
  • Malla Reddy Engineering College
  • Maisammaguda Road, Maisamma Gudem, Bhadurpalle, Hyderabad, Telangana, India - 500100
M.Tech
Other Institute 2023
Assistant Professor 2023 – Present
Malla Reddy Engineering College

Related Profiles

Experts (7159+)

Dr Brindha D

Computer Science Information Systems

Ms Brinda Sampat

Computer Science Information Systems

Ms Brindaba Zala Assistant Professor

Computer Science Information Systems

Dr Brindha K

Computer Science Information Systems

Brindha

Brindha S

Computer Science Information Systems

Dr BRINDHA T

Computer Science Information Systems

Ms Brindha K

Computer Science Information Systems

Brindha

Dr Brindha T

Computer Science Information Systems

M

Dr M Brindha

Computer Science Information Systems

Brindha

Brindha G

Computer Science Information Systems

Organisations (124+)

Dr Suneela Bhoompally

Malla Reddy Engineering College

Salendra

Salendra Sriharshitha

Malla Reddy Engineering College

Gnaneswari

Gnaneswari Bodana

Malla Reddy Engineering College

Asmita Ambekar

Malla Reddy Engineering College

Dr Asa Jyothi Gudavalli

Malla Reddy Engineering College

Sama Bharathi

Malla Reddy Engineering College

Anitha Reddy

Anitha Reddy K

Malla Reddy Engineering College

K

K Anuradha

Malla Reddy Engineering College

VADLA

VADLA ANUJA

Malla Reddy Engineering College

Adepu

Adepu Krishnaveni

Malla Reddy Engineering College

Scholarly Work

it is important to address data security concerns.
Working
which is generally regarded
Working
integrity

and authentication.

Working
and then it is encrypted and decrypted using the
Working
there are numerous
Working
the use of the cloud for both a technological and social reality.
Working
it is an evolving technology
Working
encryption
Working
the need is far more significant. Therefore
Working
Working
asymmetric algorithms
Working
while the receiver is the only one with access to secret key
Working
a prime number
Working
Adi Shamir
Working
which was published in 1978 at the Massachusetts Institute of Technology
Working
both the public and private keys are generated using a pair of prime
Working
all of the plaintext is scrambled
Working
Technical University
Working
upon the selection of modulus
Working
1

Funding Agency: 1 … t − 1) such

just one

Working
there can be a compromise by factoring
Working
the computation time will be great to factor
Working
numerous studies have been done to discover more effective strategies for enhancing
Working
while others paid more attention to enhancing data security. This paper's main goal is
Working
the suggested approach aims to improve
Working
Integrity (preventing
Working
Availability (should be easily available to authorized
Working
we will use the concept of RSA.
Working
there is therefore the need for a review of literary works
Working
the author put out a modified RSA
Working
Wazery and Amin [10] proposed a different RSA variant that
Working
first encrypting the
Working
according to [11]. The client secured
Working
for the assurance of correctness of the scheme
Working
but it was
Working
which first scrambles the data and then decodes it to reveal the
Working
served as the foundation for their scheme. Utilizing R Prime RSA
Working
which would be based on double prime values and is based on huge
Working
Budiman et alwork .'s was further enhanced by [13]. The n-modulus is the
Working
the greater the modulus. Therefore
Working
decryption rates
Working
Leena introduced an Enhanced RSA (ERSA) in [16] that introduces two
Working
this seeks to reduce the execution time while enhancing the algorithm's
Working
encrypted using RSA

Working
Blowfish
Working
respectively
Working
AES
Working
including Moment Difficulty

and Area

Working
the scrambling is done
Working
the encryption. There is still a gap
Working
despite the numerous efforts to help develop algorithms to help
Working
you typically either compile it or interpret it.
Working
Python is a unique programming
Working
the
Working
who also
Working
interpretation
Working
understandable code for both small and large-scale projects.
Working
is procedural

and

Working
map
Working
dict
Working
PyCharm etc.
Working
object-oriented programming language.
Working
and
Working
yet it's also a great language for data analysis.
Working
making
Working
machine learning is similar in that it
Working
I believe there has never been a
Working
the one you're using right now can probably finish most of this series
Working
data science
Working
large-scale data processing
Working
Inc. created and keeps up with it. For Windows
Working
and macOS

a package

Working
is used to maintain packaged versions
Working
so it
Working
Working
as well as a few other packages. Anaconda Console
Working
various derived objects (like masked arrays and
Working
and a variety of routines for quick operations on arrays are provided by this
Working
discrete Fourier
Working
elementary statistical procedures

and many more.

Working
and many operations are performed quickly
Working
NumPy arrays are created with a predetermined
Working
Working
including NumPy)
Working
NumPy arrays make
Working
they often transform it to NumPy arrays before
Working
it's not enough to merely be familiar
Working
see also the
Working
time and calendar modules.
Working
not all functions are available on all platforms.
Working
which varies according on the platform
Working
1970. (UTC). Consider the passage of time to identify
Working
The number of seconds since the epoch is expressed as a sum of all seconds
Working
which is commonly 2038 for 32-bit
Working
is determined by the C library.
Working
2-digit years are translated as follows: values
Working
whereas values 0-69 are mapped for 1969–1999 .
Working
or
Working
Working
which provides a
Working
for flexibility
Working
the various real-time
Working
the clock only ticks 50
Working
time() uses Unix gettimeofday() when
Working
and sleep() will take a time with a nonzero
Working
time() and sleep()
Working
Working
and strptime

strftime() and mktim

Working
strptime() and localtime().
Working
as of
Working
the os.path module can
Working
and the file input module can be applied to read every line in
Working
and the shutil module should be utilised to handle high-level file and
Working
the function os.stat(path) gives stat information about path in the same manner
Working
Access is provided by the OS module to extensions specific to a given
Working
although using them obviously compromises portability.
Working
nd an
Working
os.popen

or os.spawn*p*.

Working
financial institutions
Working
according to the National Security Agency
Working
for
Working
is utilised to provide pervasive encryption
Working
by the IBM z14 mainframe series. The symmetric algorithm AES
Working
192
Working
even with a 128-bit key
Working
and given the technological state is expected to remain
Working
it has the drawback of using the same key for both
Working
but decrypts using a key that is only known towards the direction of the
Working
Working
2048

in order to use

Working
you must comprehend the two essential components of that product. Since
Working
only the individual who
Working
and it
Working
operating environment

Working
input formats

Funding Agency: detailed design

user interfaces

Working
and external interfaces are all covered in the modules at System Design.
Working
he can download the file
Working
and anyone
Working
signatures cannot be faked. Furthermore
Working
such
Working
in addition to electronic mail. The challenge of factoring very large integers
Working
where p and q are large prime numbers
Working
E and D
Working
which in RSA are specifically sets of two unique numbers. Of course
Working
represented by the letter M. A public-
Working
specifically D(E(M)) = M . (1) b)
Working
there is still no efficient method for calculating D. If
Working
then trying to figure out D by trying to satisfy an M in E(M) = C
Working
(c)
Working
but otherwise hard. It is one-way because it is
Working
but hard in the other. Because it satisfies (b)
Working
it is a
Working
only signatures are required as stated in statement (b). Now that we
Working
consider users A and B (Alice and Bob) on a two-user public-
Working
EB

DB.

Working
encryption has become a common
Working
which is effectively
Working
like the NBS standard
Working
which is an additional step that would make NBS

Funding Agency: ineffective

slow

Working
with RSA being used solely for securely transmitting
Working
would it be of any use. Consequently
Working
a powerful computing method of D must be discovered. If it's reliable
Working
which is simpler to compute on a general-purpose
Working
which require better hardware
Working
Bob wishes to contact Alice privately. He will retrieve EA
Working
Alice then decodes that using her own DA
Working
all that is necessary for both users to agree to utilise the
Working
no eavesdropper may infer D by
Working
and was not just sent
Working
we need a digital signature to come with the message. This clearly has important
Working
presuming RSA algorithm is fast and trustworthy mainly owing
Working
which state that every message is the
Working
DB(M) = S. (3) We next use Alice's encryption
Working
we can assure only she is able to decrypt document. When she does
Working
she is now certain that
Working
No separate delivery of the
Working
and Bob's encrypted message is dependent on S
Working
so both can be deduced from its
Working
for example)
Working
which is impossibly as she is not acquainted with DB by property (d). Therefore
Working
but she also cannot
Working
supposing a intruder tried
Working
Working
which is saved on their system
Working
he would
Working
since he never joined it.
Working
predictions
Working
ensuring the security of financial information. Additional steps would need
Working
including implementing distinct check numbers that would only permit one check
Working
RSA would be
Working
These are the things
Working
we anticipate making E and D are simple to compute using basic arithmetic. We
Working
n) Let d

n and e be positive

Working
n) is the decryption key

the

Working
we now encrypt the information by elevating it to a ninth power modulo n. Then
Working
we raise C to a dth power modulo. For E and D
Working
decryption algorithms: Me (mod n) = C E(M) (5) M D C d
Working
It is to be noted that the information size remains constant. Also note
Working
n) (d
Working
but we'll focus on the
Working
Working
p and also q
Working
It will not reveal p

ensuring

Working
which means that
Working
(p 1) *(q 1)) = 1. (6) gcd is an abbreviation for
Working
It will develop
Working
p

where e is d's mult

Working
e · d = 1 (mod φ(n)) . (7) Here
Working
which returns the number of integers
Working
this clearly becomes φ(p) = p − 1 . For n

Working
that φ(n) = φ(p) * φ(q) = (p − 1) *(q − 1) (8) = n
Working
since d and φ(n) are co-prime
Working
we can rest assured of the following:: D(E(M)) ≡
Working
since e · d = k · φ(n) + 1

we can rest assured

Working
we want it to equal M. To demonstrate this
Working
we have Mφ(n) ≡ 1 (mod n) . (9) Because we previously stated that 0 ≤ M < n
Working
then

among some of the

Working
the likelihood of M occurring is increased to be p or
Working
therefore equation (9) holds and

we evaluate: Me·d ≡

Working
and
Working
0 ≤ M < n. Therefore D and E are inverse
Working
decryption operations:
Working
3b for i =
Working
k − 1

0: Step 3a. Set C t

Working
but this one is good too. Also
Working
we can implement the whole operation on
Working
“the encryption time per block
Working
decryption of keys. But the p q numbers whose product
Working
will not be explicitly shown. They are almost impossible to deduce. Indeed
Working
especially if we choose 100-digit primes p
Working
today we must use far larger numbers. The scale of these
Working
q. To do such thing

Funding Agency: random odd

say

Working
and according to the

-0001 Present

Working
there will be about (ln 10100)/2 = 115 number to test. To test a large
Working
we can use an algorithm due to Solovay and Strassen. First
Working
...

Funding Agency: b)

b) = 1 and J(a

Working
No Data Found

There is currently nothing to display here.

No Data Found

There is currently nothing to display here.

Scholarly Publications

No publications found.