5,506 reputation
1828
bio website
location
age
visits member for 2 years, 10 months
seen yesterday

Dec
15
comment What is difference between PRG, PRF, and PRP
Well, a poly-time observer has a relatively realistically good shot at distinguishing a few TB of a AES-CTR stream from a HMAC-MD5-stream, but not at distinguishing AES with a random key from a random permutation.
Nov
17
comment Key generation in Digital Signature Algorithm
The exact algorithm for generating the primes is specified in the DSS NIST FIPS 186-4 nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.186-4.pdf
Nov
15
comment Why we can't implement AES 512 key size?
"since AES-128 is safe enough for anything foreseeable" ...except when the cryptosystem is re-keying sufficiently frequently for collisions in the key space to become a concern.
Oct
3
comment What does OIW stand for
books.google.se/…
Oct
3
comment What does OIW stand for
Open System Implementors Workshop alvestrand.no/objectid/1.3.14.html
Sep
23
comment Is it possible to find out whether a number is greater than another number without knowing the numbers?
Do you need to compare each number in a pair only once, or multiple times?
Sep
22
comment Is it possible to hand-negotiate an SSL/TLS session?
No, it is not feasible or even theoretically possible to connect to a server on 443 and type yourself through an entire SSL handshake.
Sep
15
comment What is the technical name for a public key container in DER format?
If it's not a plain PKCS#1 RSAPublicKey, it is probably a SubjectPublicKeyInfo from PKIX/X.509
Sep
15
comment What is the technical name for a public key container in DER format?
Well, you don't have to take my word for it. All you have to do is to implement a Base64 decoder, an ASN.1 parser, a DER parser and see for yourself, just like I did. :)
Sep
15
comment What is the technical name for a public key container in DER format?
The format is PKCS#1 with PEM encoding. Your question is however off topic here.
Sep
15
comment Why would an RSA library tell me that the public key must be at least 512 bits in size?
Obviously, you can't use a 512 bit RSA key for generating sha512withRSAEncryption signatures. The restriction on key size might have to with more than just best practices.
Sep
3
comment Are SSL/TLS used for maintaining data confidentiality?
Please read the answer again. Data as a whole might not necessarily be confidential, just because it is encrypted. The hash functions are used for the message authentication codes and (in TLS 1.2 and up) for the PRF that is used e.g. for deriving bulk encryption keys. The description in the other answer crypto.stackexchange.com/a/18936/1564 is generally correct in this respect.
Aug
22
comment Why does DES use exactly 16 rounds?
@fgrieu You are probably correct.
Aug
12
comment Deterministic Rand function for Winternitz One Time Signatures
I need (at least) 256 bit outputs because the Winternitz OWF has a 256 bit output. I need (at least) a 256 bit key, because the risk of collisions in the leaf keys must nut exceed the risk of collisions in the message digest function. I need a 256 bit seed because the number of leafs is $2^{250}$ and the total number of independent leaf keys is $2^{256}$.
Aug
11
comment SHACAL in SHA-256
Yes, SHACAL-2 was e.g. selected as part of the NESSIE portfolio. However, it should be noted that some standard modes of operation don't have a 256-bit equivalent, such as GCM.
Aug
9
comment Discovering private exponent from public key
Correction: The order $q$ of $g$ is the least positive integer such that $1 = g^q \bmod N$. You are correct that an element $g$ is a generator of the multiplicative group if its order is $q = N-1$. Also please note that $N = 251$ isn't a safe prime, since $(N-1)/2 = 125$ isn't a prime.
Aug
9
comment Discovering private exponent from public key
The parameter $n$ in my answer is an arbitrary attack parameter that might be any value between $0$ and $128$.
Aug
9
comment Discovering private exponent from public key
@Joe In SRP, $g$ is supposed to be a generator of the multiplicative group, meaning that the order of $g$ should be $q = N-1$. Since $N$ is supposed to be a safe prime, the only other possible values are $q = (N-1)/2$, $q = 2$ and $q = 1$. Checking the order of $g$ is done by finding the least $q$ such that $g = g^q \bmod N$.
Aug
7
comment Interleaving bytes to make an effectively larger block size
If by "interleaving" you mean transposing, please see the second case in my answer. Your function has approximately the same collision rate as CBC mode or CFB mode under CPA, but at the expense of three AES invocations per 128 bits, instead of just one.
Aug
3
comment Cryptographically Secure Hash Algorithm with Very Specific Property
1. What exactly do the operators $\oplus$ and $+$ signify? Bitwise xor and string concatenation, or something else? 2. Are the $K_i$ values supposed to be of a fixed bit length, or do you want the relation to hold for inputs of any length?