Statistical and Algebraic Cryptanalysis of Lightweight and Ultra-Lightweight Symmetric Primitives

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.

The Supersingular Isogeny Diffie-Hellman (SIDH) protocol has been the main and most efficient isogeny-based encryption protocol, until a series of breakthroughs led to a polynomial-time key-recovery attack. While some countermeasures have been proposed, th ...

With the pervasive digitalization of modern life, we benefit from efficient access to information and services. Yet, this digitalization poses severe privacy challenges, especially for special-needs individuals. Beyond being a fundamental human right, priv ...

To answer the growing demand for hardware acceleration, Amazon, Microsoft, and many other major cloud service providers have included field-programmable gate arrays (FPGAs) in their datacenters. However, researchers have shown that cloud FPGAs, when shared ...

Many real-world group messaging systems delegate group administration to the application level, failing to provide formal guarantees related to group membership. Taking a cryptographic approach to group administration can prevent both implementation and pr ...

Homomorphic Encryption (HE) enables computations to be executed directly on encrypted data. As such, it is an auspicious solution for protecting the confidentiality of sensitive data without impeding its usability. However, HE does not provide any guarant ...

In the postwar years, petroleum products pervaded more and more aspects of Western European life. In this article, we study the origins of this pervasive petroculture through the lens of the Marshall Plan/European Recovery Program (ERP), its Refinery Expan ...

Electromagnetic forces and torques enable many key technologies, including optical tweezers or dielectrophoresis. Interestingly, both techniques rely on the same physical process: the interaction of an oscillating electric field with a particle of matter. ...

Security system designers favor worst-case security metrics, such as those derived from differential privacy (DP), due to the strong guarantees they provide. On the downside, these guarantees result in a high penalty on the system's performance. In this pa ...

It is well-known that for any integral domain R, the Serre conjecture ring R(X), i.e., the localization of the univariate polynomial ring R[X] at monic polynomials, is a Bezout domain of Krull dimension

Polar environments are among the fastest changing regions on the planet. It is a crucial time to make significant improvements in our understanding of how ocean and ice biogeochemical processes are linked with the atmosphere. This is especially true over A ...

Succinct zero knowledge proofs (i.e. zkSNARKs) are powerful cryptographic tools that enable a prover to convince a verifier that a given statement is true without revealing any additional information. Their attractive privacy properties have led to much ac ...

The landscape of computing is changing, thanks to the advent of modern networking equipment that allows machines to exchange information in as little as one microsecond. Such advancement has enabled microsecond-scale distributed computing, where entire dis ...

We propose a 2-round blind signature protocol based on the random oracle heuristic and the hardness of standard lattice problems (Ring/Module-SIS/LWE and NTRU) with a signature size of 22 KB. The protocol is round-optimal and has a transcript size that can ...

Minimising the longest travel distance for a group of mobile robots with interchangeable goals requires knowledge of the shortest length paths between all robots and goal destinations. Determining the exact length of the shortest paths in an environment wi ...

Statistical and Algebraic Cryptanalysis of Lightweight and Ultra-Lightweight Symmetric Primitives

Chattez avec Graph Search

New SIDH Countermeasures for a More Efficient Key Exchange

Bridging the gap between theoretical and practical privacy technologies for at-risk populations

Temperature Impact on Remote Power Side-Channel Attacks on Shared FPGAs

Cryptographic Administration for Secure Group Messaging

Thwarting Malicious Adversaries in Homomorphic Encryption Pipelines

Creating the conditions for Western European petroculture: The Marshall Plan, the politics of the OEEC, and the transition from coal to oil

Electromagnetic Forces and Torques: From Dielectrophoresis to Optical Tweezers

Bayes Security: A Not So Average Metric

The multivariate Serre conjecture ring

Untangling the influence of Antarctic and Southern Ocean life on clouds

EOS: Efficient Private Delegation of zkSNARK Provers

Reliable Microsecond-Scale Distributed Computing

Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal

Certification of Bottleneck Task Assignment With Shortest Path Criteria