Go to Post why do they call them chips if you can't eat them? - Broadside [more]
Home
Go Back   Chief Delphi > Other > Math and Science
CD-Media   CD-Spy  
portal register members calendar search Today's Posts Mark Forums Read FAQ rules

 
Reply
Thread Tools Rate Thread Display Modes
  #1   Spotlight this post!  
Unread 21-08-2004, 21:07
phrontist's Avatar
phrontist phrontist is offline
Proto-Engineer
AKA: Bjorn Westergard
FRC #1418 (Vae Victus)
Team Role: College Student
 
Join Date: Feb 2004
Rookie Year: 2004
Location: Falls Church, VA
Posts: 828
phrontist has a reputation beyond reputephrontist has a reputation beyond reputephrontist has a reputation beyond reputephrontist has a reputation beyond reputephrontist has a reputation beyond reputephrontist has a reputation beyond reputephrontist has a reputation beyond reputephrontist has a reputation beyond reputephrontist has a reputation beyond reputephrontist has a reputation beyond reputephrontist has a reputation beyond repute
Send a message via AIM to phrontist
Lightbulb Cryptographic Autodidactary?

I've long been interested in cryptography, and I've probably read a good majority of the books on the subject oriented towards the laymen. I'm long past trivial things like enigma style-ciphers and there breaking, freqency analysis, yada, yada.

After reading everything I could find on "The Basics," I tried moving on to something more advanced, and ended up getting in way over my head. I've tried reading vast portions of "Applied Cryptography" and similar works, and everything but the C code in the apendices is gibberish to me.

Does anyone know of resources that cover the middle ground? Something that has actual mathematical content, but isn't comically obfuscated. I'm particularly interested in say, how patterns are found to break cryptographic systems. I understand it's a very hard subject, but surely there is something between ROT13 and "Differential Analysis: A Guide for the truly cerebral."

What areas of mathematics are most relevant to cryptography?

Thanks
__________________

University of Kentucky - Radio Free Lexington

"I would rather have a really big success or a really spectacular crash and failure then live out the warm eventual death of mediocrity" - Dean Kamen
Reply With Quote
  #2   Spotlight this post!  
Unread 21-08-2004, 21:20
Astronouth7303's Avatar
Astronouth7303 Astronouth7303 is offline
Why did I come back?
AKA: Jamie Bliss
FRC #4967 (That ONE Team)
Team Role: Mentor
 
Join Date: Jan 2004
Rookie Year: 2004
Location: Grand Rapids, MI
Posts: 2,071
Astronouth7303 has much to be proud ofAstronouth7303 has much to be proud ofAstronouth7303 has much to be proud ofAstronouth7303 has much to be proud ofAstronouth7303 has much to be proud ofAstronouth7303 has much to be proud ofAstronouth7303 has much to be proud ofAstronouth7303 has much to be proud ofAstronouth7303 has much to be proud ofAstronouth7303 has much to be proud of
Re: Cryptographic Autodidactary?

Cryptography for dummies?
All I know is it involves primes and factoring. [I've read this out of my math books. I don't know how or what] Though I have seen a encryption algorithm involving matrices.

