15,728 reputation
22369
bio website pwnhome.wordpress.com
location
age
visits member for 3 years, 2 months
seen 13 secs ago

I like crypto. Need I say more?


Jan
31
comment Addition-only PHE in F#
@uosɐſ So what you are saying is you'd like to be able to encrypt 3 values at once so that operations on those will happen in parallel? Kind of like the SIMD work done in some of the FHE papers? If that is your question, I think you should pick a crypto system (paillier or exponential elgamal)then ask a separate question specifically relating to that system and how you would enable SIMD-like operations.
Jan
31
comment How do institutions like banks do RSA with big primes?
do you have any sources to back up your claim that banks do this (not saying you are wrong, just that a source would add credibility).
Jan
30
comment How do institutions like banks do RSA with big primes?
Do you mean 255 digits instead of 255 ciphers?
Jan
30
comment How do institutions like banks do RSA with big primes?
They use computers which have no problems working with large numbers.
Jan
30
comment Does re-iterate AES128 with different keys gives any benefict?
@AlexanderPD, what sort of attack are you worried about?To be honest, if I saw "double aes128 method" used in a real world system, I would run away from it as fast as I could. While the attacks might be theoretical, it does not follow good design principles from a cryptographic prospective. Chances are, whatever attack you are worried about can be mitigated using standard cryptographic processes and procedures (or perhaps by something else).
Jan
30
answered Using cryptographic hash to match AES key size
Jan
30
comment ASCII: weakness
Looks like this is basically ECB mode. Look up ECB mode weaknesses.
Jan
29
revised How to specify last $t$ bits are only sent when a signature is sent?
edited title
Jan
29
answered Does re-iterate AES128 with different keys gives any benefict?
Jan
29
revised Shamir's ID based signatures
deleted 31 characters in body
Jan
29
comment Shamir's ID based signatures
I'd suggest removing your PS and asking that as a new question.
Jan
29
answered Shamir's ID based signatures
Jan
27
comment Avoiding overflow when encrypting with RSA
What do you mean by overflow? The mod n ensures that the result will never be bigger than n
Jan
25
comment How can I find the prime numbers used in RSA?
@user11621 $N=p*q$ so, given $N$ and $p$, simply divide. If you mean you don't have a calculator that supports such large numbers, install python.
Jan
24
revised Shamir Secret Sharing Modular Reduction
added 555 characters in body
Jan
24
comment Shamir Secret Sharing Modular Reduction
@poncho, good point. I'll have to dive deeper into the protocol outlined in the paper I linked to see if it mitigates that.
Jan
24
revised Shamir Secret Sharing Modular Reduction
added 10 characters in body
Jan
24
revised Shamir Secret Sharing Modular Reduction
added 10 characters in body
Jan
24
answered Shamir Secret Sharing Modular Reduction
Jan
24
comment Secure degree reduction for Shamir's secret sharing
@user3225551 it should be in the referenced paper. That paper gives 2 MPC protocols. One in the honest-but-curious (semi-honest) model. That is the one that works as I described. The other is in the malicious model which is much more complicated. Their explanation of the multiplication step is just presented in a different manner. See also this.