Jump to content
Sign in to follow this  

MATHEMATICS - Extended Essay - Cryptography - HelPls

Recommended Posts

i have a topic now but i aint sure if it is proper.

To What Extent Are Asymmetric Ciphers More Safe and More Used Than Symmetric Ciphers

pls tell me what you think about it.

the only other person in my school that is doing maths ee is doing something on sundials.

i guess she can actually show workings and equations on how to make a sundial.

is that possible with the above topic?

the following is my short outline...

but i dont think in any point in time of this essay, i am actually going to show proper mathematical equations and workings. i can probably include them when talking about the ciphers for example for the RSA algorithm.

1) Asymmetric ciphers

a) What are they

b) Where and when are they used

c) Two examples of them

2) Symmetric ciphers

a) What are they

b) Where and when are they used

c) Two examples of them

3) Types of attacks

a) Compare each of the ciphers with one another

4) How both ciphers are used

5) Examples when/how/where the ciphers are used

6) Bring about a product

a) Say what cipher you would recommend them

b) And why?

c) Talk about money too

Edited by msubr1

Share this post


Link to post
Share on other sites

Your topic needs to be revised:

To What Extent Are Asymmetric Ciphers More Safe and More Used Than Symmetric Ciphers

First of all, you need to remove the "More Used" part, there's no point in investigating how used they are in a Math EE. It isn't very analytical either. I'd also rephrase the topic:

"To what extent can assymetric ciphers be considered safer than symmetric ciphers?"

It's still a bit general, so if you think assymetric ciphers (i dont know what they are :( ) safer, you could answer the question:

"To what extent does X (and Y) contribute to making assymetric ciphers safer than symmetric ciphers?"

However, you WILL need mathematical proofs and working to get a proper grade in your EE. You're looking at a C or D tops without proofs and proper maths.

This part has to form the body of your EE, i.e. it should be the longest:

"3) Types of attacks a) Compare each of the ciphers with one another"

Parts 1 and 2 shouldn't be too long.

5) MATHEMATICAL Examples when/how/where the ciphers are used

6) Bring about a product

a) Say what cipher you would recommend them

b) And why?

c) Talk about money too

Share this post


Link to post
Share on other sites

hi i am not sure if i can include enough mathematical material so i started looking for other options.

could you pls comment on the following topic?

the extent to which mathematics has contributed to cryptography.

Share this post


Link to post
Share on other sites

Much too general, as I replied in my PM. You'll fail to achieve anything higher than a D, possibly even an E with that topic.

Share this post


Link to post
Share on other sites

thanks again

i feel hopeless now.

would it be good if i changed the topic to -> the contribution of Number Theory to Asymmetric Cryptography.

(is the topic too general again)

i can talk about how prime numbers are generated using fermat's little theorem and show mathematical equations and heaps like that. but i wont be able to INVENT any new things.

would that be ok or should i think of a new topic/subject.

and how much words should i be aiming at?

Share this post


Link to post
Share on other sites

Why are you insistent on doing your EE in Maths? Choose something easier, where you won't spend as much time on as a Maths EE, so that you concentrate on your other subjects.

Besides, a Maths/Science EE rarely goes past a C.

Share this post


Link to post
Share on other sites

yeah i would seriously like to do it on something else.

but i dont have any other areas of liking.

and my teacher said that i am not supposed to change it anymore.

and i need to concentrate on my other subjects. thx for the advice.

but i would prefer if you could give me advice on my topic rather than my subject

Share this post


Link to post
Share on other sites

New Topic - The extent to which Factors, Modular Arithmetic and primality tests from the number theory has contributed in asymmetric cryptography.

Number Theory

§ Factors

Ø Euclidean Algorithm

Ø Greatest Common Divisor

Ø Factorisation (RSA)

§ Modular Arithmetic

Ø Chinese Remainder Theorem

Ø Just a bit of mod

§ Computational Number Theory

Ø Miller-Rabin primality test

i am going to talk about all these...

too general again?

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
Sign in to follow this  

×

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.