would using modular math be a good way of making a fast encryption system?
Printable View
would using modular math be a good way of making a fast encryption system?
What do you mean by "modular maths"?
I'm sorry but I don't really understand your question. Could you develop your thinking please?
by modular math i believe hes talking about the % operator. it returns the remainder given two numbers, ie 10%4 is 2 and 100%10 is 0. as for how it can be used for a fast encryption system, i dont follow him there.
I think that creating an encryption system based on remainders would be quite difficult, or even impossible. All depends on what exactly you want to make with them: if you want a not too complicated and fast system, I believe it's impossible. Think how many ways there are to reach a particular remainder and how you could make the difference between those ways during encoding and/or decoding processes.
KC
Modular math as cire defined it is a great function to use for hash tables. It allows for very efficient searches (in O(1) time if done properly). Maybe sectac confused encryption and searching?? or maybe there is a way to use to make good encryption. I'm just rambling now.
To answer your question in one word: Yes.
Modular arithmetic forms the basis for number theory and many cryptosystems. A very simple, old, and well known example is the caesar cipher or shift cipher. Each letter of the alphabet is replaced with an integer from 0 to 25. A caesar cipher is then a function f(n) = (n+m) mod 26 where n is the integer representation of the letter and m is an integer representing the degree of shift. The caeser cipher is a private key cryptosystem, but public key cryptosystems are based on modular arithmetic also, a rather brilliant modern example is RSA. In RSA crypto each character is replaced with an integer and then those numbers are grouped into blocks of 4 digits. A 4 digit block of plaintext M is transformed into the the ciphertext C through the formula C = M^e mod n where n=pq. p and q are prime numbers (huge prime numbers) and e is an integer that is relatively prime to (p-1)(q-1). Then the cipher text is decrypted with the formula M = C^d mod n where d is an inverse of e mod (p-1)(q-1).
These are just a couple examples, but if you're really interested you should definitely read:
Handbook of Applied Cryptography by Alfred J. Menezes
Applied Cryptography by Bruce Schneier (aka the crypto bible)
A Course in Number Theory and Cryptography by Neal I. Koblitz
There are lots of other too, but these 3 are classics. The Handbook is fairly mathematically intensive and I don't know how mathematically inclined you are, but its the best crypto book out there IMHO and you can download the whole thing for free at http://www.cacr.math.uwaterloo.ca/hac/
I just like XOR Trees :) and simple algorithm layers based on a key....
- Noia
i beleived (at least i thought) that PGP used modular mathmatics , you password being translated into your key. But with HUGE numbers. something like, 238977238923999100399983%1229938854 = "watever"
then your pub encryption key is your large first number, and your system uses the 2nd two from your password.... sum such,,,, i gotta read up on it again
well if you knew PGP used modular mathematics, why did you have to ask if it would be good for encryption?Quote:
Originally posted here by sectac
i beleived (at least i thought) that PGP used modular mathmatics , you password being translated into your key. But with HUGE numbers. something like, 238977238923999100399983%1229938854 = "watever"
then your pub encryption key is your large first number, and your system uses the 2nd two from your password.... sum such,,,, i gotta read up on it again
because i was not sure if it was true or not, wondering if anyone can confirm or add any input to a new system im creating using modular mathmatics along with arrays
ttyl
modulo arithmetic does indeed play an important role in many cryptosystems, but simply having a good understanding of modulus arithmetic (and generators, and fields (Abelian field, anyone???), or how about elliptic curve crypto?!?, etc) will not enable you to go out and whip up the next big cryptosystem overnight. Read plenty of books, (Avis187 named some good ones), go to a university (they dont' teach this stuff at the community college level, i've been there), and keep visiting AO, one of the premier sites for security info and discussions.
I would also say that if you're working on building a "new" encryption system without the knowledge that can be gained from working with existing ones, you're likely to make a lot of mistakes that have been made before.
I would suggest instead of trying to build one of your own at this point, pick up one of the books Avis187 suggested (I highly rate Applied Cryptography for a good introduction.) Try to make your own implementation of some of the more simple algorithms in there and understand why they do what they do. This will help you better understand what to look for in speed, security and complexity. They're all trade-offs.
Good luck with it.
Agent Johnson: You're right about certain things not being taught at community colleges, but only in the sense that they don't usually have courses for which they are part of the curriculum. However, as a person who has gone to a community college in the past, I assure you that if you are lucky enough to have a really good professor they will be able to help you accelerate you learning process to extend far beyond what is normally taught in a particular class, regardless of whether it is officially in the course outline.