EPTP.S. I was thinking of doing the Enigma, but there are already two groups in my class of 12 people doing it, and that wouldn't work.
Ideas for Cryptography project
| Blogs > TeabagInsurance |
|
TeabagInsurance
Canada320 Posts
P.S. I was thinking of doing the Enigma, but there are already two groups in my class of 12 people doing it, and that wouldn't work. | ||
|
lac29
United States1485 Posts
Found it: http://en.wikipedia.org/wiki/Kryptos | ||
|
TeabagInsurance
Canada320 Posts
 | ||
|
illu
Canada2531 Posts
| ||
|
TeabagInsurance
Canada320 Posts
| ||
|
illu
Canada2531 Posts
On March 16 2010 03:11 TeabagInsurance wrote: Err, what? Just wondering if your professor is G Pete. | ||
|
NrG.Bamboo
United States2756 Posts
The end of the semester for school is near, and for my Cryptography class we have to do a project on something Cryptography related. D: | ||
|
Exteray
United States1094 Posts
| ||
|
Manit0u
Poland17695 Posts
The idea of a magic square is pretty neat in itself: http://en.wikipedia.org/wiki/Magic_square Edit: Or you could just go through a Crypto-Gram Newsletter archive and find something there. I've subscribed to it ages ago as it has some really cool articles about online security and stuff like that. http://www.schneier.com/crypto-gram.html | ||
|
caelym
United States6421 Posts
| ||
|
Scorch
Austria3371 Posts
RSA is a very elegant mechanism and interesting to explain and understand. Also explain the advantages and applications of public key cryptosystems while you're at it. Or demonstrate a transposition cypher, that should work well on the blackboard. | ||
|
TeabagInsurance
Canada320 Posts
Nope, never heard of him. On March 16 2010 04:35 Valentine wrote: Sorry I can't help you but I laughed really really hard reading this: D: Actually it's kind of funny because that's exactly how he said it to us when he told us. I guess it's not completely weird though, because last year our end project didn't have to be related to the curriculum On March 16 2010 04:38 Exteray wrote: Go through a simple example to encode a message using RSA public key? That's what I did for my Information Age class.. it's actually pretty fun and the math behind is quite elegant ;-) That's possible, as we've been going over RSA the past couple weeks. Today in class actually the teacher was writing code that does exactly that with Maple on the projecter. | ||
|
Newbistic
China2912 Posts
+ Show Spoiler + ![[image loading]](http://www.zodiackiller.com/images/340cipher.gif) | ||
|
illu
Canada2531 Posts
On March 16 2010 10:51 TeabagInsurance wrote: Nope, never heard of him. Actually it's kind of funny because that's exactly how he said it to us when he told us. I guess it's not completely weird though, because last year our end project didn't have to be related to the curriculum That's possible, as we've been going over RSA the past couple weeks. Today in class actually the teacher was writing code that does exactly that with Maple on the projecter. Never heard of him? I guess you are not in UofT then  | ||
|
JodoYodo
Canada1772 Posts
| ||
|
Sirakor
Great Britain455 Posts
If somebody else is already doing RSA, you could demonstrate one of the weaknesses of RSA, i.e. that if you have knowledge of the public key and keep encrypting the message with it, you will eventually get back to clear-text, and a lot faster than trying to factorize to get the private key. So if something was encrypted that can easily be verified whether you have arrived at cleartext (a text message in a known language for example), things become interesting ... Or on a related topic you could demonstrate how to play rock-paper-scissors (or poker, same idea, just more complicated) over the phone. Two more ideas: compression algorithms, e.g. ZIP or GIF. Or checksums, which are pretty useful for just about anything, from an ISBN to pharmaceuticals, to network packages, credit cards etc. Discuss not only how and why they work, but also how you can use the checksum to reconstruct the original if something went wrong e.g. through an omission or a transposition. | ||
|
Polemarch
Canada1564 Posts
http://research.sun.com/projects/crypto/ | ||
|
Manit0u
Poland17695 Posts
On March 17 2010 03:13 Sirakor wrote: RSA is a good idea and easy to demonstrate. Once you have also explained the public/private key concept, it's also easy to link with useful applications beyond "encryption", such as digital signatures, authentication (e.g. the GSM network uses something similar when you switch on your mobile to make sure you're not impersonating) etc. If somebody else is already doing RSA, you could demonstrate one of the weaknesses of RSA, i.e. that if you have knowledge of the public key and keep encrypting the message with it, you will eventually get back to clear-text, and a lot faster than trying to factorize to get the private key. So if something was encrypted that can easily be verified whether you have arrived at cleartext (a text message in a known language for example), things become interesting ... Or on a related topic you could demonstrate how to play rock-paper-scissors (or poker, same idea, just more complicated) over the phone. Two more ideas: compression algorithms, e.g. ZIP or GIF. Or checksums, which are pretty useful for just about anything, from an ISBN to pharmaceuticals, to network packages, credit cards etc. Discuss not only how and why they work, but also how you can use the checksum to reconstruct the original if something went wrong e.g. through an omission or a transposition. http://linux.slashdot.org/story/10/03/04/1954259/Researchers-Find-Way-To-Zap-RSA-Algorithm figure out the 1,024-bit private key in about 100 hours – all without leaving a trace | ||
|
RisingTide
Australia769 Posts
| ||
| ||
