Really fast syndrome-based hashing D. J. Bernstein University of - PDF document

Dec 11, 2023 •220 likes •252 views

Really fast syndrome-based hashing D. J. Bernstein University of Illinois at Chicago Joint work with: Tanja Lange Technische Universiteit Eindhoven Christiane Peters Technische Universiteit Eindhoven Peter Schwabe Academia Sinica Remember

Really fast syndrome-based hashing D. J. Bernstein University of Illinois at Chicago Joint work with: Tanja Lange Technische Universiteit Eindhoven Christiane Peters Technische Universiteit Eindhoven Peter Schwabe Academia Sinica
Remember FSB? SHA-3 submission by Augot– Finiasz–Gaborit–Manuel–Sendrier. FSB compression function (plus Whirlpool output filter). Simple compression function. Well-understood attack ideas: information-set decoding, linearization, Wagner. FSB-256 seems quite secure. Bad: Not actually fast. Schwabe asm, Core 2 Q9550, FSB-256: 95.53 cycles/byte.
What we’ve done: RFSB compression function. Our asm, Core 2 Q9550, RFSB-509: 13.62 cycles/byte. Faster than SHA-256; faster than JH; faster than Grøstl. Plus extra speed features: incremental hashing, fast batch verification. Cost ❃ 2 128 for all known collision attacks on RFSB-509.

Download Presentation

Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Database Systems Index: Hashing Based on slides by Feifei Li, University of Utah Hashing n

Database Systems Index: Hashing Based on slides by Feifei Li, University of Utah Hashing n Hash-based indexes are best for equality selections . Cannot support range searches. n Static and dynamic hashing techniques exist. 2 Static Hashing n #

454 views • 41 slides

Overview Intro to Hashing Intro to Hashing Hashing with Chaining Whats hashing?

Overview Intro to Hashing Intro to Hashing Hashing with Chaining Whats hashing? Distribute key/value pairs across bins with a hash function , Hashing Performance Hashing (Application of Probability) which maps elements from

497 views • 3 slides

Discrete Hashing Fast, scalable retrieval and classification Fumin Shen Center for Future Media,

Discrete Hashing Fast, scalable retrieval and classification Fumin Shen Center for Future Media, University of Electronic Science and Technology of China Outline Introduction to Hashing Discrete optimization for Hashing Applications

818 views • 48 slides

NTRU Prime A field-based system that reduces (potential) attack surface, while still being fast

NTRU Prime A field-based system that reduces (potential) attack surface, while still being fast and compact Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange, and Christine van Vredendaal 29 June 2018 Bernstein, Chuengsatiansup,

1.18k views • 36 slides

Improved Fast Syndrome Based Cryptographic Hash Functions Matthieu Finiasz , Philippe Gaborit,

ECRYPT Hash Workshop 2007 Improved Fast Syndrome Based Cryptographic Hash Functions Matthieu Finiasz , Philippe Gaborit, and Nicolas Sendrier The Original FSB Hash Function [Augot, Finiasz, Sendrier - Mycrypt 05] Based on the Merkle-Damg

303 views • 19 slides

A Family of Fast Syndrome Based Cryptographic Hash Functions Daniel Augot, Matthieu Finiasz and

A Family of Fast Syndrome Based Cryptographic Hash Functions Daniel Augot, Matthieu Finiasz and Nicolas Sendrier Part I General Facts about Hash Functions The Merkle-Damg ard construction D Padding + length n n n o o o i i i s s

393 views • 25 slides

Small high-security encryption, authentication, and hashing D. J. Bernstein University of

Small high-security encryption, authentication, and hashing D. J. Bernstein University of Illinois at Chicago Main goals of cryptography Alice and Bob are communicating. Eve is eavesdropping. Alice and Bob have several standard security

310 views • 29 slides

McBits: fast constant-time code-based cryptography (to appear at CHES 2013) D. J. Bernstein

McBits: fast constant-time code-based cryptography (to appear at CHES 2013) D. J. Bernstein University of Illinois at Chicago & Technische Universiteit Eindhoven Joint work with: Tung Chou Technische Universiteit Eindhoven Peter

625 views • 41 slides

McBits: fast constant-time code-based cryptography (to appear at CHES 2013) D. J. Bernstein

823 views • 46 slides

McBits: fast constant-time code-based cryptography (to appear at CHES 2013) D. J. Bernstein

643 views • 52 slides

14. Hashing Gloal: Efficient management of a table of all n ETH-students of Possible Requirement:

