Re: [cryptography] High-AT proof-of-work

2013-01-19 Thread Elias Yarrkov
On Sat, Jan 19, 2013 at 9:18 AM, ianG wrote: > On 19/01/13 06:36 AM, Elias Yarrkov wrote: >> >> I was thinking of the problem of high-AT proof-of-work at some point, > > > AT is? Area-time complexity. Just google that, or see "Non-uniform cracks in the concrete" for some basic information. The a

Re: [cryptography] High-AT proof-of-work

2013-01-19 Thread CodesInChaos
A naive implementation has a cost of 2^b: Using memory m it takes time (2^b)/m keeping the product constant. These trade-offs are harmless. A more sophisticated implementation is: 1. Run the sequential squaring algo, but only store every 2^{b/4} value. This takes around 2^{b/2} time and 2^{b/4} m

Re: [cryptography] High-AT proof-of-work

2013-01-19 Thread ianG
On 19/01/13 12:36 PM, Elias Yarrkov wrote: On Sat, Jan 19, 2013 at 9:18 AM, ianG wrote: On 19/01/13 06:36 AM, Elias Yarrkov wrote: I was thinking of the problem of high-AT proof-of-work at some point, AT is? Area-time complexity. Just google that, or see "Non-uniform cracks in the concre

Re: [cryptography] High-AT proof-of-work

2013-01-19 Thread Elias Yarrkov
On Sat, Jan 19, 2013 at 12:20 PM, CodesInChaos wrote: > 1. Run the sequential squaring algo, but only store every 2^{b/4} value. > This takes around 2^{b/2} time and 2^{b/4} memory (product 2^{b*3/4} > 2. Run parallel squaring from all checkpoints stored in step 1. Use 2^{b/4} > small cores, takin

Re: [cryptography] phishing/password end-game (Re: Why anon-DH ...)

2013-01-19 Thread Ben Laurie
On 19 January 2013 07:45, James A. Donald wrote: > On 2013-01-19 2:14 AM, ianG wrote: >> >> Also, the confounded users tend to lose their phones or have them stolen. >> And then they demand their 'identities' back, as if nothing has happened. >> So the keys need to be agile, in some sense. Which

Re: [cryptography] phishing/password end-game (Re: Why anon-DH ...)

2013-01-19 Thread Jeffrey Walton
On Sat, Jan 19, 2013 at 2:01 PM, Ben Laurie wrote: > On 19 January 2013 07:45, James A. Donald wrote: >> On 2013-01-19 2:14 AM, ianG wrote: >>> >>> Also, the confounded users tend to lose their phones or have them stolen. >>> And then they demand their 'identities' back, as if nothing has happene

Re: [cryptography] High-AT proof-of-work

2013-01-19 Thread Elias Yarrkov
On Sat, Jan 19, 2013 at 1:28 PM, Elias Yarrkov wrote: > On Sat, Jan 19, 2013 at 12:20 PM, CodesInChaos wrote: >> 1. Run the sequential squaring algo, but only store every 2^{b/4} value. >> This takes around 2^{b/2} time and 2^{b/4} memory (product 2^{b*3/4} >> 2. Run parallel squaring from all ch