Concept

Key schedule

Publications associées (36)

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

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

Springer2023

Sensing soft robot shape using imus: An experimental investigation

Josephine Anna Eleanor Hughes, Francesco Stella

Shape estimation of soft robotic systems is challenging due to the range of deformations that can be achieved, and the limited availability of physically compatible sensors. We propose a method of reconstruction using Inertial Measurement Units (IMUs), whi ...

Springer Verlag2021

Utilization of research knowledge in sustainable development pathways: Insights from a transdisciplinary research-for-development programme

Thomas Guillaume, Jessie Madrazo Bacallao

This study contributes to the ongoing discussion on how to attribute and evaluate the contribution of transdisciplinary research to sustainable development. As co-created knowledge is a key product of transdisciplinary research, we tested the hypothesis th ...

ELSEVIER SCI LTD2020

Exploring Lightweight Efficiency of Forkaes

Subhadeep Banik, Muhammed Fatih Balli

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

Springer2019

Bottom-up method for potential estimation of energy saving measures

François Maréchal, Ivan Daniel Kantor, Anna Sophia Wallerand

Technology and energy saving potentials in the industrial sector are key data that policy-makers rely on to drive decision-making. A literature review reveals a distinct discrepancy between general potential estimation and detailed design studies. The form ...

Elsevier2019

An FPGA-Based 4 Mbps Secret Key Distillation Engine for Quantum Key Distribution Systems

Andreas Peter Burg, Jeremy Hugues-Felix Constantin, Nicholas Alexander Preyss, Pascal Junod

Quantum key distribution (QKD) enables provably secure communication between two parties over an optical fiber that arguably withstands any form of attack. Besides the need for a suitable physical signalling scheme and the corresponding devices, QKD also r ...

Springer2017

An FPGA-Based 4 Mbps Secret Key Distillation Engine for Quantum Key Distribution Systems

Andreas Peter Burg, Jeremy Hugues-Felix Constantin, Nicholas Alexander Preyss, Pascal Junod

Quantum key distribution (QKD) enables provably secure communication between two parties over an optical ber that arguably withstands any form of attack. Besides the need for a suitable physical signalling scheme and the corresponding devices, QKD also req ...

Springer Verlag2015

On the Key Schedule of Lightweight Block Ciphers

Serge Vaudenay, Jialin Huang

Key schedules in lightweight block ciphers are often highly simplified, which causes weakness that can be exploited in many attacks. Today it remains an open problem on how to use limited operations to guarantee enough diffusion of key bits in lightweight ...

Springer-Verlag Berlin2014

Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits

Sebastian Faust

Non-malleable codes, defined by Dziembowski, Pietrzak and Wichs (ICS ’10), provide roughly the following guarantee: if a codeword c encoding some message x is tampered to c' = f(c) such that c c, then the tampered message x contained in c reveals no inf ...

Springer2014

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

Sebastian Faust

Related key attacks (RKAs) are powerful cryptanalytic attacks where an adversary can change the secret key and observe the effect of such changes at the output. The state of the art in RKA security protects against an a-priori unbounded number of certain a ...

2013

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