New answers tagged

1

I have 4 different cipher texts, looks like Hex, that when deciphered come to the same pre-ciphered text. I would like to find out how the pre-ciphered text was ciphered. Unless the cipher is weak (either deliberately in a Capture-The-Flag challenge, or it's a homebrew cipher), you have no chance. Any cipher we would trust will generate ciphertext that ...


0

Your question addresses the block cipher concept. In the kernel, you have an algorithm, which operates on byte blocks of defined size; according to a defined operation mode, data blocks are preprocessed or post-processed. Easiest mode is the atomic ECB, "Electronic Codebook" mode, the one without ´knowledge´, i.e. you split your input stream 'plain....


6

Basically there are two steps to this: encode the text to bytes - this generally requires a character encoding such as UTF-8 or Latin encoding; encode the bytes to integer - this is part of the encryption operation in RSA as specified in PKCS#1, and is performed using a function called OS2IP. In your case the text is obviously already encoded as bytes; ...


2

The shuffled re-encrypted ballots, according to the El Gamal encryption scheme referenced in the appendix of the paper, will be in the form $(X', Y')$. We need to prove that the declared ballot message $M$ is genuinely calculated as $M = X'-sY'$, where $s$ is the same private key linked to the public key $Z = sG$ that the voter originally used to encrypt the ...


Top 50 recent answers are included