Archive for December, 2013
Strict memory hard hash functions
Posted by SDLerner in Uncategorized on December 31, 2013
Strict memory hard functions are an extension of memory hard functions such that a slight reduction in the memory available for computation, compared to a predefined optimal memory size, makes the function evaluation exponentially slower or infeasible. The main application of strict memory hard functions is to prove a certain amount of memory is used […]
RSALX digital signature scheme
Posted by SDLerner in Uncategorized on December 18, 2013
When I posted about RSAL in my last post I was also thinking of a variant scheme that allows some pre-computation. I spent some time (minutes) evaluating its security and now I’m convinced that it’s secure :). Here it is: The RSALX Digital signature Scheme PrecomputeSign() →< A, a, t1, … , t2^d > Chose […]
RSAL, a new digital signature scheme that may be quite old
Posted by SDLerner in Uncategorized on December 15, 2013
Playing with RSA digital signatures I realized that the same system can be used a bit differently and achieve the same security level (as far as I see). I haven’t read about this method before and it’s near impossible to google for a math formula. So this may be a very old broken digital signature […]
P2PTradeX revisted
Posted by SDLerner in Uncategorized on December 11, 2013
I came up with an attack on my P2PTradeX protocol, which, in most cases, would thwart severely its utility. Let’s first review the protocol. A first party issues a conditional transaction in a block chain X, which contains a contract. The contract requests the the other party to provide a proof that a payment has […]
Bitslog 
Recent Comments