VSH, an efficient and provable collision-resistant hash function

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.

Non-volatile RAM (NVRAM) makes it possible for data structures to tolerate transient failures, assuming however that programmers have designed these structures such that their consistency is preserved upon recovery. Previous ap- proaches are typically tran ...

The evaluation of small degree polynomials is critical for the computation of elementary functions. It has been extensively studied and is well documented. In this article, we evaluate existing methods for polynomial evaluation on superscalar architecture. ...

This paper addresses the steady-state optimization of continuous processes in the presence of uncertainty in the form of unknown or time-varying model parameters, structural plant-model mismatch, and disturbances. To address these issues, we assume that ce ...

Let F-p be a prime field of order p > 2, and let A be a set in F-p with very small size in terms of p. In this note, we show that the number of distinct cubic distances determined by points in A x A satisfies vertical bar(A - A)(3) + (A - A)(3 vertical bar ...

We explore a few algebraic and geometric structures, through certain questions posed by modern cryptography. We focus on the cases of discrete logarithms in finite fields of small characteristic, the structure of isogeny graphs of ordinary abelian varietie ...

Lyra2REv2 is a hashing algorithm that consists of a chain of individual hashing algorithms and it is used as a proof-of-work function in several cryptocurrencies that aim to be ASIC-resistant. The most crucial hashing algorithm in the Lyra2REv2 chain is a ...

This paper reports on the number field sieve computation of a 768-bit prime field discrete logarithm, describes the different parameter optimizations and resulting algorithmic changes compared to the factorization of a 768-bit RSA modulus, and briefly disc ...

Optimization is a fundamental tool in modern science. Numerous important tasks in biology, economy, physics and computer science can be cast as optimization problems. Consider the example of machine learning: recent advances have shown that even the most s ...

Non-volatile memory (NVM) technologies such as PCM, ReRAM and STT-RAM allow processors to directly write values to persistent storage at speeds that are significantly faster than previous durable media such as hard drives or SSDs. Many applications of NVM ...

Key-Value (K-V) stores are an integral building block in modern datacenter applications. With byteaddressable persistent memory (PM) technologies, such as Intel/Micron's 3D XPoint, on the horizon, there has been an influx of new high performance K-V stores ...

The security of public-key cryptography relies on well-studied hard problems, problems for which we do not have efficient algorithms. Factorization and discrete logarithm are the two most known and used hard problems. Unfortunately, they can be easily solv ...

Authenticated Encryption (AE) is a symmetric key cryptographic primitive that ensures confidentiality and authenticity of processed messages at the same time. The research of AE as a primitive in its own right started in 2000. The security goals of AE wer ...

VSH, an efficient and provable collision-resistant hash function

Chat with Graph Search

Log-Free Concurrent Data Structures

Polynomial Evaluation on Superscalar Architecture, Applied to the Elementary Function e(x)

Log-Free Concurrent Data Structures

110th Anniversary: A Feature-Based Analysis of Static Real-Time Optimization Schemes

Four-Variable Expanders Over The Prime Fields

Arithmetic and geometric structures in cryptography

A Lyra2 FPGA Core for Lyra2REv2-Based Cryptocurrencies

Computation of a 768-Bit Prime Field Discrete Logarithm

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Efficient Logging in Non-Volatile Memory by Exploiting Coherency Protocols

Closing the Performance Gap Between Volatile and Persistent Key-Value Stores Using Cross-Referencing Logs

LPN in Cryptography : an Algorithmic Study

Provably Secure Authenticated Encryption