Publications related to SHA-3 | EPFL Graph Search

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.

SHA-3

Graph Chatbot

Chat with Graph Search

Security of Full-State Keyed Sponge and Duplex: Applications to Authenticated Encryption

Efficient Recursive Diffusion Layers for Block Ciphers, and Hash Functions

OMD: A Compression Function Mode of Operation for Authenticated Encryption

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}}$)

Breaking `128-bit Secure' Supersingular Binary Curves

Elliptic and Hyperelliptic Curves: A Practical Security Analysis

Secure Computing with the MPEG RVC Framework

Synthetic Linear Analysis with Applications to CubeHash and Rabbit

Design and Analysis of Multi-Block-Length Hash Functions

Unaligned Rebound Attack: Application on Keccak