fast fpga implementation of diffie hellman on the kummer
play

Fast FPGA Implementation of Diffie-Hellman on the Kummer Surface of - PowerPoint PPT Presentation

Aug 20, 2022 •144 likes •319 views

Fast FPGA Implementation of Diffie-Hellman on the Kummer Surface of a Genus-2 Curve Philipp Koppermann, Fabrizio De Santis, Johann Heyszl and Georg Sigl History of High-Speed Curve Cryptography over Prime Fields 1 Point Addition on a

  1. Fast FPGA Implementation of Diffie-Hellman on the Kummer Surface of a Genus-2 Curve Philipp Koppermann, Fabrizio De Santis, Johann Heyszl and Georg Sigl

  2. History of High-Speed Curve Cryptography over Prime Fields 1

  3. Point Addition on a Hyperelliptic Genus-2 Curve 2

  4. Point Addition on a Hyperelliptic Genus-2 Curve 3

  5. Kummer: Smaller Field But More Operations 4

  6. Structure of the Kummer-Based Scalar Multiplication 5

  7. Architecture of the Single-Core Implementation 6

  8. Techniques for Designing the Modular Multiplier 7

  9. Modular Multiplication using Mersenne Primes M p = 2 p − 1 8

  10. Regroup the Digit-Products on a Bit-Level 9

  11. Scheduling the Field Operations for a Scalar Multiplication 10

  12. Scheduling the Field Operations for a Scalar Multiplication 11

  13. Single-Core: Performance and Area Results 12

  14. Multi-Core: Performance and Area Results 13

  15. Three Take Home Messages 14

  16. Contact Information Philipp Koppermann Hardware Security Fraunhofer Institute for Applied and Integrated Security (AISEC) Phone: +49 89 3229986-138 E-Mail: philipp.koppermann@aisec.fraunhofer.de 15

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

Lecture Outline Review of Diffie-Hellman key exchange Looking at Authentication from a

Lecture Outline Review of Diffie-Hellman key exchange Looking at Authentication from a

Lecture Outline Review of Diffie-Hellman key exchange Looking at Authentication from a number of perspectives Today: authenticating users, services Agreeing on Secret Keys Without Prior Arrangement Diffie-Hellman Key Exchange

1.07k views • 73 slides
Lecture 8 Public Key Cryptography (Diffie-Hellman and RSA) 1 Public Key Cryptography

Lecture 8 Public Key Cryptography (Diffie-Hellman and RSA) 1 Public Key Cryptography

Lecture 8 Public Key Cryptography (Diffie-Hellman and RSA) 1 Public Key Cryptography Asymmetric cryptography Invented in 1974-1978 (Diffie-Hellman and Rivest-Shamir- Adleman) Two keys: private (SK), public (PK) Encryption: with

445 views • 17 slides
Lecture 7 Public Key Cryptography (Diffie-Hellman and RSA) 1 Public Key Cryptography

Lecture 7 Public Key Cryptography (Diffie-Hellman and RSA) 1 Public Key Cryptography

Lecture 7 Public Key Cryptography (Diffie-Hellman and RSA) 1 Public Key Cryptography Asymmetric cryptography Invented in 1974-1978 (Diffie-Hellman and Rivest-Shamir- Adleman) Two keys: private (SK), public (PK) Encryption:

810 views • 42 slides
Lecture 8 Public Key Cryptography (Diffie-Hellman and RSA) 1 Public Key Cryptography

Lecture 8 Public Key Cryptography (Diffie-Hellman and RSA) 1 Public Key Cryptography

Lecture 8 Public Key Cryptography (Diffie-Hellman and RSA) 1 Public Key Cryptography Asymmetric cryptography Invented in 1974-1978 (Diffie-Hellman and Rivest-Shamir- Adleman) Two keys: private (SK), public (PK) Encryption:

256 views • 22 slides
Diffie-Hellman, discrete logs, the NSA, and you J. Alex Halderman University of Michigan Based

Diffie-Hellman, discrete logs, the NSA, and you J. Alex Halderman University of Michigan Based

Diffie-Hellman, discrete logs, the NSA, and you J. Alex Halderman University of Michigan Based on joint work: Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice David Adrian, Karthikeyan Bhargavan, Zakir Durumeric, Pierrick Gaudry,

879 views • 63 slides
High-speed Diffie-Hellman, part 2 D. J. Bernstein University of Illinois at Chicago Classic

