Design of cryptographic primitives (algorithms), like block ciphers, stream ciphers, random-number generators, hash functions, MACs, key exchanges, public-key encryption or signature schemes. Also tag with the relevant type of primitive. If you ask about a known existing algorithm, also tag with its ...
7
votes
3answers
2k views
Can one generalize the Diffie-Hellman key exchange to three or more parties?
Does anyone know how to do a Diffie-Hellman or ECDH key exchange with more than two parties?
I know how to do a key exchange between 2 parties, but I need to be able to have a key agreement between 3 ...
2
votes
2answers
152 views
Algorithm Design for only Mutual Information Sharing
Bob and Alice each have a bit string they want to keep private. They each want to know what the bitwise AND of their two strings would be without telling the other or anyone else listening to their ...
4
votes
3answers
231 views
Designing a key expander out of ciphers
Is it possible to compose or combine $n$ ciphers ($cipher_0, cipher_1, ... cipher_n$) in such a way that they generate $n$ ciphertexts from the same key, $k$, and that recovering the key, $k$, from ...
1
vote
2answers
681 views
Symmetric vs. Asymmetric cryptographic approaches to data security
Ok. So, I now know the basic differences between them. But I'd love to know the deeper things, like:
Exactly why is the asymmetric approach slower than the symmetric?
Why does it make use of ...
6
votes
1answer
374 views
Why Addition Mod 32?
I was looking at the algorithm for Twofish, and I noticed that in some places a XOR is used, but in others, they use "addition modulo-32." What makes modulo-32 special? Why not always use XOR? Why not ...
2
votes
1answer
193 views
Padding for the TEA
Sorry if this is a noob questions, but I finally figured out how to implement the Tiny Encryption Algorithm in C++.
My question is what to do about padding the key and the plaintext? I know that ...
3
votes
2answers
177 views
Is there a way to do fair exchange between two parties who don't trust each other?
Let's suppose we have an Alice who knows a secret key A, and Bob who knows key B. Using their own keys, they each encrypt a message (Alice encrypts $m_A$, Bob encrypts $m_B$) with their own key, and ...
3
votes
2answers
174 views
Two step encryption
Is there any asymmetric cryptography algorithm which will allow recursive encryption.
...
