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

I like crypto. Need I say more?


Mar
24
reviewed Satisfactory simple multiplication in GF(8)
Mar
24
reviewed Excellent Signature based on public key cryptography and forgery
Mar
24
reviewed Excellent ASCII: weakness
Mar
24
reviewed Excellent One-time digital signatures
Mar
24
reviewed Excellent Certificate signature with SHA-1 and RSA: where do 1888 bits come from?
Mar
24
reviewed Satisfactory Can passwords be stored securely so that a similarity comparison can be made?
Mar
24
reviewed Satisfactory Choice of reduction polynomial in Whirlpool's internal cipher
Mar
24
reviewed Excellent Is this approach to generating a “random” number from a sha512 hash effective?
Mar
24
reviewed Excellent Secure degree reduction for Shamir's secret sharing
Mar
24
reviewed Satisfactory If PGP and GPG both follow the OpenPGP standard, are they 100% compatible in all use cases?
Mar
21
revised secure integer comparison
added 70 characters in body
Mar
21
answered secure integer comparison
Mar
20
comment secure integer comparison
Multiparty computation requires multiple parties (as the name implies). Since you haven't told us much about your application scenario, it is hard to know if the MPC paradigm is correct. Do you need other operations besides comparison?
Mar
17
comment How can I create an RSA modulus for which no one knows the factors?
Since the OP is "fine with a multi-party algorithm and an assumption that players do not collaborate", I don't think this should be closed as a duplicate. The one that is currently marked as duplicate specifically says non-interactive (and actually points out a potential answer). I'll reopen, but if anyone disagrees, feel free to let me know.
Mar
16
comment How can I create an RSA modulus for which no one knows the factors?
Take a look at this for an implementation and the work they cite as the basis of their implementation.
Mar
13
comment Can a monoalphabetic substitution cipher attain perfect secrecy?
@figlesquidge, right. In some sense the OTP is a monoalphabetic substitution cipher where the alphabet is all strings of a specific length.
Mar
13
comment Can a monoalphabetic substitution cipher attain perfect secrecy?
yes if the plaintext space is restricted to one character and the substitution mapping is truly random.
Mar
13
answered Would a symmetric cipher with a keylength a big as the data length be information theoretically secure?
Mar
12
reviewed Approve suggested edit on How is a public key actually used to encrypt something?
Mar
11
reviewed Approve suggested edit on How to best mix two arbitrary/random n-bit words?