Reputation
Top tag
Next privilege 10,000 Rep.
Access moderator tools
Badges
1 8 22
Newest
 Informed
Impact
~66k people reached

Oct
6
comment SHA-256 “almost unique”?
No. $\:$ Yes; there's no publicly known method that seems likely to find a collision in $\hspace{1.46 in}$ SHA-256 with significantly less than $2^{128}$ work. $\;\;\;\;$
Oct
5
answered Probabalistic Polynomial-time Algorithms & One-way functions
Oct
5
comment Generating unbiased numbers with a biased six sided die?
To get a bounded number of throws per output-or-lack-thereof, the "until it gives other than 1" step can be moved to the beginning and then have its number of repeats limited. $\:$ (In fact, even without the "repeats limited" part, that would also stop timing attacks.) $\;\;\;\;$
Oct
5
comment RSA 1024 bit forge a new matching signature from a chosen message
The message is chosen by the forging procedure itself, not the person who's using that procedure. $\hspace{.4 in}$
Oct
4
comment Bcrypt input length vs collisions
(Also, bcrypt does not encrypt.) ​ ​
Oct
2
comment Is this distributed OTP scheme secure?
en.wikipedia.org/wiki/Stream_cipher $\:$ en.wikipedia.org/wiki/Block_cipher_mode_of_operation#CTR $\hspace{.53 in}$
Oct
2
comment Is it possible to create “non overlapping” RNGs?
If R1 and R2 must be independent, then this becomes equivalent to [non-interactive commitment such that commitments are pseudorandom]. $\;$
Sep
29
reviewed Reviewed Encrypting or HMACing password digests
Sep
29
comment Is there a way to encrypt an integer within an arbitrary range?
Yes. $\;$
Sep
27
comment Must root certificates be self signed?
security.stackexchange.com/a/54267/49075 $\;$
Sep
27
revised How does the Efficient Fully Homomorphic Encryption from (Standard) LWE work?
removed instances of "Click here" and changed spacing
Sep
23
answered Is succinct verification of an arbitrary data transformation theoretically possible? Is it feasible? How?
Sep
23
comment How does DSA provide non-repudiation in proving a document was properly displayed (not altered or displayed incorrectly)?
@mikeazo : $\:$ researchgate.net/publication/… $\;\;\;\;$
Sep
23
comment How does DSA provide non-repudiation in proving a document was properly displayed (not altered or displayed incorrectly)?
duckduckgo.com/?q=what-you-see-is-what-you-sign $\;$
Sep
21
comment Zero-Knowledge Proof of Subgraph Isomorphism
Does Alice also know an isomorphism from that subgraph to G2? $\;$
Sep
17
comment Is there a way to slow down collision attacks using iteration?
Would eTCR hashes work for that use case? $\;$
Sep
15
comment How to generate unique (random) numbers that can be traced back to a unique source number?
Yes. $\;$
Sep
12
comment How to propagate error in variable-sized message?
The more elegant way to solve the problem is to use format-preserving encryption, as I described in my answer. ​ For your previous comment, I believe the precise properties of AONT would be important. ​ ​ ​ ​
Sep
11
comment How to propagate error in variable-sized message?
Even with that, if the adversary can perform the all-or-nothing transforms, then your system can't provide garbling, since anyone who knows the plaintext can just xor the ciphertext with [[the AONT of that plaintext] xor [the AONT of what they want to make an encryption of]]. ​ Does your larger system also let you use an AONT which the adversary can't perform? ​ ​ ​ ​
Sep
11
comment How to propagate error in variable-sized message?
For reused stream cipher keystreams, the solution you're leaning towards would fall to a single known plaintext. ​ If "the ciphertext is the same length as the plaintext", then your system wouldn't be able to avoid reusing the stream cipher keystream. ​ ​ ​ ​