2,936 reputation
1518
bio website
location United States
age
visits member for 2 years, 6 months
seen 2 hours ago

Apr
20
comment XORing a header with SHA512-hash - secure?
If you "want to add random bytes at the end" of the plaintext or the ciphertext? $\hspace{1.63 in}$
Apr
20
answered Diffusion in Shamir's secret sharing scheme
Apr
20
comment XORing a header with SHA512-hash - secure?
Yes. $\:$ You could skip that header and use bit padding on the plaintext. $\:$ Also, you should $\hspace{.98 in}$ use a MAC or some directly authenticated encryption. $\;\;\;\;$
Apr
19
comment How to calculate Modulo using a standard calculator for a one time pad encryption
@user13120 : $\:$ You need to put in parentheses. $\;\;\;\;$
Apr
18
revised ECDSA verification is too slow
fixed grammar, fixed capitalization, and removed irrelevant tags
Apr
17
revised One time pad: why is it useless in practice?
fixed typo in title
Apr
16
comment Composing hashes and/or MACs
That works for the usual conditions of unforgeability and pseudorandomness. $\:$ On the other hand, it does not work for the intermediate property of being a privacy-preserving mac. $\;\;\;\;$
Apr
16
revised Is anyone aware of Du atallah multiplicative secret sharing scheme for dot products for > 2 party scenario?
fixed link
Apr
16
comment Which commitment scheme is better for malicious models
What is "the one based on digital signatures"? $\;$
Apr
15
revised How can I convert numbers into prime numbers?
fixed grammar and removed irrelevant tag
Apr
15
revised SSL-like protocol with public-key hard-coded in the client
fixed grammar and a typo
Apr
15
comment Security of RSA for paranoids with padding?
One could just apply naked RSAP to something chosen at random and use a random oracle's $\hspace{.68 in}$ value at that thing as a key, although this approach would increase the ciphertext overhead. $\hspace{.96 in}$
Apr
15
comment Sequence of Encrypting RSA like Chaum Blinding scheme
One would check the signature's authenticity by checking whether or not $\:$ pow(claimed_signature,e,n) == digest(message) $\:$ is satisfied. $\;\;\;$ "Will unblinded_signed_msg == pow(message,d,n) satisfy" what condition? $\;\;\;\;\;\;$
Apr
15
comment Sequence of Encrypting RSA like Chaum Blinding scheme
Are you using Python? $\:$ Is "wayyy to long" more than 15 seconds? $\:$ My laptop was able to evaluate that for 25 random 2047-bit triples in under 7 seconds. $\:$ I would tackle this by making sure you're never computing pow(blinded_message,d), and then looking for other bugs you might have. $\:$ As far as I can see, the value of pow(signed_msg,r**-1,n) is completely irrelevant. $\:$ (I don't see a reason for anything involving r to be in the exponent.) $\;\;\;\;$
Apr
14
comment Sequence of Encrypting RSA like Chaum Blinding scheme
Which of the posts in that link are you talking about? $\;\;\;$ One signs on a blinded_message by computing $\:$ (blinded_message)^d % n $\;$. $\;\;\;\;\;\;$
Apr
14
revised Sequence of Encrypting RSA like Chaum Blinding scheme
gave bound regarding privacyparameter
Apr
14
comment Sequence of Encrypting RSA like Chaum Blinding scheme
Neither party computes r**d. $\;\;\;$ (You may want to actually look at the link I gave for $\:$ (blinded_token)^d % n $\;$.) $\;\;\;$ I'm about to edit in a bound on the blindness in terms of privacyparameter. $\;\;\;\;\;\;$
Apr
14
revised Does AES-128 have the same strength as AES-256 with a padded key?
fixed grammar and changed spacing
Apr
14
revised Sequence of Encrypting RSA like Chaum Blinding scheme
addressed OP's comments
Apr
13
answered Sequence of Encrypting RSA like Chaum Blinding scheme