Improved Cryptanalysis of Skein

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Current cryptographic solutions will become obsolete with the arrival of large-scale universal quantum computers. As a result, the National Institute of Standards and Technology supervises a post-quantum standardization process which involves evaluating ca ...

Four recent trends have emerged in the evolution of authenticated encryption schemes: (1) Regarding simplicity, the adoption of public permutations as primitives allows for sparing a key schedule and the need for storing round keys; (2) using the sums of p ...

Witness encryption is a cryptographic primitive which encrypts a message under an instance of an NP language and decrypts the ciphertext using a witness associated with that instance. In the current state of the art, most of the witness encryption construc ...

We consider the problem of nonparametric estimation of the drift and diffusion coefficients of a Stochastic Differential Equation (SDE), based on n independent replicates {Xi(t) : t is an element of [0 , 1]}13 d B(t), where alpha is an element of {0 , 1} a ...

Global spectral methods offer the potential to compute solutions of partial differential equations numerically to very high accuracy. In this work, we develop a novel global spectral method for linear partial differential equations on cubes by extending th ...

We present Orthros, a 128-bit block pseudorandom function. It is designed with primary focus on latency of fully unrolled circuits. For this purpose, we adopt a parallel structure comprising two keyed permutations. The round function of each permutation is ...

Public knowledge about the structure of a cryptographic system is a standard assumption in the literature and algorithms are expected to guarantee security in a setting where only the encryption key is kept secret. Nevertheless, undisclosed proprietary cry ...

We introduce the "continuized" Nesterov acceleration, a close variant of Nesterov acceleration whose variables are indexed by a continuous time parameter. The two variables continuously mix following a linear ordinary differential equation and take gradien ...

Most communication systems (e.g., e-mails, instant messengers, VPNs) use encryption to prevent third parties from learning sensitive information. However, encrypted communications protect the contents but often leak metadata: the amount of data sent and th ...

It has been common knowledge that for a stream cipher to be secure against generic TMD tradeoff attacks, the size of its internal state in bits needs to be at least twice the size of the length of its secret key. In FSE 2015, Armknecht and Mikhalev however ...

Due to the rapidly growing number of devices that need to communicate securely, there is still significant interest in the development of efficient encryption schemes. It is important to maintain a portfolio of different constructions in order to enable a ...

Arguably one of the main applications of the LowMC family ciphers is in the post-quantum signature scheme PICNIC. Although LowMC family ciphers have been studied from a cryptanalytic point of view before, none of these studies were directly concerned with ...

We show that the finite time blow up solutions for the co-rotational Wave Maps problem constructed in [7,15] are stable under suitably small perturbations within the co-rotational class, provided the scaling parameter

λ(t)=t−1−ν

is sufficiently close to ...

This article proposes a dynamical system modeling approach for the analysis of longitudinal data of self-regulated homeostatic systems experiencing multiple excitations. It focuses on the evolution of a signal (e.g., heart rate) before, during, and after e ...

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 ...

Forkciphers are a new kind of primitive proposed recently by Andreeva et al. for efficient encryption and authentication of small messages. They fork the middle state of a cipher and encrypt it twice under two smaller independent permutations. Thus, forkci ...

The Sponge function is known to achieve 2c/2 security, where c is its capacity. This bound was carried over to its keyed variants, such as SpongeWrap, to achieve a min{2c/2,2 kappa} security bound, with kappa the key length. Similarly, many CAESAR competit ...

We study integrals of the form integral(Omega) f(d omega(1), ..., d omega(m)), where m >= 1 is a given integer, 1

We propose a data-driven Model Order Reduction (MOR) technique, based on Artificial Neural Networks (ANNs), applicable to dynamical systems arising from Ordinary Differential Equations (ODEs) or time-dependent Partial Differential Equations (PDEs). Unlike ...

Recently the ForkAES construction was proposed by Andreeva et al. for efficiently performing authenticated encryption of very short messages on next generation IoT devices. The ForkAES tweakable block cipher uses around one and a half AES encryption calls ...

Improved Cryptanalysis of Skein

Chat with Graph Search

Side-channel analysis of isogeny-based key encapsulation mechanisms and hash-based digital signatures

PAE: Towards More Efficient and BBB-Secure AE from a Single Public Permutation

Extractable Witness Encryption for the Homogeneous Linear Equations Problem

Nonparametric estimation for SDE with sparsely sampled paths: An FDA perspective

Fast global spectral methods for three-dimensional partial differential equations

Orthros: A Low-Latency PRF

Complete Practical Side-Channel-Assisted Reverse Engineering of AES-Like Ciphers

A Continuized View on Nesterov Acceleration

Analyzing and Protecting Communication Metadata

Atom: A Stream Cipher with Double Key Filter

Towards Efficient LPN-Based Symmetric Encryption

Cryptanalysis of LowMC instances using single plaintext/ciphertext pair

On the stability of blowup solutions for the critical corotational wave-map problem

Dynamical System Modeling of Self-Regulated Systems Undergoing Multiple Excitations: First Order Differential Equation Approach

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

Cryptanalysis of ForkAES

Beyond Conventional Security in Sponge-Based Authenticated Encryption Modes

Calculus of variations: A differential form approach

Machine learning for fast and reliable solution of time-dependent differential equations

Exploring Lightweight Efficiency of Forkaes