Concept

Arrondi (mathématiques)

Publications associées (54)

A mixed precision LOBPCG algorithm

The locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm is a popular approach for computing a few smallest eigenvalues and the corresponding eigenvectors of a large Hermitian positive definite matrix A. In this work, we propose a mix ...

SPRINGER2023

Isolated ballistic non-abelian interface channel

Mitali Banerjee

The topological order of a quantum Hall state is mirrored by the gapless edge modes owing to bulk-edge correspondence. The state at the filling of ν = 5/2, predicted to host non-abelian anyons, supports a variety of edge modes (integer, fractional, neutral ...

2022

Orthros: A Low-Latency PRF

Subhadeep Banik

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

2021

The Area-Latency Symbiosis: Towards Improved Serial Encryption Circuits

Andrea Felice Caforio, Subhadeep Banik, Muhammed Fatih Balli

The bit-sliding paper of Jean et al. (CHES 2017) showed that the smallest-size circuit for SPN based block ciphers such as AES, SKINNY and PRESENT can be achieved via bit-serial implementations. Their technique decreases the bit size of the datapath and na ...

2020

Tweaking Key-Alternating Feistel Block Ciphers

Lei Wang, Hailun Yan

Tweakable block cipher as a cryptographic primitive has found wide applications in disk encryption, authenticated encryption mode and message authentication code, etc. One popular approach of designing tweakable block ciphers is to tweak the generic constr ...

Springer, Cham2020

A multiphase CMAQ version 5.0 adjoint

Athanasios Nenes

We present the development of a multiphase adjoint for the Community Multiscale Air Quality (CMAQ) model, a widely used chemical transport model. The adjoint model provides location- and time-specific gradients that can be used in various applications such ...

2020

Numerical Modelling of Two-Phase Flow with Moving Boundary Fitted Meshes

Erik Gros

In this thesis, a computational approach is used to study two-phase flow including phase change by direct numerical simulation. This approach follows the interface with an adaptive moving mesh. The incompressible Navier-Stokes equations are solved, in tw ...

EPFL2018

Interface-fitted moving mesh method for axisymmetric two-phase flow in microchannels

John Richard Thome, Gustavo Rabello Dos Anjos, Erik Gros

A boundary-fitted moving mesh scheme is presented for the simulation of two-phase flow in two-dimensional and axisymmetric geometries. The incompressible Navier-Stokes equations are solved using the finite element method, and the mini element is used to sa ...

Wiley2018

Lonely Runner Polyhedra

Matthias Schymura

We study the Lonely Runner Conjecture, conceived by Jörg M. Wills in the 1960's: Given positive integers n_1, n_2, ... , n_k, there exists a positive real number t such that for all 1 \le j \le k the distance of t n_j to the nearest integer is at least 1 / ...

2018

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Serge Vaudenay, Fatma Betül Durak

Feistel Networks (FN) are now being used massively to encrypt credit card numbers through format-preserving encryption. In our work, we focus on FN with two branches, entirely unknown round functions, modular additions (or other group operations), and when ...

2018

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