541 reputation
412
bio website tpbitcalc.appspot.com
location Internet Cloud
age 27
visits member for 3 years, 3 months
seen Aug 19 at 20:00

Computer Science double BSc, master-level student. Bitcoin enthusiast.

My Google-powered Bitcoin Calculator:

http://tpbitcalc.appspot.com/

My tweets:

http://twitter.com/#!/ThePiachu

If you have an iPhone and need some dice, check out my apps:

http://tiny.cc/TPiDev


Oct
22
comment Safety when disclosing hashes of secrets used to calculate other secrets
@IlmariKaronen At the moment I can't disclose what is the practical application of this, but the technical side of it is generating hashes of a secret number and a given number that are unknown before the operation takes place despite the hash of the secret number being known.
Oct
20
comment Safety when disclosing hashes of secrets used to calculate other secrets
@IlmariKaronen To prevent anyone from knowing a result of a hash for particular input before they query the system. In other words, as long as the secret is not known, the result of SHA256(A+B) for non-empty B should be unknowable before someone sends a query with B to the system.
Jun
29
comment Proof of work for determining whether a number is prime?
@CodesInChaos At the current moment there are people that are doing what I intend to automate by feeding the potential numbers to be proven as non-primes more or less "by hand" to a program that performs the checks. So I know this sort of automation would be useful and the work is not pointless (people are doing this for research). My project is not to figure out how to effectively find prime divisors (which is done by more math-savvy people), but to automate the process of work distribution and rewarding for a completed task (even if fruitless).
Jun
29
comment Proof of work for determining whether a number is prime?
@CodesInChaos I am checking whether a number is prime for numbers that are not yet known to be prime for mathematicians. I must've not worded it clearly. The numbers that will be checked for being prime are very big, but to distribute the work every user would be checking a range of possible divisors to that number. I need to have a proof of work for when a divisor is not found in a given range the user is checking in.
Jun
29
comment Proof of work for determining whether a number is prime?
@Thomas It is a distributed proof of work scheme. I am thinking about distributing people checking whether a really big number has divisors in specified range.
Mar
4
comment How to secure a mental poker protocol?
Thanks for pointing me to those articles, I will read up on them.
Mar
4
comment How to secure a mental poker protocol?
Well, then an answer about how to implement the protocol safely disregarding the legal aspect would be welcome.
Mar
4
comment Security of Pohlig-Hellman exponentation cipher?
The application is mental poker. I asked about the security in a separate question - crypto.stackexchange.com/q/6575/843 .
Mar
4
comment Are there any secure commutative ciphers?
@HenrickHellström - I asked about it in a separate question - crypto.stackexchange.com/q/6575/843 .
Mar
4
comment Are there any secure commutative ciphers?
@CodesInChaos The application is mental poker - the messages are very short.
Mar
3
comment Security of Pohlig-Hellman exponentation cipher?
Actually, here is the question about the same thing - crypto.stackexchange.com/a/1366/843 .
Mar
3
comment Security of Pohlig-Hellman exponentation cipher?
I need a commutative cipher for an application where two or more peers need to encrypt and decrypt data out of order. I can only find information on two algorithms, with this being the better one apparently. I guess I should ask about commutative ciphers in a separate question...
Jan
26
comment Hashing passwords with a salt - why use different salt for everyone?
@starblue Yes, but a single salt plus unique username would prevent the attacker from amortising their effort as they would not be able to look for more than one user's password at a time.
Jan
26
comment Hashing passwords with a salt - why use different salt for everyone?
@StephenTouset I am not implementing such a system myself, I'm just curious about the problem. This question is just to satisfy that curiosity.
Apr
10
comment What is the largest performed/possible bruteforce attack to date?
@RickyDemer Some paper would be ideal, but probably the website will do.
Nov
5
comment Academic papers on ECDSA security
It certainly seems like a good position. Whereas papers on specific classes of curves would be welcome, a broader perspective is also useful.
Oct
15
comment How can I store confident data with OpenID?
That would be preferable. The system is to use that data infrequently only when the user is logged in and performs an explicit action.
Oct
1
comment Where can I find Secp256k1 ECDSA test vectors?
I already have a testing architecture in place from a library implementing curves like P224, but I can't find any external data to test my implementation against. It should work, I can successfully generate, sign and verify anything with it, but comparing it with someone else's implementation would be desirable.
Sep
27
comment A set of key pairs and one hash to secure them
Yes, like a login and password together, so it is unique to the user and only the user can generate the whole variable.