The security of Diffie-Hellman relies on the difficulty of the discrete logarithm problem. This project describes attempts to determine what size primes are required for security. In particular, evaluate the secure identification option of the Sun Network File System, which uses Diffie-Hellman algorithm with a prime p of 192 bits.
Objectives:
•
To describe the different steps necessary to solve the discrete logarithm problem (DLP).
•
To discuss the state-of-the-art results obtained for the solution of DLP.
•
Present the SUN NFS cryptosystem, and discuss some of its deficiencies.
•
Recommendations in order to have a secure size for the prime number p used in the Diffie-Hellman algorithm.
Your proposal should include:
a.
Abstract
b.
Table of contents
Your report organization is very important. You should lay out ideas in logical order and build arguments piece by piece, grouping related ideas and sentences into paragraphs and paragraphs into sections.
When writing a report you should consider:
1.
Communicative quality
2.
Ideas and organization
3.
Grammar and vocabulary
4.
Punctuation and spelling
Your report organization is very important. You should lay out ideas in logical order and build arguments piece by piece, grouping related ideas and sentences into paragraphs and paragraphs into sections.
Pay attention to your writing style:
1.
Use a natural language style
2.
Avoid jargon, slang, and colloquial terms
3.
Define technical terms
4.
Avoid repetition and vague language
5.
Be precise and specific
6.
Use active rather than passive voice
7.
Avoid presenting too many details and personal observations
8.
Include signposts
Your report should not be less than 1,000 words in length and should be submitted in MS Word, arial 12-pt font, with double spacing.
Use the order calculator below and get started! Contact our live support team for any assistance or inquiry.
[order_calculator]