Recherche

Afficher tous les résultats pour

Accueil

Concept

Cryptographie sur les courbes elliptiques

Applied sciences
Génie informatique
Sécurité des systèmes d'inf...
Cryptographie asymétrique

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (30)

Computing Cyclic Isogenies between Principally Polarized Abelian Varieties over Finite Fields

Marius Lorenz Vuille

Abelian varieties are fascinating objects, combining the fields of geometry and arithmetic. While the interest in abelian varieties has long time been of purely theoretic nature, they saw their first real-world application in cryptography in the mid 1980's ...

EPFL2020

Determining the Core Primitive for Optimally Secure Ratcheting

Serge Vaudenay, Muhammed Fatih Balli

After ratcheting attracted attention mostly due to practical real-world protocols, recently a line of work studied ratcheting as a primitive from a theoretic point of view. Literature in this line, pursuing the strongest security of ratcheting one can hope ...

2020

Time in cryptography

Gwangbae Choi

Time travel has always been a fascinating topic in literature and physics. In cryptography, one may wonder how to keep data confidential for some time. In this dissertation, we will study how to make private information travel to the future. This dissertat ...

EPFL2020

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

Serge Vaudenay

The maximal achievable advantage of a (computationally unbounded) distinguisher to determine whether a source

Z

is distributed according to distribution

P_0

P_1

, when given access to one sample of

Z

, is characterized by the statistical distance ...

Springer, Cham2020

Using the new VPMADD instructions for the new post quantum key encapsulation mechanism SIKE

Dusan Kostic

This paper demonstrates the use of new processor instructions VPMADD, intended to appear in the coming generation of Intel processors (codename "Cannon Lake"), in order to accelerate the newly proposed key encapsulation mechanism (KEM) named SIKE. SIKE is ...

IEEE COMPUTER SOC2019

On the Security of Two-Round Multi-Signatures

Bryan Alexander Ford, Manu Drijvers, Kasra Edalatnejadkhamene

A multi-signature scheme allows a group of signers to collaboratively sign a message, creating a single signature that convinces a verifier that every individual signer approved the message. The increased interest in technologies to decentralize trust has ...

IEEE Computer Society2019

Reducing Metadata Leakage from Encrypted Files and Communication with PURBs

Jean-Pierre Hubaux, Bryan Alexander Ford, Ludovic Barman, Kirill Nikitin, Wouter Lueks, Matthew Joshua Underwood

Most encrypted data formats leak metadata via their plaintext headers, such as format version, encryption schemes used, number of recipients who can decrypt the data, and even the recipients’ identities. This leakage can pose security and privacy risks to ...

Sciendo2019

Dual comb generation in a monochromatically driven crystalline microresonator

Tobias Kippenberg, Erwan Guillaume Albert Lucas, Wenle Weng

Recent works on Kerr frequency combs demonstrated the possibility to simultaneously generate multiple soliton states with different group velocities in a single microresonator, which could be beneficial for many applications utilizing dual-comb systems. In ...

SPIE-INT SOC OPTICAL ENGINEERING2019

Arithmetic and geometric structures in cryptography

Benjamin Pierre Charles Wesolowski

We explore a few algebraic and geometric structures, through certain questions posed by modern cryptography. We focus on the cases of discrete logarithms in finite fields of small characteristic, the structure of isogeny graphs of ordinary abelian varietie ...

EPFL2018

Indiscreet logarithms in finite fields of small characteristic

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) in finite fields of small characteristic, despite progress having remained essentially static for nearly thirty years, with the best known algorithms being ...

2018

Page 2 sur 2