Normal view MARC view ISBD view

An enhancement of RSA Algorithm in data encryption applied in a LAN messaging application / JANSSEN R. LIM JR. and KENNETH RASE. 6

By: Lim, Janssen R. JR. and Rase, Kenneth. 4 0 16, [, ] | [, ] |

Contributor(s): 5 6 [] |

Language: Unknown language code Summary language: Unknown language code Original language: Unknown language code Series: ; March 2017.46Edition: Description: 28cm. xiv, 32pContent type: text Media type: unmediated Carrier type: volumeISBN: ISSN: 2Other title: 6 []Uniform titles: | | Related works: 1 40 6 []Subject(s): -- 2 -- 0 -- -- | -- 2 -- 0 -- 6 -- | 2 0 -- | -- -- 20 -- | | -- -- -- -- 20 -- | -- -- -- 20 -- --Genre/Form: -- 2 -- Additional physical formats: DDC classification: | LOC classification: | | 2Other classification:

Contents:

Action note: In: Summary: Abstract Modern-day computer security relies heavily on encryption as a mean to protect the data that we have become increasingly reliant on. Encryption is the process of scrambling messages so that only the intended recipient can read it. It can provide a means of securing information. RSA Algorithm is an asymmetric cryptosystem for public-key encryption. RSA Algorithm was first described in 1977 by Ron Rivest, Adi Shamir and Leonard Adleman of the Massachusetts Institute of Technology. The first problem that we, the researchers, have found is that in the existing RSA Algorithm, there is no assurance that the private key holder would get the ciphered message (C) from the expected sender. So, the researchers proposed algorithm is to create digital signature to be attached in the ciphered message for the assurance that the sender would be the true or real sender. The second problem that the researchers had found is the weakness of security of RSA Algorithm. RSA Algorithm uses two prime numbers to be used as p and q. And having used of small p and q will enfeeble the security of the algorithm. In this problem, we proposed ¬¬¬¬to create a module that will automatically generate prime numbers, p and q, depending on the length of the message as a solution. The last problem is another security issue. Beside the prime numbers p and q, RSA Algorithm uses another important number, the d, it is used for encrypting messages or the data you wanted to encrypt. We proposed to create a module that will generate a random value of d, such that d>e. Other editions:

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes
Comments ( 0 )

Item type	Current location	Home library	Collection	Call number	Status	Date due	Barcode	Item holds
Book	PLM	PLM Filipiniana Section	Filipiniana-Thesis	T QA76.9.L56.2017 (Browse shelf)	Available		FT6048

Total holds: 0

Browsing PLM Shelves , Shelving location: Filipiniana Section , Collection code: Filipiniana-Thesis Close shelf browser

Previous	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	Next
Previous	T QA76.9.J36.2017 An enhancement of the burrows-wheeler compression algorithm applied in BZIP2 /	T QA76.9.J38.2023 Enhanced profile hidden markov model for the metamorphic malware detection /	T QA76.9.L38.2016 An enhancement of the gibberish classification algorithm for detecting gibberish content in text document /	T QA76.9.L56.2017 An enhancement of RSA Algorithm in data encryption applied in a LAN messaging application /	T QA76.9.L66.2017 Enhancement of MD5 cryptographic hash algorithm /	T QA76.9.L67.2019 Shortstraw algorithm applied in draw-a-person test using android mobile applicants /	T QA76.9.M36.2018 A further enhancement of RSA Algorithm applied in a client-server architecture /	Next

Thesis: (BSCS major in Computer Science)- Pamantasan ng Lungsod ng Maynila 2017. 56

Abstract Modern-day computer security relies heavily on encryption as a mean to protect the data that we have become increasingly reliant on. Encryption is the process of scrambling messages so that only the intended recipient can read it. It can provide a means of securing information. RSA Algorithm is an asymmetric cryptosystem for public-key encryption. RSA Algorithm was first described in 1977 by Ron Rivest, Adi Shamir and Leonard Adleman of the Massachusetts Institute of Technology. The first problem that we, the researchers, have found is that in the existing RSA Algorithm, there is no assurance that the private key holder would get the ciphered message (C) from the expected sender. So, the researchers proposed algorithm is to create digital signature to be attached in the ciphered message for the assurance that the sender would be the true or real sender. The second problem that the researchers had found is the weakness of security of RSA Algorithm. RSA Algorithm uses two prime numbers to be used as p and q. And having used of small p and q will enfeeble the security of the algorithm. In this problem, we proposed ¬¬¬¬to create a module that will automatically generate prime numbers, p and q, depending on the length of the message as a solution. The last problem is another security issue. Beside the prime numbers p and q, RSA Algorithm uses another important number, the d, it is used for encrypting messages or the data you wanted to encrypt. We proposed to create a module that will generate a random value of d, such that d>e.

There are no comments for this item.

to post a comment.