cryptographic hash function edon r
play

Cryptographic Hash Function EDON-R Presented by Prof. Danilo - PowerPoint PPT Presentation

Sep 14, 2023 •161 likes •719 views

1 Cryptographic Hash Function EDON-R Presented by Prof. Danilo Gligoroski Department of Telematics Faculty of Information Technology, Mathematics and Electrical Engineering Norwegian University of Science and TechnologyTechnology - NTNU,

  1. 1 Cryptographic Hash Function EDON-R Presented by Prof. Danilo Gligoroski Department of Telematics Faculty of Information Technology, Mathematics and Electrical Engineering Norwegian University of Science and TechnologyTechnology - NTNU, NORWAY 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  2. 2 Outline Short history of EDON-R Specific design characteristics Known attacks on EDON-R Are there any one-way bijections embedded in EDON-R? SW/HW performance and memory requirements 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  3. 3 Short history of EDON-R • Theoretical principles of EDON-R were described at the Second NIST Hash Workshop – 2006 in the presentation: Edon-R Family of Cryptographic Hash Functions – No concrete realization 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  4. 4 Short history of EDON-R • Theoretical principles of EDON-R were described at the Second NIST Hash Workshop – 2006 in the presentation: Edon-R Family of Cryptographic Hash Functions – No concrete realization • First implementation of Edon- R (256, 384, 512) published at http://eprint.iacr.org/2007/154 – Big acknowledgement for Søren Steffen Thomsen, giving me comments about zero being a fixed point in that realization 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  5. 5 Short history of EDON-R • Additionally, the following contributors joined the EDON-R (SHA-3) team: – Rune Steinsmo Ødegård – Investigating the mathematical properties of defined quasigroups – Marija Mihova – Investigating the differential properties in EDON-R operations – Svein Johan Knapskog (general comments and suggestions for improvements, proofreading) – Ljupco Kocarev (general comments and suggestions for improvements, proofreading) – Aleš Drápal (Theory of quasigroups and suggestions for improvements) – Vlastimil Klima (cryptanalysis and suggestions for improvements) 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  6. 6 Specific design characteristics for EDON-R 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  7. 7 Specific design characteristics for EDON-R Concatenation of at least 65 bits (Merkle-Damgård strenghtening) 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  8. 8 Specific design characteristics for EDON-R 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  9. 9 Specific design characteristics for EDON-R 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  10. 10 Specific design characteristics for EDON-R 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  11. 11 Specific design characteristics for EDON-R 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  12. 12 Specific design characteristics for EDON-R Function is defined by quasigroup operations 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  13. 13 Specific design characteristics for EDON-R Quasigroup operations are defined on 256-bit or 512-bit operands. 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  14. 14 Specific design characteristics for EDON-R Quasigroup operations are defined on 256-bit or 512-bit operands. (X 0 , X 1 , …, X 7 ) (Y 0 , Y 1 , …, Y 7 ) 32-bit or 64-bit variables 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  15. 15 Specific design characteristics for EDON-R Quasigroup operations are defined on 256-bit or 512-bit operands. (X 0 , X 1 , …, X 7 ) (Y 0 , Y 1 , …, Y 7 ) 32-bit or 64-bit variables Operations: 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  16. 16 Specific design characteristics for EDON-R 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  17. 17 Specific design characteristics for EDON-R Simple re-indexing (no computational costs) 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  18. 18 Specific design characteristics for EDON-R 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  19. 19 Specific design characteristics for EDON-R 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  20. 20 Specific design characteristics for EDON-R 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  21. 21 Specific design characteristics for EDON-R 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  22. 22 Specific design characteristics for EDON-R 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  23. 23 Specific design characteristics for EDON-R 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  24. 24 Specific design characteristics for EDON-R Rotations differ from each other for at least 2 positions. 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  25. 25 Specific design characteristics for EDON-R Two orthogonal Latin Squares of order 8 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  26. 26 Specific design characteristics for EDON-R Two orthogonal Latin Squares of order 8 Four corresponding nonsingular in (Z 2 , +, x ) matrices. 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  27. 27 Specific design characteristics for EDON-R Four nonsingular in (Z 2 , +, x ) matrices. 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  28. 28 Specific design characteristics for EDON-R Four nonsingular in (Z 2 , +, x ) matrices. Two diffusion (bi-stochastic) matrices 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  29. 29 Specific design characteristics for EDON-R 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  30. 30 Specific design characteristics for EDON-R 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  31. 31 Specific design characteristics for EDON-R 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  32. 32 Specific design characteristics for EDON-R 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  33. 33 Specific design characteristics for EDON-R 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  34. 34 Specific design characteristics for EDON-R 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  35. 35 Specific design characteristics for EDON-R Theorem 3: 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  36. 36 Specific design characteristics for EDON-R EDON-R is provably resistant against differential cryptanalysis 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  37. 37 Specific design characteristics for EDON-R EDON-R is provably resistant against differential cryptanalysis 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  38. 38 Specific design characteristics for EDON-R EDON-R is provably resistant against differential cryptanalysis 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  39. 39 Specific design characteristics for EDON-R EDON-R is provably resistant against differential cryptanalysis 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  40. 40 Specific design characteristics for EDON-R EDON-R is provably resistant against differential cryptanalysis 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  41. 41 Specific design characteristics for EDON-R EDON-R is provably resistant against differential cryptanalysis 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

  42. 42 Specific design characteristics for EDON-R EDON-R is provably resistant against differential cryptanalysis 25-28 Feb 2009, Leuven, Belgium, The First SHA-3 Candidate Conference, Cryptographic Hash Function EDON-R

