Code-Based Cryptography
11th International Workshop, CBCrypto 2023, Lyon, France, April 22–23, 2023, Revised Selected Papers
Page
%P
-
Article
PERK: compact signature scheme based on a new variant of the permuted kernel problem
In this work we introduce PERK a compact digital signature scheme based on the hardness of a new variant of the permuted kernel problem (PKP). PERK achieves the smallest signature sizes for any PKP-based schem...
-
Chapter and Conference Paper
Revisiting Nearest-Neighbor-Based Information Set Decoding
The syndrome decoding problem lies at the heart of code-based cryptographic constructions. Information Set Decoding (ISD) algorithms are commonly used to assess the security of these systems. The most efficien...
-
Chapter and Conference Paper
Asymptotics and Improvements of Sieving for Codes
A recent work of Guo, Johansson, and Nguyen (Eprint’23) proposes a promising adaptation of sieving techniques from lattices to codes, in particular claiming concrete cryptanalytic improvements on various schem...
-
Article
Open AccessTen years after: findings from the medical surveillance program on Health Effects in High-Level Exposure to PCB (HELPcB)
After the detection of high environmental and occupational exposure to polychlorinated biphenyls (PCBs) in a German recycling company for transformers and capacitors in 2010, the multidisciplinary medical surv...
-
Article
Open AccessBlood lead monitoring in a former mining area in Euskirchen, Germany: results of a representative random sample in 3- to 17-year-old children and minors
Heavy metal residues in former mining areas can pose a burden to the local environment and population even decades after closure of the mining sites. In the North Rhine-Westphalian (Germany) communities of Mec...
-
Chapter and Conference Paper
New Time-Memory Trade-Offs for Subset Sum – Improving ISD in Theory and Practice
We propose new time-memory trade-offs for the random subset sum problem defined on \((a_1,\ldots ,a_n,t)\)
-
Book and Conference Proceedings
-
Chapter and Conference Paper
Low Memory Attacks on Small Key CSIDH
Despite recent breakthrough results in attacking SIDH, the CSIDH protocol remains a secure post-quantum key exchange protocol with appealing properties. However, for obtaining efficient CSIDH instantiations on...
-
Chapter and Conference Paper
Memory-Efficient Attacks on Small LWE Keys
The LWE problem is one of the prime candidates for building the most efficient post-quantum secure public key cryptosystems. Many of those schemes, like Kyber, Dilithium or those belonging to the NTRU-family, ...
-
Chapter and Conference Paper
Parallel Isogeny Path Finding with Limited Memory
The security guarantees of most isogeny-based protocols rely on the computational hardness of finding an isogeny between two supersingular isogenous curves defined over a prime field
-
Chapter and Conference Paper
Syndrome Decoding Estimator
The selection of secure parameter sets requires an estimation of the attack cost to break the respective cryptographic scheme instantiated under these parameters. The current NIST standardization process for p...
-
Chapter and Conference Paper
MR-DSS – Smaller MinRank-Based (Ring-)Signatures
In the light of NIST’s announced reopening of the call for digital signature proposals in 2023 due to lacking diversity, there is a strong need for constructions based on other established hardness assumptions...
-
Chapter and Conference Paper
Partial Key Exposure Attacks on BIKE, Rainbow and NTRU
In a so-called partial key exposure attack one obtains some information about the secret key, e.g. via some side-channel leakage. This information might be a fraction of the secret key bits (erasure mo...
-
Chapter and Conference Paper
McEliece Needs a Break – Solving McEliece-1284 and Quasi-Cyclic-2918 with Modern ISD
With the recent shift to post-quantum algorithms it becomes increasingly important to provide precise bit-security estimates for code-based cryptography such as McEliece and quasi-cyclic schemes like BIKE and ...
-
Chapter and Conference Paper
Hybrid Decoding – Classical-Quantum Trade-Offs for Information Set Decoding
The security of code-based constructions is usually assessed by Information Set Decoding (ISD) algorithms. In the quantum setting, amplitude amplification yields an asymptotic square root gain over the classic...
-
Article
Open AccessLongitudinal changes in telomere length in PCB-exposed individuals: interaction with CMV infection
We recently demonstrated a significant shortening of age-adapted telomere length (TL) in lymphocytes of polychlorinated biphenyls (PCB)-exposed individuals. Here, we analyzed TL in individuals of the same PCB-...
-
Chapter and Conference Paper
Low Weight Discrete Logarithm and Subset Sum in \(2^{0.65n}\) with Polynomial Memory
We propose two heuristic polynomial memory collision finding algorithms for the low Hamming weight discrete logarithm problem in any abelian group G. The first one is a direct adaptation of the Becker-Coron-Joux ...
-
Chapter and Conference Paper
Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions
For enabling post-quantum cryptanalytic experiments on a meaningful scale, there is a strong need for low-memory algorithms. We show that the combination of techniques from representations, multiple collision ...
-
Article
Open AccessAssociation of plasma PCB levels and HbA1c concentration in Iran
The rapid increase in prevalence of diabetes mellitus over the last decades warrants more attention to the effects of environmental and occupational exposures on glucose metabolism. Our study aimed to assess t...
-
Chapter and Conference Paper
Dissection-BKW
The slightly subexponential algorithm of Blum, Kalai and Wasserman (BKW) provides a basis for assessing LPN/LWE security. However, its huge memory consumption strongly limits its practical applicability, there...