High-speed Diffie-Hellman, part 2 D. J. Bernstein University of Illinois at Chicago Classic

High-speed Diffie-Hellman, part 2 D. J. Bernstein University of Illinois at Chicago Classic question about the Diffie-Hellman system: How quickly can we compute n th powers mod p ? Modular exponentiation. p ; Assume standard prime p =

684 views • 45 slides
1 Diffie-Hellman exponential key exchange Diffie-Hellman exponential key exchange Alice has

1 Diffie-Hellman exponential key exchange Diffie-Hellman exponential key exchange Alice has

Symmetric cryptography Both parties must agree on a secret key, K message is encrypted, sent, decrypted at other side E K (P) D K (C) Secure Communication Bob Alice Key distribution must be secret otherwise messages can be

553 views • 10 slides
RSA Public Key CryptoSystem One way Trapdoor Functions Diffie and Hellman (76) New Directions

RSA Public Key CryptoSystem One way Trapdoor Functions Diffie and Hellman (76) New Directions

RSA Public Key CryptoSystem One way Trapdoor Functions Diffie and Hellman (76) New Directions in Cryptography Split the Bobs secret key K to two parts: K E , to be used for encrypting messages to Bob. K D , to be used for

482 views • 32 slides
C.c) DSA and Diffie-Hellman W. Schindler: Cryptography, B-IT, winter 2006 / 2007 2 C.73 DSA

C.c) DSA and Diffie-Hellman W. Schindler: Cryptography, B-IT, winter 2006 / 2007 2 C.73 DSA

1 C.c) DSA and Diffie-Hellman W. Schindler: Cryptography, B-IT, winter 2006 / 2007 2 C.73 DSA (Digital Signature Algorithm) standardized by NIST A) Generation of a key pair Select a prime q with 2 159 < q < 2 160 Select a

348 views • 11 slides
Diffie-Hellman not secure against Man-in-the-Middle-attack: Want to guarantee authenticity. Alice

Diffie-Hellman not secure against Man-in-the-Middle-attack: Want to guarantee authenticity. Alice

Diffie-Hellman not secure against Man-in-the-Middle-attack: Want to guarantee authenticity. Alice Mallory Bob Can achieve this with publc-key cryptography as well. g a a First example: Schnorr Signature g m m a 1024 bit

283 views • 3 slides
Diffie-Hellman not secure against Man-in-the-Middle-attack: Alice Mallory Bob g a a g

Diffie-Hellman not secure against Man-in-the-Middle-attack: Alice Mallory Bob g a a g

Diffie-Hellman not secure against Man-in-the-Middle-attack: Alice Mallory Bob g a a g m m g ma g ma g n n g b b g nb g nb g ma g ma , g nb g nb Eike Ritter Cryptography 2014/15 106

417 views • 9 slides
Public Key Cryptography Diffie-Hellman Others CSS441: Security and Cryptography Sirindhorn

Public Key Cryptography Diffie-Hellman Others CSS441: Security and Cryptography Sirindhorn

CSS441 Public Key Crypto Principles RSA Public Key Cryptography Diffie-Hellman Others CSS441: Security and Cryptography Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 20 December 2015

461 views • 29 slides
A Static Diffie-Hellman Attack on Several Direct Anonymous Attestation Schemes Ernie Brickell 1

A Static Diffie-Hellman Attack on Several Direct Anonymous Attestation Schemes Ernie Brickell 1

A Static Diffie-Hellman Attack on Several Direct Anonymous Attestation Schemes Ernie Brickell 1 Liqun Chen 2 Jiangtao Li 1 1. Intel Corporation, Hillsboro, Oregon, USA 2. Hewlett-Packard Laboratories, Bristol, UK InTrust 2012 Royal Holloway,

827 views • 17 slides
On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields Robert Granger

On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields Robert Granger

Background and Motivation Main Algorithm and Results On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields Robert Granger rgranger@computing.dcu.ie Claude Shannon Institute, UCD and DCU, Ireland ASIACRYPT, 8th December

655 views • 48 slides
Measuring small subgroup attacks against Diffie-Hellman Luke Valenta , David Adrian ,

Measuring small subgroup attacks against Diffie-Hellman Luke Valenta , David Adrian ,

Measuring small subgroup attacks against Diffie-Hellman Luke Valenta , David Adrian , Antonio Sanso , Shaanan Cohney , Joshua Fried , Marcella Hastings , J. Alex Halderman , Nadia Heninger University of