Recommend

Hash Functions Hash Functions 1 Cryptographic Hash Function Crypto hash function h(x) must

Hash Functions Hash Functions 1 Cryptographic Hash Function Crypto hash function h(x) must

Hash Functions Hash Functions 1 Cryptographic Hash Function Crypto hash function h(x) must provide o Compression output length is small o Efficiency h(x) easy to compute for any x o One-way given a value y it is infeasible to find

465 views • 42 slides
ASIACRYPT 2013 1 Cryptographic Hash Function Public function Input: arbitrary long

ASIACRYPT 2013 1 Cryptographic Hash Function Public function Input: arbitrary long

Improved Cryptanalysis of Reduced RIPEMD-160 Florian Mendel, Thomas Peyrin, Martin Schlffer, Lei Wang, and Shuang Wu ASIACRYPT 2013 1 Cryptographic Hash Function Public function Input: arbitrary long messages Output: short random

840 views • 50 slides
, R ADIO G ATN , a belt-and-mill hash function a belt-and-mill hash function Guido Bertoni,

, R ADIO G ATN , a belt-and-mill hash function a belt-and-mill hash function Guido Bertoni,

R ADIO G ATN , R ADIO G ATN , a belt-and-mill hash function a belt-and-mill hash function Guido Bertoni, Joan Daemen, Michal Peeters * and Gilles Van Assche STMicroelectronics * De Valck Consultants Second Cryptographic Hash Workshop

474 views • 16 slides
New Attacks on the Concatenation and XOR Hash Combiners Itai Dinur Ben-Gurion University, Israel

New Attacks on the Concatenation and XOR Hash Combiners Itai Dinur Ben-Gurion University, Israel

New Attacks on the Concatenation and XOR Hash Combiners Itai Dinur Ben-Gurion University, Israel Cryptographic Hash Functions A cryptographic hash function is hash function H:{0,1}*-> {0,1} n with strong requirements : Collision

461 views • 33 slides
Cryptographic Hash Functions Debdeep Mukhopadhyay IIT Kharagpur Data Integrity

Cryptographic Hash Functions Debdeep Mukhopadhyay IIT Kharagpur Data Integrity

Cryptographic Hash Functions Debdeep Mukhopadhyay IIT Kharagpur Data Integrity Cryptographic Hash Function: Provides assurance of data integrity Let h be a hash function and x some data. The hash creates a fingerprint of the data,