Sorry. (though I'd be interested to hear about it)

Last edited by Astronouth7303 : 21-08-2004 at 22:03.
Reply With Quote
  #3   Spotlight this post!  
Unread 21-08-2004, 21:56
mtrawls's Avatar
mtrawls mtrawls is offline
I am JVN! (John von Neumann)
#0122 (NASA Knights)
Team Role: Programmer
 
Join Date: Mar 2003
Location: Hampton, VA
Posts: 295
mtrawls is a splendid one to beholdmtrawls is a splendid one to beholdmtrawls is a splendid one to beholdmtrawls is a splendid one to beholdmtrawls is a splendid one to beholdmtrawls is a splendid one to beholdmtrawls is a splendid one to behold
Send a message via AIM to mtrawls
Re: Cryptographic Autodidactary?

Have you checked out sci.crypt faqs?

Quote:
All I know is it involves primes and factoring.
A reference to RSA public-key encryption? I don't know if you include this in "basics" (though I'd hope most intro cryptography books, layman or otherwise, would cover this) -- if not, you might try "The mathematical guts of RSA encyption" (not tough math, don't worry).
Reply With Quote
  #4   Spotlight this post!  
Unread 21-08-2004, 22:30
phrontist's Avatar
phrontist phrontist is offline
Proto-Engineer
AKA: Bjorn Westergard
FRC #1418 (Vae Victus)
Team Role: College Student
 
Join Date: Feb 2004
Rookie Year: 2004
Location: Falls Church, VA
Posts: 828
phrontist has a reputation beyond reputephrontist has a reputation beyond reputephrontist has a reputation beyond reputephrontist has a reputation beyond reputephrontist has a reputation beyond reputephrontist has a reputation beyond reputephrontist has a reputation beyond reputephrontist has a reputation beyond reputephrontist has a reputation beyond reputephrontist has a reputation beyond reputephrontist has a reputation beyond repute
Send a message via AIM to phrontist
Re: Cryptographic Autodidactary?

What I'm trying to get away from is the fourmulaic stuff like: This is how RSA works...

Stuff that requires a little more thought, as oppose to plug and play stuff.
__________________

University of Kentucky - Radio Free Lexington

"I would rather have a really big success or a really spectacular crash and failure then live out the warm eventual death of mediocrity" - Dean Kamen
Reply With Quote
  #5   Spotlight this post!  
Unread 03-09-2004, 05:20
Denman's Avatar
Denman Denman is offline
Tie Wrap-Not Cable Tie or Zip tie
AKA: Stephen Denman
FRC #0759 (Systemetric)
Team Role: Mentor
 
Join Date: Jan 2004
Rookie Year: 2003
Location: Cambridge UK
Posts: 817
Denman has much to be proud ofDenman has much to be proud ofDenman has much to be proud ofDenman has much to be proud ofDenman has much to be proud ofDenman has much to be proud ofDenman has much to be proud ofDenman has much to be proud ofDenman has much to be proud of
Send a message via ICQ to Denman Send a message via AIM to Denman Send a message via MSN to Denman Send a message via Yahoo to Denman
Re: Cryptographic Autodidactary?

have you read the de la vinci code and digital fortress (ok they dont help much but are good books anyway)
The RSA code is basically down to the factorising into primes of realllllyyyyyy huge numbers into reaalllyyy huge primes..
if you find a prime greater than about 9 digits long, the fbi etc ill pay a ton for it lol
__________________
I am an ex-member of team 759.
759: regional winners with 522 and 233 NYC (2004)


FIRSTWiki.org - Contribute, learn, inspire.

"Teach the way of the GP and the way of the GP shall teach you" - Me
Reply With Quote
  #6   Spotlight this post!  
Unread 03-09-2004, 09:21
Unsung FIRST Hero
Matt Leese Matt Leese is offline
Been-In-FIRST-Too-Long
FRC #1438 (The Aztechs)
Team Role: Engineer
 
Join Date: May 2001
Rookie Year: 1998
Location: Long Beach, CA
Posts: 937
Matt Leese has a reputation beyond reputeMatt Leese has a reputation beyond reputeMatt Leese has a reputation beyond reputeMatt Leese has a reputation beyond reputeMatt Leese has a reputation beyond reputeMatt Leese has a reputation beyond reputeMatt Leese has a reputation beyond reputeMatt Leese has a reputation beyond reputeMatt Leese has a reputation beyond reputeMatt Leese has a reputation beyond reputeMatt Leese has a reputation beyond repute
Send a message via AIM to Matt Leese
Re: Cryptographic Autodidactary?

I know a little bit about cryptography. Most of the "middle ground" that you're interested in is truly just pure math. You need to learn the pure math before you can deal with the cryptography.

There are a variety of different ways that cryptography has been implemented; both in the past and currently. The most secure of cryptography is the one-time pad which uses a simple replacement cypher. By not reusing any elements of the key, it is theoretecially (not practically) impossible to break the encryption. If any of the key is repeated, it then becomes possible to break the encryption. This is done by looking at the frequency of certain parts of the encrypted text. There are references on line about this (I once looked them up).

The two encryption systems used most often on the internet are public key encryption and symmetrical encryption systems. Symmetrical encryption systems use the same key for encrypting something and the same key for decrypting something. Public key encryption uses one key for encryption (the public key) and one key for decryption. RSA is a public key encryption system. It does involve the factoring of large psuedo-primes into primes. Currently, this is a hard problem (in the mathematical sense of hard). There are other public key encryption systems that use different hard problems in them (elliptical encryption for one).

That's about the sum total of my encryption knowledge.

Matt
Reply With Quote
  #7   Spotlight this post!  
Unread 03-09-2004, 12:48
ellenchisa
 
Posts: n/a
Re: Cryptographic Autodidactary?

Well... I don't think this book is very well known, but I liked it, and it's about Cryptography. So just in case you haven't read it

try In Code by Sara(h?) Flannery. The first few chapters are more of a narrative, but later on it gets far more into math.

Now if only I could find my copy...
Reply With Quote
  #8   Spotlight this post!  
Unread 03-09-2004, 13:53
rbayer's Avatar Unsung FIRST Hero
rbayer rbayer is offline
Blood, Sweat, and Code
no team (Teamless Orphan)
 
Join Date: Mar 2002
Rookie Year: 2001
Location: Minnetonka, MN
Posts: 1,087
rbayer is a glorious beacon of lightrbayer is a glorious beacon of lightrbayer is a glorious beacon of lightrbayer is a glorious beacon of lightrbayer is a glorious beacon of light
Send a message via AIM to rbayer
Re: Cryptographic Autodidactary?

Your best bet is to try to find some kind of introduction to Number Theory book. Note that number theory is not exactly an easy subject, even when taught at an introductory level. For my Number Theory class (it's a 400-level (meaning intended for seniors) math class), we're using a book titled Introduction to the Theory of Numbers by Niven, Montgomery, and Zuckerman (ISBN: 0471625469). As I said, number theory is an advanced topic in high-level mathematics, so this book may not be what you're looking for, but it certainly is a rigourous mathematical foundation for crypto.
__________________
New C-based RoboEmu2 (code simulator) available at: http://www.robbayer.com/software.php
Reply With Quote
Reply


Thread Tools
Display Modes Rate This Thread
Rate This Thread:

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

vB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Forum Jump


All times are GMT -5. The time now is 10:42.

The Chief Delphi Forums are sponsored by Innovation First International, Inc.


Powered by vBulletin® Version 3.6.4
Copyright ©2000 - 2017, Jelsoft Enterprises Ltd.
Copyright © Chief Delphi