320 reputation
15
bio website
location
age
visits member for 1 year
seen 2 days ago

Apr
7
comment RSA: Letting $p$ and $q$ have different bit-size
making sure the second most significant bit is different between $q$ and $p$ is enough to ensure they are not too close
Mar
26
awarded  Yearling
Mar
24
revised Why is it said that if we know few bits of pseudo random sequence we can predict the whole of it?
added 157 characters in body
Mar
6
revised why inverse in diffie-hellman protocol will not give same value?
fixed mathjax a bit
Mar
6
suggested suggested edit on why inverse in diffie-hellman protocol will not give same value?
Mar
4
revised Why does CTR mode XOR the plaintext into the output of the block cipher rather than XORing the plaintext into the input of the block cipher?
fixed up mathjax formatting
Mar
4
suggested suggested edit on Why does CTR mode XOR the plaintext into the output of the block cipher rather than XORing the plaintext into the input of the block cipher?
Feb
4
comment DES-encrypted cipher
and you can't make use of the knowledge that every other byte is 0?
Jan
27
answered How cryptographically secure was the original WW2 Enigma machine, from a modern viewpoint?
Jan
23
comment RSA with composite numbers
Can RSA work with a different modulus than a product of 2 large primes? Yes, however the key generation will be different and security will affected
Jan
21
comment How can i predict the next number of a long sequence of seemingly random numbers?
Cryptographically Secure, most of the time implemented with a secure hash of an entropy pool that gets mixed in again for the next round
Jan
13
revised One time pad key exchange
added 106 characters in body
Jan
13
answered One time pad key exchange
Jan
8
comment implication of tweak on bruteforcing a block cipher
decrypting the ciphertext should produce the plaintext exactly, no number of tweaks will change that otherwise decrypting would need to be a $2^t$ operation
Dec
8
comment Why is it that researchers prefer finding secure software solutions over secure hardware solutions?
everything you can do in hardware you can emulate in software
Dec
6
awarded  Supporter
Dec
6
comment How do we arrive to the equation for solving D in RSA?
it's because of definition of $\phi(n)$ in essence $x^{\phi(n)} = x \mod n \Rightarrow x^y=x^{y \mod \phi(n)} \mod n$. So you select an $e$ and $d$ such that $ed = 1 \mod \phi(n)$
Oct
28
comment Are there any Truth Table to Boolean expression converters?
karnaugh maps will help
Oct
23
comment How difficult is it to brute force d in RSA: d = (1/e) mod φ in a CPT attack?
@mikeazo $(p−1)(q−1)$ is dividable by 4 so you can eliminate 3 out of 4
Sep
23
comment How broken is a xor of two LCGs?
any reason why you didn't use 2 different primes?