564 views • 31 slides
Model-driven Design & Synthesis of the SHA-256 Cryptographic Hash Function in ReWire Bill

Model-driven Design & Synthesis of the SHA-256 Cryptographic Hash Function in ReWire Bill

Model-driven Design & Synthesis of the SHA-256 Cryptographic Hash Function in ReWire Bill Harrison University of Missouri Adam Procter Intel Corp. Gerard Allwein US Naval Research Laboratory October 7, 2016 Challenge: High Assurance Hardware

495 views • 14 slides
Cryptography Cryptographic Hash Functions Uwe Egly Vienna University of Technology Institute of

Cryptography Cryptographic Hash Functions Uwe Egly Vienna University of Technology Institute of

Cryptography Cryptographic Hash Functions Uwe Egly Vienna University of Technology Institute of Information Systems Knowledge-Based Systems Group 1 / 26 Overview Hash function (HF) accepts input of arbitrary length Returns

501 views • 26 slides
Cryptographic protocols Cryptographic protocols small programs designed to secure Introduction

Cryptographic protocols Cryptographic protocols small programs designed to secure Introduction

Cryptographic protocols Cryptographic protocols small programs designed to secure Introduction to cryptographic protocols communication (various security goals) Bruno Blanchet use cryptographic primitives (e.g. encryption, hash function,

451 views • 14 slides
HASH FUNCTIONS 1 / 62 What is a hash function? By a hash function we usually mean a map h : D

HASH FUNCTIONS 1 / 62 What is a hash function? By a hash function we usually mean a map h : D

HASH FUNCTIONS 1 / 62 What is a hash function? By a hash function we usually mean a map h : D { 0 , 1 } n that is compressing, meaning | D | > 2 n . E.g. D = { 0 , 1 } 2 64 is the set of all strings of length at most 2 64 . h n MD4

1.13k views • 78 slides
Cryptography Cryptographic Hash Functions Uwe Egly Knowledge-Based Systems Group Institute of

Cryptography Cryptographic Hash Functions Uwe Egly Knowledge-Based Systems Group Institute of

Cryptography Cryptographic Hash Functions Uwe Egly Knowledge-Based Systems Group Institute of Information Systems Vienna University of Technology 1 / 26 Overview Hash function (HF) accepts input of arbitrary length Returns

605 views • 26 slides
Hash Functions Vincent Rijmen Challenges and Perspectives for Academia and Industry Antwerp, May

Hash Functions Vincent Rijmen Challenges and Perspectives for Academia and Industry Antwerp, May

Hash Functions Vincent Rijmen Challenges and Perspectives for Academia and Industry Antwerp, May 27 th , 2008 A cryptographic hash function produces cryptographic checksums or fingerprints cryptographic checksums or fingerprints Fast

716 views • 25 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
x ? ? ? ? computation easy One Way Hash Function (OWHF) h h h h h

x ? ? ? ? computation easy One Way Hash Function (OWHF) h h h h h

ECRYPT Bart Preneel Emerging Topics in Cryptographic Design and Cryptanalysis Generic Constructions 30 April- 4 May 2007, Samos Greece for Iterated Hash Functions Outline Generic Constructions Generic Constructions for Iterated Hash

759 views • 10 slides
Cryptographic Hash Functions Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of

Cryptographic Hash Functions Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of

Cryptographic Hash Functions Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay July 17, 2018 1 / 15 Cryptographic Hash Functions Important building block in cryptography

270 views • 15 slides
Intro to Cryptography and Cryptocurrencies Cryptographic Hash Functions Hash Pointers and

Intro to Cryptography and Cryptocurrencies Cryptographic Hash Functions Hash Pointers and

Cryptocurrency Technologies Cryptography and Cryptocurrencies Intro to Cryptography and Cryptocurrencies Cryptographic Hash Functions Hash Pointers and Data Structures Block Chains Merkle Trees Digital Signatures Public

489 views • 27 slides
Cryptographic Hash Functions Signatures Requirements MD5 and SHA CSS441: Security and

Cryptographic Hash Functions Signatures Requirements MD5 and SHA CSS441: Security and

CSS441 Hash Functions Hash Functions Authentication Cryptographic Hash Functions Signatures Requirements MD5 and SHA CSS441: Security and Cryptography Sirindhorn International Institute of Technology Thammasat University Prepared by

1.04k views • 24 slides
Hash Functions and Hash Tables (2.5.2) A hash function h maps keys of a given type to

Hash Functions and Hash Tables (2.5.2) A hash function h maps keys of a given type to

Dictionaries 1/19/2005 11:37 PM Hash Functions and Hash Tables (2.5.2) A hash function h maps keys of a given type to Dictionaries and Hash Tables integers in a fixed interval [0, N 1] Example: h ( x ) = x mod N 0 is a hash function for

503 views • 4 slides
Tools in Cryptanalysis Florian Mendel - Tomislav Nad - Martin Schlffer Christoph Dobraunig -

Tools in Cryptanalysis Florian Mendel - Tomislav Nad - Martin Schlffer Christoph Dobraunig -

Tools in Cryptanalysis Florian Mendel - Tomislav Nad - Martin Schlffer Christoph Dobraunig - Maria Eichlseder Hash Functions A cryptographic hash function produces cryptographic checksums or fingerprints m Fast H Secure h Security

696 views • 42 slides
References Cryptographic Hash Functions Hash Functions, Chapter 11 of Understanding

References Cryptographic Hash Functions Hash Functions, Chapter 11 of Understanding

References Cryptographic Hash Functions Hash Functions, Chapter 11 of Understanding Cryptography by Paar & Pelzl. & Mathematical Cryptography , by Keijo Ruohonen, http://math.tut.fi/~ruohonen/MC.pdf , pages 9899. Signature

255 views • 10 slides
On recent attacks against Cryptographic Hash Functions Martin Eker & Henrik Ygge 1

On recent attacks against Cryptographic Hash Functions Martin Eker & Henrik Ygge 1

On recent attacks against Cryptographic Hash Functions Martin Eker & Henrik Ygge 1 Outline First part Preliminaries Which cryptographic hash functions exist? What degree of security do they offer? An

1.68k views • 98 slides
The Skein Hash Function First Hash Function Candidate Conference Leuven, Belgium 26 February 2009

The Skein Hash Function First Hash Function Candidate Conference Leuven, Belgium 26 February 2009

The Skein Hash Function First Hash Function Candidate Conference Leuven, Belgium 26 February 2009 Niels Ferguson Stefan Lucks Bruce Schneier Doug Whiting Mihir Bellare Tadayoshi Kohno Jon Callas Jesse Walker Overview Fast 6.1 cycles/byte on

581 views • 16 slides
LUX Hash Function Ivica Nikoli c, Alex Biryukov, Dmitry Khovratovich University of Luxembourg

LUX Hash Function Ivica Nikoli c, Alex Biryukov, Dmitry Khovratovich University of Luxembourg

LUX Hash Function LUX Hash Function Ivica Nikoli c, Alex Biryukov, Dmitry Khovratovich University of Luxembourg LUX Hash Function Outline 1 Design 2 Security Analysis 3 Implementation 4 Advantages LUX Hash Function Design Design LUX Hash

539 views • 28 slides
Practical attacks on AES-like cryptographic hash functions Stefan K olbl, Christian Rechberger

Practical attacks on AES-like cryptographic hash functions Stefan K olbl, Christian Rechberger

Practical attacks on AES-like cryptographic hash functions Stefan K olbl, Christian Rechberger DTU - Technical University of Denmark September 12, 2014 Cryptographic Hash Functions Today is the 12th of September... h 4981A99EDA782

1.01k views • 34 slides
Slinging the Hash (Function) What are hash functions good for? Hashing values to insert into

Slinging the Hash (Function) What are hash functions good for? Hashing values to insert into

Slinging the Hash (Function) What are hash functions good for? Hashing values to insert into arrays: hash tables Converting long strings into shorter strings in an irreversible way: one-way function Turn a 200 KB document into a 16

434 views • 5 slides

More recommend