Publications related to Breaking the FF3 Format Preserving Encryption

Related publications (27)

Secure and Efficient Cryptographic Algorithms in a Quantum World

Since the advent of internet and mass communication, two public-key cryptographic algorithms have shared the monopoly of data encryption and authentication: Diffie-Hellman and RSA. However, in the last few years, progress made in quantum physics -- and mo ...

EPFL2024

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Paul Scharnhorst

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

EPFL2024

Inhalation of Microplastics—A Toxicological Complexity

Florian Frédéric Vincent Breider

Humans are chronically exposed to airborne microplastics (MPs) by inhalation. Various types of polymer particles have been detected in lung samples, which could pose a threat to human health. Inhalation toxicological studies are crucial for assessing the e ...

2024

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

Ritam Bhaumik

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

BBB security for 5-round even-Mansour-based key-alternating Feistel ciphers

Ritam Bhaumik

In this paper, we study the security of the Key-Alternating Feistel (KAF) ciphers, a class of key alternating ciphers with the Feistel structure, where each round of the cipher is instantiated with n-bit public round permutation Pi\documentclass[12pt]{mini ...

SPRINGER2023

Revisiting the Indifferentiability of the Sum of Permutations

Ritam Bhaumik

The sum of two n-bit pseudorandom permutations is known to behave like a pseudorandom function with n bits of security. A recent line of research has investigated the security of two public n-bit permutations and its degree of indifferentiability. Mandal e ...

Springer2023

Why computational complexity may set impenetrable barriers for epistemic reductionism

Michael Herzog, Adrien Christophe Doerig, Christian Sachse

According to physicalism, everything is physical or metaphysically connected to the physical. If physicalism were true, it seems that we should - in principle - be able to reduce the descriptions and explanations of special sciences to physical ones, for e ...

Springer2023

Homothetic Tube Model Predictive Control With Multi-Step Predictors

Giancarlo Ferrari Trecate, Melanie Nicole Zeilinger, Danilo Saccani

We present a robust model predictive control (MPC) framework for linear systems facing bounded parametric uncertainty and bounded disturbances. Our approach deviates from standard MPC formulations by integrating multi-step predictors, which provide reduced ...

Ieee-Inst Electrical Electronics Engineers Inc2023

Cost-effective equalization of electro-optic frequency combs in a Sagnac interferometer

Camille Sophie Brès, Jianqi Hu, Ivan Cardea

We present a cost-effective electro-optic frequency comb generation and equalization method using a single phase modulator inserted in a Sagnac interferometer layout. The equalization relies on the interference of comb lines generated in both clockwise and ...

Optica Publishing Group2023

Near Collision Attack Against Grain V1

Subhadeep Banik, Daniel Patrick Collins

A near collision attack against the Grain v1 stream cipher was proposed by Zhang et al. in Eurocrypt 18. The attack uses the fact that two internal states of the stream cipher with very low hamming distance between them, produce similar keystream sequences ...

2023

Hypergraph-Based Fast Distributed AC Power Flow Optimization

Colin Neil Jones, Yuning Jiang, Yingzhao Lian

This paper presents a novel distributed approach for solving AC power flow (PF) problems. The optimization problem is reformulated into a distributed form using a communication structure corresponding to a hypergraph, by which complex relationships between ...

IEEE2023

TiC-SAT: Tightly-coupled Systolic Accelerator for Transformers

David Atienza Alonso, Giovanni Ansaloni, Alireza Amirshahi, Joshua Alexander Harrison Klein

Transformer models have achieved impressive results in various AI scenarios, ranging from vision to natural language processing. However, their computational complexity and their vast number of parameters hinder their implementations on resource-constraine ...

2023

Discrete Optimal Transport with Independent Marginals is #P-Hard

Daniel Kuhn, Soroosh Shafieezadeh Abadeh, Bahar Taskesen

We study the computational complexity of the optimal transport problem that evaluates the Wasser- stein distance between the distributions of two K-dimensional discrete random vectors. The best known algorithms for this problem run in polynomial time in th ...

SIAM Publications2023

cRacklet: a spectral boundary integral method library for interfacial rupture simulation

Jean-François Molinari, Fabian Barras, Thibault Didier Roch

The study of dynamically propagating rupture along interfaces is of prime importance in various fields and system sizes, including tribology (nm to m), engineering (mm to m) and geophysics (m to km) (Armstrong-Hélouvry et al., 1994; Ben-Zion, 2008; Vanossi ...

2022

Minimum Cost Intervention Design for Causal Effect Identification

Negar Kiyavash, Seyed Jalal Etesami, Sina Akbari

Pearl's do calculus is a complete axiomatic approach to learn the identifiable causal effects from observational data. When such an effect is not identifiable, it is necessary to perform a collection of often costly interventions in the system to learn the ...

PMLR2022

ExG Signal Feature Selection Using Hyperdimensional Computing Encoding

David Atienza Alonso, Tomas Teijeiro Campo, Una Pale

Wearable IoT devices and novel continuous monitoring algorithms are essential components of the healthcare transition from reactive interventions focused on symptom treatment to more proactive prevention, from one-size-fits-all to personalized medicine, an ...

IEEE2022

Proofs, Circuits, and Communication

Mika Tapani Göös

We survey lower-bound results in complexity theory that have been obtained via newfound interconnections between propositional proof complexity, boolean circuit complexity, and query/communication complexity. We advocate for the theory of total search prob ...

2022

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier

Alessandro Chiesa

Interactive oracle proofs (IOPs) are a multi-round generalization of probabilistically checkable proofs that play a fundamental role in the construction of efficient cryptographic proofs. ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

Computation Complexity Reduction Technique for Accurate Seizure Detection Implants

Alexandre Schmid, Keyvan Farhang Razi

An automatic seizure detection method from high-resolution intracranial-EEG (iEEG) signals is presented to minimize the computational complexity and realize real-time accurate seizure detection for biomedical implants. Complex signal processing on a large ...

IEEE2022

A Downscaling Intercomparison Study: The Representation of Slope- and Ridge-Scale Processes in Models of Different Complexity

Varun Sharma, Franziska Gerber, Albertus Christiaan Kruyt, Dylan Stewart Reynolds

Spatially distributed meteorological information at the slope scale is relevant for many processes in complex terrain, yet information at this sub-km spatial resolution is difficult to obtain. While downscaling to kilometer resolutions is well described in ...

FRONTIERS MEDIA SA2022