Reputation
13,816
Next tag badge:
129/100 score
18/20 answers
Badges
3 34 72
Impact
~314k people reached

Nov
27
answered AES and perfect ciphers
Nov
27
revised AES and perfect ciphers
formatting, adding commas
Nov
27
comment ElGamal message signatures retrieving the secret value x
Is this a homework task, or from where did you get this assertion?
Nov
27
comment How can one show that an ElGamal-like signature verification scheme is valid?
Your scheme is not the original ElGamal scheme, and I doubt that it is valid at all. First, ElGamal uses a hash of the message where you are using the message itself (which will make the scheme less secure, and only applicable for short messages, but verification should still work). Second, in the exponents of the verification you switched $s$ and $r$. Is this a typo (and you want actually a proof for the original ElGamal), or do you really search a proof for this modified scheme?
Nov
27
revised How can one show that an ElGamal-like signature verification scheme is valid?
formatting
Nov
26
comment Verilog simulation of Data Encryption Standard
What do you actually want to know? "Can I get help in understanding" is not really a good question.
Nov
26
comment What is pre-image resistance, and how can the lack thereof be exploited?
@Fixee: If we search an algorithm which attacks a block cipher with the given plaintext/ciphertext pairs, then there is (usually) just one correct key, so the algorithm which just outputs this key would be quite simple (and O(1)) and correct, too (assuming a key-finding algorithm, not a distinguishing one). But no: We want an algorithm (for a given cipher) which takes the plaintext/ciphertext pairs as input, and works for any such set of plaintext/ciphertext pairs, not just for a specific one. Analogously, I want a preimage finding algorithm which works for any hash given as input.
Nov
26
comment How does the wider cryptographic community view non-abelian group based cryptography?
Thanks for the link, I now understand what you mean here. As far as I can see, often the actual group used is not the secret in group-based protocols (like Diffie-Hellman, ElGamal, DSA), so I don't see how it would be problematic that there are not so many different ones. (In RSA, we are not actually using a single group.)
Nov
26
comment How does the wider cryptographic community view non-abelian group based cryptography?
Do you have any link or other reference to the Coincident Group Orders Theorem? I have never heard it before, and Google finds just this question.
Nov
23
comment How can I create a fixed length output in my hash function?
We had a conversation in chat to help to understand the answers.
Nov
23
comment Advanced Access Content System (AACS) and Subset Difference techniques for Broadcast Encryption
Welcome to Cryptography Stack Exchange. We actually prefer answers which contain the information itself, not only a web link. Could you add a summary of the information to the answer? Otherwise we will convert your answer to a comment.
Nov
23
revised How can I create a fixed length output in my hash function?
add a paragraph to show how this limits the output size
Nov
23
comment Using a Non-Random IV with modes other than CBC
To say it shorter: A mode is affected if the IV touches the plaintext before encryption (and after decryption), and not directly affected (but needs the uniqueness) if IV and plaintext are separated by encryption.
Nov
23
revised How can I create a fixed length output in my hash function?
formatting to use numbered lists
Nov
23
revised How can I create a fixed length output in my hash function?
add some more details about the compression function
Nov
23
reviewed Approve copy-protection tag wiki excerpt
Nov
23
comment How can I create a fixed length output in my hash function?
@Joesavage1 The "filler content" is the appending of 9 and 0 in step 1).
Nov
23
comment How can I create a fixed length output in my hash function?
Feel free to come to our general Cryptography chat room, I'm almost always there when I'm online at all, and it is not too full.
Nov
23
comment How can I create a fixed length output in my hash function?
Just a note: In this very simple hash function's output, we (after the first input byte) always have $c = b \oplus 94h$, which means that more information is lost than necessary. Also, $b$, after an even number of bytes, is just the XOR of the even-numbered input bytes. After an odd number, it is the XOR of the odd-numbered input bytes (and 55).
Nov
23
comment Security of simple xor and s-box cipher?
@Polynomial: I added some (small-font) explanation for the notation to my article. Though in general, if you don't even know this basic mathematical notation, you are nowhere near the knowledge level necessary to design a secure cipher, sorry.