Encryption Definition and 64 Threads

Homework Statement Suppose someone uses ElGamal to encrypt a message. You know that the public key is p = 29, g = 18, and a = 14. The message was translated from letters into numbers by the system A $ 2, B $ 3, ..., Z $ 27. If the encrypted message was M1 = 17 M2 = 14; 11; 9; 24; 23; 24...

I think this is the perfect place to discuss the possibilities of quantum cryptography. It seems to have become a reality now. Let's discuss whether this truly is unbreakable! We've heard it before, but is it different this time? http://news.bbc.co.uk/1/hi/sci/tech/7661311.stm

Hi I've been hearing for years now that quantum computers have the potential to render encryption obsolete. My layman's understanding is that it would do this by taking advantage of the fact that qbits can exist in multiple states not just zero and one. I imagine there must be some limit to...

I was wondering about this: http://www.andya.org.uk/jsplay/codeworks.html So if banks use 128 bit public keys as and a 512 bit public key was crackable in less then 24 hours, then a 128 bit public key must be exponentially easier to crack so how come hackers never go after that?

Here are my thoughts on the paradoxal experiment where information seems to travel at infinite speed between two photons correlated at their origin. In this experiment, two photons with correlated k-vectors (through momentum conservation) and polarization (through the relative angle of the two...

do-it-yourself encryption Really don't know where to put this, so thought I'd ask all the fine folks here and see if I get a response. One of the curses of being widely read is that sometimes you remember the subject but neither content nor location of something you read once and would really...

I hope this is the right place to ask this: So looking at a symmetric encryption scheme, we see that a simple, say, xor of the data with the secret key will be broken in the event of single known-plaintext attack. Obviously, then, it is intuitive to pad out all plaintext with a random value...

hi can anyone help me with this? i need some materials on encryption using huffman code. is there something useful in the internet? can anyone suggest some link. thanks in advance to anyone who can help.

mszwt~HsjFs0xysysoFo4MCF4GInp~oE4sBnwMDEnCB0fBr0DCI0hoBytH~Duszw4wH0jwHsjF Can anyone figure out this encryption?

kare11.com/news/news_article.aspx?storyid=104357

I need to know how to measure the security of an encryption algorithm. I have no idea how code breakers do their job so I cannot rate an innovative algorithm. Also, does a substitution algorithm like the enigma used to work exist?

Im doing a project on the data encryption standard (DES), and was wondering if anyone had any ideas on where to find papers that discuss the mathematics behind the system. thanks

http://www.sosmath.com/matrix/coding/coding.html How would you decode the encryption at the bottom of the page?

I'm working on encrypting a small message using RSA. Are there any types of primes or primes of particular property that would make RSA decryption particularly difficult? Furthermore are there any better ways that just randomly trying to factorise to break RSA encryption or is there some...