List of contributed talks

Curves 1 - Monday, 10h45-11h45

  1. Claire Delaplace and Alexander May. Can we Beat the Square Root Bound for ECDLP over F(p^2) via Representations?
  2. Kazuhiro Yokoyama, Masaya Yasuda, Yasushi Takahashi and Jun Kogure. Complexity Bound on Semaev’s Naive Index Calculus Method for ECDLP

Hash functions - Monday, 16h-17h

  1. Hayley Tomkins, Monica Nevins and Hadi Salmasian. New Zémor-Tillich Type Hash Functions Over GL2(F_(p^n))
  2. Wouter Castryck, Thomas Decru and Benjamin Smith. Hash functions from superspecial genus-2 curves using Richelot isogenies

Constructions - Tuesday, 10h30-12h

  1. Eric Brier, Houda Ferradi, Marc Joye and David Naccache. New Number-Theoretic Cryptographic Primitives
  2. Carl Bootland, Wouter Castryck, Alan Szepieniec and Frederik Vercauteren. A Framework for Cryptographic Problems from Linear Algebra
  3. Christina Boura, Nicolas Gama, Mariya Georgieva and Dimitar Jetchev. CHIMERA: Combining Ring-LWE-based Fully Homomorphic Encryption Schemes

Curves 2 - Wednesday, 10h30-12h

  1. Leonardo Colò and David Kohel. Orienting supersingular isogeny graphs
  2. Taechan Kim and Mehdi Tibouchi. Equidistribution Among Cosets of Elliptic Curve Points in Intervals
  3. Ronal Pranil Chand and Maheswara Rao Valluri. Elliptic Curves in Generalized Huff's Model

Integers - Wednesday, 14h30-15h30

  1. Jacek Pomykała and Maciej Radziejewski. Integer factoring and compositeness witnesses
  2. Maciej Grzeskowiak. A variant of the large sieve inequality with explicit constants

Applications - Wednesday, 16h-17h

  1. Marc Joye. ECC Against Fault Attacks: The Ring Extension Method Revisited
  2. Giovanni Di Crescenzo, Matluba Khodjaeva, Delaram Kahrobaei and Vladimir Shpilrain. Delegating a Product of Group Exponentiations with Application to Signature Schemes

Cryptanalysis - Thursday, 10h30-12h

  1. Jean-Sebastien Coron and Agnese Gini. Improved Cryptanalysis of the AJPS Mersenne Based Cryptosystem
  2. Jung Hee Cheon, Wonhee Cho, Minki Hhan, Minsik Kang, Jiseung Kim and Changmin Lee. Algorithms for CRT-variant of Approximate Greatest Common Divisor Problem
  3. Andrea Lesavourey, Thomas Plantard and Willy Susilo. On ideal lattices in multicubic fields

19/06/2019 9:31:38

General Information

 

Funding

NutMiC 2019 is supported by the European Union's H2020 Program under grant agreement number ERC-669891

 

ERC                   Europe

Partners

In collaboration with IACR