Motivating Example 14. Hashing Gloal: Efficient management of a table of all n ETH-students of Possible Requirement: fast access (insertion, removal, find) of a Hash Tables, Pre-Hashing, Hashing, Resolving Collisions using dataset by name

158 views • 15 slides

14. Hashing Hash Tables, Pre-Hashing, Hashing, Resolving Collisions using Chaining, Simple

14. Hashing Hash Tables, Pre-Hashing, Hashing, Resolving Collisions using Chaining, Simple Uniform Hashing, Popular Hash Functions, Table-Doubling, Open Addressing: Probing, Uniform Hashing, Universal Hashing, Perfect Hashing [Ottman/Widmayer,

1.25k views • 98 slides

14. Hashing Hash Tables, Pre-Hashing, Hashing, Resolving Collisions using Chaining, Simple

1.5k views • 58 slides

McBits: fast constant-time code-based cryptography D. J. Bernstein University of Illinois at

McBits: fast constant-time code-based cryptography D. J. Bernstein University of Illinois at Chicago & Technische Universiteit Eindhoven Joint work with: Tung Chou Technische Universiteit Eindhoven Peter Schwabe Radboud University

902 views • 43 slides

Speed, speed, speed $1000 TCR hashing competition D. J. Bernstein Crowley: I have a problem

1 2 Speed, speed, speed $1000 TCR hashing competition D. J. Bernstein Crowley: I have a problem where I need to make some University of Illinois at Chicago; cryptography faster, and Im Ruhr University Bochum setting up a $1000

573 views • 55 slides

Lecture 8 HASHING!!!!! Announcements HW3 due Friday! HW4 posted Friday! Today: hashing

Lecture 8 HASHING!!!!! Announcements HW3 due Friday! HW4 posted Friday! Today: hashing # 1 NIL 22 2 NIL 13 43 3 NIL 9 9 NIL n=9 buckets Outline Hash tables are another sort of data structure that allows fast

966 views • 59 slides

The k -sum Problem Solutions and Applications Christiane Peters Ice Break June 8, 2013 Talk

The k -sum Problem Solutions and Applications Christiane Peters Ice Break June 8, 2013 Talk outline 1. Motivation 2. Information-set decoding 3. Linearization 4. Generalized birthday attacks 5. Outlook 1/42 1. Motivation 2.

845 views • 60 slides

SI425 : NLP Set 13 Information Extraction Information Extraction Yesterday GM released third

SI425 : NLP Set 13 Information Extraction Information Extraction Yesterday GM released third quarter GM profit-increase 10% results showing a 10% in profit over the same period last year. John Doe was convicted Tuesday on John Doe

609 views • 41 slides

Defining Virtual Reality Websters New Universal Unabridged Dictionary (1989) defines

Defining Virtual Reality Websters New Universal Unabridged Dictionary (1989) defines Virtual as being in essence or effect, but not in fact Websters defines reality as the state or quality of being real Introduction

1.05k views • 83 slides

Polytope Codes in Networks, Storage, and Multiple Descriptions Oliver Kosut Joint work with Lang

Polytope Codes in Networks, Storage, and Multiple Descriptions Oliver Kosut Joint work with Lang Tong, David Tse, Aaron Wagner, and Xiaoqing Fan April 1, 2015 Networks with Active Adversaries Distributed system in the presence of active

1.44k views • 118 slides

Objectives Describe the process of change by which law enforcement is trained on appropriate

8/2/2018 Feeling Safe and Understood in the Community One States Experience with People with Intellectual and Developmental Disabilities and the Training of Law Enforcement Logos for the MD Department of Disabilities, the MD Police and

467 views • 22 slides

1 Mercadologia Mercadologia Mercadologia Mercadologia Referncia Bibliogr Referncia

Mercadologia Mercadologia Mercadologia Mercadologia Referncia Bibliogr Referncia Bibliogrfica: KOTLER, Phillip. Marketing Essencial fica: KOTLER, Phillip. Marketing Essencial Referncia Bibliogrfica: KOTLER, Phillip. Marketing

464 views • 12 slides

On the Design of Code-Based Signatures Ayoub Otmani ayoub.otmani@unicaen.fr Outline 1.

Code-Based Cryptography Workshop 2012 9 11 May 2012, Lyngby, Denmark On the Design of Code-Based Signatures Ayoub Otmani ayoub.otmani@unicaen.fr Outline 1. Fiat-Shamir paradigm 2. Hash-and-Sign paradigm 3. Lossy Source Coding

664 views • 50 slides

Objectives Describe the process of change by which law enforcement is trained on appropriate

345 views • 15 slides