[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <501356522.389451.1389052678669.open-xchange@email.1and1.com>
Date: Mon, 6 Jan 2014 17:57:58 -0600 (CST)
From: Steve Thomas <steve@...tu.com>
To: discussions@...sword-hashing.net
Subject: Re: [PHC] Security concern for Catena
> On January 6, 2014 at 4:04 PM Christian Forler
> <christian.forler@...-weimar.de> wrote:
>
>
> On 06.01.2014 22:02, Steve Thomas wrote:
> > I was about to implement Catena with 1/2 the memory and faster vs the
> > reference implementation.
>
> Cool. I'm eager to see the performance benchmarks of your
> implementation. Please contact me after you finished the implementation.
>
It's a little more than 2% faster and uses half the ram.
I also found another bug. Nothing that breaks security just changes the output.
You replace the data r[reverse(i, garlic)] with the new calculated value. When
you
do the next round you read memory sequentially because:
r[reverse(reverse(i, garlic), garlic)] == r[i]
Content of type "text/html" skipped
Powered by blists - more mailing lists