flat assembler
Message board for the users of flat assembler.

Index > Heap > SHA-3 winner selected

Author
Thread Post new topic Reply to topic
LocoDelAssembly
Your code has a bug


Joined: 06 May 2005
Posts: 4633
Location: Argentina
LocoDelAssembly
Post 03 Oct 2012, 14:17
View user's profile Send private message Reply with quote
cod3b453



Joined: 25 Aug 2004
Posts: 619
cod3b453
Thanks for the heads-up - I guess this calls for another macro... Laughing I'm kinda glad it wasn't an AES derivative, would be bad if a weakness was found.
Post 03 Oct 2012, 18:44
View user's profile Send private message Reply with quote
Tomasz Grysztar
Assembly Artist


Joined: 16 Jun 2003
Posts: 7725
Location: Kraków, Poland
Tomasz Grysztar
Perhaps we should now announce a contest for the fastest implementation in assembly? Wink
Post 03 Oct 2012, 20:32
View user's profile Send private message Visit poster's website Reply with quote
cod3b453



Joined: 25 Aug 2004
Posts: 619
cod3b453
The reference implementation has a number of optimised builds with ARM/x86 asm includes already so it might be a bit more challenging Laughing. One thing to look out for is it uses SSSE3 instructions (pshufb) in the UseSSE build, so some CPUs might not be about to bench it Sad
Post 03 Oct 2012, 20:55
View user's profile Send private message Reply with quote
revolution
When all else fails, read the source


Joined: 24 Aug 2004
Posts: 17279
Location: In your JS exploiting you and your system
revolution
Tomasz Grysztar wrote:
Perhaps we should now announce a contest for the fastest implementation in assembly? Wink
Yeah, good idea. Whomever can write the implementation the fastest. So get going everyone, it doesn't matter how well it performs or even how ugly the code is, just get it written, and working properly, in the shortest possible time.
Post 04 Oct 2012, 10:57
View user's profile Send private message Visit poster's website Reply with quote
edfed



Joined: 20 Feb 2006
Posts: 4237
Location: 2018
edfed
ok for the "contest", lets go for the saturday october 13th closing date then.

http://keccak.noekeon.org/ wrote:

In software, Keccak[] takes about 13 cycles per byte on the reference platform defined by NIST.

Smile
Post 05 Oct 2012, 08:10
View user's profile Send private message Visit poster's website Reply with quote
Display posts from previous:
Post new topic Reply to topic

Jump to:  


< Last Thread | Next Thread >
Forum Rules:
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You can attach files in this forum
You can download files in this forum


Copyright © 1999-2020, Tomasz Grysztar.

Powered by rwasa.