Concept

Taille de bloc (cryptographie)

Publications associées (13)

Y QC-MDPC Decoders with Several Shades of Gray

QC-MDPC code-based KEMs rely on decoders that have a small or even negligible Decoding Failure Rate (DFR). These decoders should be efficient and implementable in constant-time. One example for a QC-MDPC KEM is the Round-2 candidate of the NIST PQC standar ...

SPRINGER INTERNATIONAL PUBLISHING AG2020

Effect of a second layer on the time to failure of compressed riprap as mountain riverbank protection

Anton Schleiss, Michael Pfister, Mário Jorge Rodrigues Pereira Da Franca, Mona Jafarnejad Chaghooshi

Recently, Jafarnejad, Franca, Pfister, and Schleiss [2017. Time-based failure analysis of compressed riverbank riprap. Journal of Hydraulic Research, 55(2), 224–235. doi: 10.1080/00221686.2016.1212940] presented an experimental study on the stability of co ...

2019

Design of Riverbank Riprap Using Large, Individually Placed Blocks

Anton Schleiss, Michael Pfister, Mário Jorge Rodrigues Pereira Da Franca, Mona Jafarnejad Chaghooshi

The protection of river banks in mountain rivers by riprap requires large blocks with weights typically exceeding 1 t. Thus, the blocks have to be placed individually. Such packed riprap has a relatively small spacing between the blocks. Consequently, the ...

2019

Generalized Skipgrams for Pattern Discovery in Polyphonic Streams

Martin Alois Rohrmeier, Markus Franz Josef Neuwirth, Christoph Finkensiep

The discovery of patterns using a minimal set of assumptions constitutes a central challenge in the modeling of polyphonic music and complex streams in general. Skipgrams have been found to be a powerful model for capturing semi-local dependencies in seque ...

2018

Improved Linear Cryptanalysis of Reduced-Round MIBS

Serge Vaudenay, Asli Bay, Jialin Huang

MIBS is a 32-round lightweight block cipher with 64-bit block size and two different key sizes, namely 64-bit and 80-bit keys. Bay et al. provided the first impossible differential, differential and linear cryptanalyses of MIBS. Their best attack was a lin ...

Springer2014

Collision Attacks against the Knudsen-Preneel Compression Functions

Martijn Stam, Onur Özen

Knudsen and Preneel (Asiacrypt'96 and Crypto'97) introduced a hash function design in which a linear error-correcting code is used to build a wide-pipe compression function from underlying blockciphers operating in Davies-Meyer mode. Their main design goal ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Dynamic Visual Attention on the Sphere

Pierre-André Farine, Heinz Hügli, Iva Bogdanova Vandergheynst, Alexandre Bur

In this paper we present a computational model of dynamic visual attention on the sphere which combines static (intensity,chromaticity, orientation) and motion features in order to detect salient locations in omnidirectional image sequences while working d ...

Elsevier2010

A Universal Encryption Standard

Serge Vaudenay

DES and triple-DES are two well-known and popular encryption algorithms, but they both have the same drawback : their block size is limited to 64 bits. While the cryptographic community is working hard to select and evaluate candidates and finalists for th ...

2000

On the pseudorandomness of top-level schemes of block ciphers

Serge Vaudenay

Block ciphers are usually based on one top-level scheme into which we plug Âround functionsÂ. To analyze security, it is important to study the intrinsic security provided by the top-level scheme from the viewpoint of randomness: given a block cipher in ...

2000

Comparison of the Randomness Provided by Some AES Candidates

Serge Vaudenay

Using the decorrelation techniques we compare the randomness of three schemes used in the AES candidates. The target schemes are the original Feistel scheme and two modified Feistel schemes: the MARS-like structure and the CAST256-like structure. As a resu ...

1999

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search