461 views • 42 slides
Intro to Public Key Cryptography Diffie & Hellman Key Exchange Course Summary

Intro to Public Key Cryptography Diffie & Hellman Key Exchange Course Summary

Intro to Public Key Cryptography Diffie & Hellman Key Exchange Course Summary Introduction Stream & Block Ciphers Block Ciphers Modes (ECB,CBC,OFB) Advanced Encryption Standard (AES) Message

243 views • 20 slides
FPGA-based Multithreading for In-Memory Hash Joins Robert J. Halstead , Ildar Absalyamov , Walid

FPGA-based Multithreading for In-Memory Hash Joins Robert J. Halstead , Ildar Absalyamov , Walid

FPGA-based Multithreading for In-Memory Hash Joins Robert J. Halstead , Ildar Absalyamov , Walid A. Najjar, Vassilis J. Tsotras University of California, Riverside Outline Background What are FPGAs Multithreaded Architectures

343 views • 18 slides
We Well llcom come to TA TACO CO! GCIG/KGOG1027/TGCS2012: Randomized Phase III Clinical

We Well llcom come to TA TACO CO! GCIG/KGOG1027/TGCS2012: Randomized Phase III Clinical

Gynecologic Cancer InterGroup Cervix Cancer Research Network We Well llcom come to TA TACO CO! GCIG/KGOG1027/TGCS2012: Randomized Phase III Clinical Trial Comparing Weekly vs Tri-weekly Cisplatin Based Concurrent Chemoradiation in Locally

645 views • 19 slides
1 Introduction Co-Occurrences Frequent Item Tree Association rule mining FP Growth Ying

1 Introduction Co-Occurrences Frequent Item Tree Association rule mining FP Growth Ying

1 Introduction Co-Occurrences Frequent Item Tree Association rule mining FP Growth Ying Xu COFI tree mining yx2@cs.ualberta.ca (COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation Hajj,

393 views • 6 slides
Multiple Issue Previous techniques - Try to achieve an

Multiple Issue Previous techniques - Try to achieve an

Multiple Issue Previous techniques - Try to achieve an ideal CPI of 1 by overcoming data and control hazards Mul$ple issue - Issue

546 views • 11 slides
discussion on ML in FPGAs 1 T RIGGER S YSTEM 2 40 MHz subset data Level-1 full data

discussion on ML in FPGAs 1 T RIGGER S YSTEM 2 40 MHz subset data Level-1 full data

discussion on ML in FPGAs 1 T RIGGER S YSTEM 2 40 MHz subset data Level-1 full data Custom Electronics Absorbs ~100s Tb/s Trigger decision in ~10 s 100 kHz High Level Trigger ~13k CPU farm 100 ms/event 500 Hz Offline

360 views • 6 slides
FT-UNSHADES2. H.G. Miranda, M.A. Aguirre, J. Barrientos, L. Sanz Electronic Engineering Dpt.

FT-UNSHADES2. H.G. Miranda, M.A. Aguirre, J. Barrientos, L. Sanz Electronic Engineering Dpt.

FT-UNSHADES2. H.G. Miranda, M.A. Aguirre, J. Barrientos, L. Sanz Electronic Engineering Dpt. School of Engineering. University of Sevilla (SPAIN) Sevilla, March 2014 FT -UNSHADES goals FT -UNSHADES is a tool for SEE EMULATION, at netlist

477 views • 25 slides
Exchange on Low-Cost FPGAs Tobias Oder and Tim Gneysu Ruhr-University Bochum Latincrypt 2017

Exchange on Low-Cost FPGAs Tobias Oder and Tim Gneysu Ruhr-University Bochum Latincrypt 2017

Implementing the NewHope-Simple Key Exchange on Low-Cost FPGAs Tobias Oder and Tim Gneysu Ruhr-University Bochum Latincrypt 2017 20.09.2017 Public-Key Crypto and Long-Term Security NewHope on FPGA | Tobias Oder and Tim Gneysu |

562 views • 24 slides
Embedded systems and the role of programmable logic devices in embedded systems Embedded system :

Embedded systems and the role of programmable logic devices in embedded systems Embedded system :

Embedded systems and the role of programmable logic devices in embedded systems Embedded system : a combination of computer hardware and software, and perhaps additional mechanical or other parts, designed to perform a dedicated function. In some

414 views • 20 slides

More recommend