Brute-force attack

Applied sciences
Computer engineering
Computer security
Public-key cryptography

About
Privacy
Disclaimer

Graph Chatbot

Related publications (28)

Authenticated Encryption with Variable Stretch

Serge Vaudenay, Damian Vizár, Reza Reyhanitabar

In conventional authenticated-encryption (AE) schemes, the ciphertext expansion, a.k.a.stretch or tag length, is a constant or a parameter of the scheme that must be fixed per key. However, using variable-length tags per key can be desirable in practice or ...

Springer-Verlag Berlin2016

Trustworthy Cloud Storage

Maxime Augier

The Cloud trend is an attempt to leverage economics of scale in the domain of computing resources. Unfortunately, this often means losing control of the lower levels of a computer system, and exposing users to new threat vectors. These threats may be signi ...

EPFL2016

GenoGuard: Protecting Genomic Data against Brute-Force Attacks

Jean-Pierre Hubaux, Jacques Fellay, Erman Ayday, Zhicong Huang, Ari Juels

Secure storage of genomic data is of great and increasing importance. The scientific community's improving ability to interpret individuals' genetic materials and the growing size of genetic database populations have been aggravating the potential conseque ...

2015

How to Sequentialize Independent Parallel Attacks? - Biased Distributions Have a Phase Transition

Serge Vaudenay, Sonia Mihaela Bogos

We assume a scenario where an attacker can mount several independent attacks on a single CPU. Each attack can be run several times in independent ways. Each attack can succeed after a given number of steps with some given and known probability. A natural q ...

2015

Breaking `128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in $\mathbb{F}_{2^{4 \cdot 1223}}$ and $\mathbb{F}_{2^{12 \cdot 367}}$)

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

In late 2012 and early 2013 the discrete logarithm problem (DLP) in finite fields of small characteristic underwent a dramatic series of breakthroughs, culminating in a heuristic quasi-polynomial time algorithm, due to Barbulescu, Gaudry, Joux and Thomé. U ...

Springer Berlin Heidelberg2014

Automated Side-Channel Vulnerability Discovery and Hardening : No-Cost Security Expertise for All

Ali Galip Bayrak

In traditional cryptography, an attacker tries to infer a mathematical relationship between the inputs and outputs of a cryptosystem to recover secret information. With the advances in the theoretical basis of the cryptographic algorithms, this task became ...

EPFL2014

An Architecture-Independent Instruction Shuffler to Protect against Side-Channel Attacks

Paolo Ienne, Ali Galip Bayrak, Nikola Velickovic, Wayne Burleson

Embedded cryptographic systems, such as smart cards, require secure implementations that are robust to a variety of low-level attacks. Side-Channel Attacks (SCA) exploit the information such as power consumption, electromagnetic radiation and acoustic leak ...

2012

Faster Software Cryptography

Dag Arne Osvik

This thesis presents work on the efficiency and security of cryptographic software. First it describes several efforts to construct very efficient implementations of cryptographic primitives. These include the Advanced Encryption Standard (AES) as well as ...

EPFL2012

Page 2 of 2