Reputation
17,057
Next tag badge:
94/100 score
37/20 answers
Badges
2 25 72
Impact
~411k people reached

Aug
2
revised How is the MD2 hash function S-table constructed from Pi?
deleted 1 character in body
Aug
2
answered How is the MD2 hash function S-table constructed from Pi?
Aug
1
awarded  Revival
Aug
1
comment run length testing
This might interest you. It sounds like you want to estimate the entropy of the n-bin binary sequences and want to make sure you choose the parameters so that you have a given confidence level. This question might be better off on CV.se.
Aug
1
comment Given a 'good' basis for a lattice, how can we solve the CVP?
What do you mean by good and short? If you mean the shortest basis, then I think the answer to SVP is that the shortest vector is guaranteed to be in the shortest basis. For CVP, you probably find the linear combination of the basis vectors that equals the target vector, then round the coefficients to integers (that might not get you exactly there, but will get you close). I have a limited understanding of lattice crypto, which is why I'm not writing an answer. Hopefully someone can confirm my thoughts or point out my errors.
Jul
31
revised Noise bound in FHE over the integers
added tex formatting
Jul
29
comment Public key Issue - same key pair as existing one?
Related question or possibly even a duplicate.
Jul
29
comment Public key Issue - same key pair as existing one?
It is very unlikely if everything is done properly (i.e., a good random number generator is used). Unfortunately, it has happened in practice. See the Debian OpenSSL RNG bug also this paper which details other issues found in practice.
Jul
25
comment Key Derivation from random salted seed, HMAC and HMAC based KDF
Note that you have another question on here with the exact same title.
Jul
25
comment Key Derivation from random salted seed, HMAC and HMAC based KDF
If you use the proper OS provided random number generators, then yes, they are good enough for encryption.
Jul
25
comment Key Derivation from random salted seed, HMAC and HMAC based KDF
To add to what otus says, most operating systems have built in random number generators. Most mobile device platforms (iOS and Android) have good random number generators built in. Why not just generate a 128-bit (or 192 or 256) random value and use that directly?
Jul
24
revised Vigenère cipher: Security when key length and plaintext length are the same
edited tags
Jul
22
comment RSA with modulus n=p²q
@Thor, I don't think CGFoX is planning on making the primes smaller to achieve the same bit size. Especially since the question specifies that using $p^2q$ would allow operations on a bigger $\mathbb{Z}_n$. That said, if the only benefit is a larger group, I would just pick larger primes to get the larger group personally (as you suggest).
Jul
22
revised MAC using a modified CBC mode of operation
edited body
Jul
22
revised RSA with composite numbers
added 6 characters in body
Jul
22
revised MAC using a modified CBC mode of operation
deleted 10 characters in body; edited tags
Jul
22
comment Lowest number challenge scheme
@fkraiem remember though, you would have to always run the coin-flip (whether there was a tie or not), otherwise you leak whether or not there was a tie. My point is, things can get complicated.
Jul
18
reviewed Approve Polynomial representation of the affine part of the AES S-box
Jul
18
comment Polynomial representation of the affine part of the AES S-box
Could you explain what l0-l8 are? I'm too lazy to read the paper right now.
Jul
18
comment Storing encryption key
Is this a stand alone app, or a client server app?