KFUPM Cryptosystem Algorithms and Data Structures System Presentation

User Generated

zbunzznf

Computer Science

King Fahd University of Petroleum and Minerals

Description

In this project, you will do some cryptanalysis and experiment some attacks on RSA. You need to report the necessary details related to each attack. This project requires additional readings on RSA attacks and programming skills for the implementation. Problem and Requirements: (Please see the Blackboard/Discussion for updates) Given an RSA scheme, your goal is to find some weakness in the scheme by implementing and testing some of known RSA attack. In each of the following attack, you need to setup an RSA scheme with certain parameters that allow you to demonstrate the attack. You may consider the following attacks: (a) Factorization (b) Chose-ciphertext attack (c) Encryption exponent (d) Decryption exponent (e) Plaintext (short messages, cyclic, unconcealed, …etc.) (f) Common modulus (g) Timing attack Evaluation: The evaluation of this project is based on the quality of the examples presented in each attack. Decent examples get high evaluations, while trivial examples may get poor evaluation.

User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

Explanation & Answer

Attached. Please let me know if you have any questions or need revisions.

Running head: CRYPTOSYSTEM PROJECT REPORT

Cryptosystem Project Report
Name
Institution

1

CRYPTOSYSTEM PROJECT REPORT
Introduction
The science, which is concerned majorly with the planning of the available codes, defines
cryptography by analyzing the breaking figures depicting the cryptoanalysis. The available
rendition, which is concerned with rearranging the RSA type of encryption, marks our starting
point of analysis. Assuming M = R*S defines big numbers of the same size, and F and G defines
double digits that justify FG modulus(N) where modulus(N)=(R-1)(S-1) establishes the capacity
of the N. the terms used to determine N and the RSA modules with the e becoming the type of
encryption and the d recalling the unscrambling style. The two variables n, e is used to encode
the messages and termed as the public key according to batina 2004, page 252 of the book. The
variables N and d benefit from the encryption forming the private keys to producing the
ciphertexts to be used. M can denote the ciphertext message with variable C used to encipher the
news and defined it as one process. The figures resembling C d m...


Anonymous
Just what I needed…Fantastic!

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4

Similar Content

Related Tags