really fast syndrome based hashing d j bernstein
play

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

  1. 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

  2. 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.

  3. 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.

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

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?

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,

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

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,

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

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

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

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

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

823 views • 46 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

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

643 views • 52 slides
14. Hashing Gloal: Efficient management of a table of all n ETH-students of Possible Requirement:

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

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

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.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

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

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

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
Fast Constant-Time GCD Computation and Modular Inversion Daniel J. Bernstein 1,2 Bo-Yin Yang 3 1

Fast Constant-Time GCD Computation and Modular Inversion Daniel J. Bernstein 1,2 Bo-Yin Yang 3 1

Fast Constant-Time GCD Computation and Modular Inversion Daniel J. Bernstein 1,2 Bo-Yin Yang 3 1 University of Illinois at Chicago 2 Ruhr Universt at Bochum 3 Academia Sinica Monday, August 26, 2019 Summary: Fast, Safe GCD and Inversions

431 views • 23 slides
SipHash: a fast short-input PRF Jean-Philippe Aumasson, Daniel J. Bernstein SipHash: a fast

SipHash: a fast short-input PRF Jean-Philippe Aumasson, Daniel J. Bernstein SipHash: a fast

SipHash: a fast short-input PRF Jean-Philippe Aumasson, Daniel J. Bernstein SipHash: a fast short-input MAC Jean-Philippe Aumasson, Daniel J. Bernstein UMAC (Black, Halevi, Krawczyk, Krovetz, Rogaway; 2000)

620 views • 43 slides
CS 225 Data Structures Oc October 26 26 Ha Hashing G G Carl Evans What if

CS 225 Data Structures Oc October 26 26 Ha Hashing G G Carl Evans What if

CS 225 Data Structures Oc October 26 26 Ha Hashing G G Carl Evans What if ( ! ) is not fast enough? Do you feel lucky? A H A Hash T Table b based D Dictionary Client Code: 1 Dictionary<KeyType,

604 views • 24 slides
Algorithmic Improvements for Fast Concurrent Cuckoo Hashing Xiaozhou

Algorithmic Improvements for Fast Concurrent Cuckoo Hashing Xiaozhou

Algorithmic Improvements for Fast Concurrent Cuckoo Hashing Xiaozhou Li ( Princeton ) David G. Andersen (CMU) Michael Kaminsky (Intel Labs) Michael J. Freedman

969 views • 38 slides
MIMA Group Fast Scalable Supervised Hashing Xin Luo 1 , Liqiang Nie 2 , Xiangnan He 3 Ye Wu 1 ,

MIMA Group Fast Scalable Supervised Hashing Xin Luo 1 , Liqiang Nie 2 , Xiangnan He 3 Ye Wu 1 ,

MIMA Group Fast Scalable Supervised Hashing Xin Luo 1 , Liqiang Nie 2 , Xiangnan He 3 Ye Wu 1 , Zhen-Duo Chen 1 , Xin-Shun Xu 1 1 Lab of M achine I ntelligence & M edia A nalysis, School of Software, Shandong University, China 2 School of

541 views • 34 slides
Syndrome Decoding in the Non-Standard Cases Matthieu Finiasz Outline The Problem of Syndrome

Syndrome Decoding in the Non-Standard Cases Matthieu Finiasz Outline The Problem of Syndrome

Syndrome Decoding in the Non-Standard Cases Matthieu Finiasz Outline The Problem of Syndrome Decoding I The Cryptosystems of McEliece and Niederreiter II McEliece-Based Signatures III Provably Secure Syndrome-Based Hash Functions IV The

441 views • 32 slides
SipHash: a fast short-input PRF D. J. Bernstein, University of Illinois at Chicago &

SipHash: a fast short-input PRF D. J. Bernstein, University of Illinois at Chicago &

SipHash: a fast short-input PRF D. J. Bernstein, University of Illinois at Chicago & Technische Universiteit Eindhoven Joint work with: Jean-Philippe Aumasson, Kudelski Security (NAGRA) https://131002.net/siphash/ Advertisement:

578 views • 28 slides
How fast are hash functions? D. J. Bernstein University of Illinois at Chicago NSF ITR0716498

How fast are hash functions? D. J. Bernstein University of Illinois at Chicago NSF ITR0716498

How fast are hash functions? D. J. Bernstein University of Illinois at Chicago NSF ITR0716498 in cooperation with IST2002507932 ECRYPT Depends on the volume of data being hashed. For small data volumes can often see big costs for

1.14k views • 66 slides

More recommend