# All Questions

90 views

### Probability of factoring keys as a function of bit length

kinda new here, I had a question pertaining to someone being able to factor one's RSA keys through the GCD. Anyways the question goes that there are two people: A and B. A makes his/her private key as ...
361 views

### Difference between Symmetric and Asymmetric. Is this answer correct, based on a written test?

I asked the following question on a final exam: Symmetric Ciphers (e.g. AES, DES, Blowfish) use up to 256 bit on the best case, which are considered strong against brute-force attacks. On ...
164 views

### Proving the semantic security of the One Time pad

Currently hearing a lecture on cryptography, and the professor gave us the definition of semantic security, which is roughly the following (formally not quite complete, but you get the idea): ...
211 views

### Statistical properties of hash functions when calculating modulo

When using SHA-1 to hash an input, the result is a pseudo-random number in the numeric ID space $\{0\dots2^{160}-1\}$. Do I loose any statistical property in the result if I use modulo to restrict the ...
78 views

76 views

### what is the benefit of lcm in cryptography? [closed]

what is the benefit of lcm in cryptography? and what is the effect of lcm on public key? note * lcm = Least common multiple thanks
83 views

### processing time for multiplication and exponentiation in pairing base cryptography

I'm using the Boneh-Boyen-Shacham signature scheme and want to estimate complexity in my scheme. As reported in "Scott M., Efficient Implementation of Cryptographic pairings", if we set parameters ...
103 views

### CAST-256 (CAST6) versions or S-Boxes

Are there different versions of CAST-256 - also known as CAST6 - available? Are there different S-Boxes available for CAST-256? If there are different versions or S-Boxes what identifier should I use ...
143 views

### Voting system validation

I'm developing an application to run elections. A voting system. I would like to give the ability to the voters to check later if their vote were correct computed/casted. assumptions: each user has ...
96 views

### Are there any proofs of the SHA1 compression function's (second-)preimage resistance?

Why is SHA1 preimage-resistant? The best reference that I can find is Rogaway & Shrimpton's 2009 paper, and I'll use their definitions. The kind of preimage resistance that is wanted is aPre. ...
80 views

### Explanation of the Fiat-Shamir heuristic

The Wikipedia page on the topic (http://en.wikipedia.org/wiki/Fiat%E2%80%93Shamir_heuristic) is completely useless as it only explains what it is and not how it works. I looked at the original paper ...
76 views

### Fermats Little Theorem, primitive root [closed]

So I am studying for finals and I am not able to solve the problem: Let $p = 3 * 2^{11484018}- 1$ be a prime with 3457035 digits. Find a positive integer $x$ so that $2^x\equiv 3\pmod p$ Any ...
86 views

93 views

### I don't care about replay attacks. What should I do with the nonce in nacl?

My system forwards encrypted and/or signed messages on a gossip network. Replay is part of the design. What should I do with the nonce? I'm tempted to just set it to the same number always. Is this a ...
Double hashing can surely provide more security than only one layer of hashing but does that necessarily mean it is more collision resistant? This question in a more mathematical form: If $H$ is a ...