Concept

Hash function

Related publications (97)

Graph Chatbot

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.

A Structure Theorem for Level Sets of Multiplicative Functions and Applications

Florian Karl Richter

Given a level set E of an arbitrary multiplicative function f, we establish, by building on the fundamental work of Frantzikinakis and Host [14, 15], a structure theorem that gives a decomposition of

1_{E}

into an almost periodic and a pseudo-random part ...

2020

Hash function

Graph Chatbot

Chat with Graph Search

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

Indexing Protected Deep Face Templates by Frequent Binary Patterns

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony!

A Deeper Look at the Energy Consumption of Lightweight Block Ciphers

Robustness via Cross-Domain Ensembles

A Standalone FPGA-Based Miner for Lyra2REv2 Cryptocurrencies

A Structure Theorem for Level Sets of Multiplicative Functions and Applications

Time in cryptography

Tweaking Key-Alternating Feistel Block Ciphers

Axon morphology is modulated by the local environment and impacts the noninvasive investigation of its structure-function relationship

A Structure Theorem for Level Sets of Multiplicative Functions and Applications

Robustness via Cross-Domain Ensembles

A Standalone FPGA-Based Miner for Lyra2REv2 Cryptocurrencies

Time in cryptography

Tweaking Key-Alternating Feistel Block Ciphers

Axon morphology is modulated by the local environment and impacts the noninvasive investigation of its structure-function relationship

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

Indexing Protected Deep Face Templates by Frequent Binary Patterns

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony!

A Deeper Look at the Energy Consumption of Lightweight Block Ciphers