Publications related to Primeless Factoring-Based Cryptography

Secret Key Generation Using Short Blocklength Polar Coding Over Wireless Channels

This paper investigates the problem of secret key generation from correlated Gaussian random variables in the short blocklength regime. Short blocklengths are commonly employed in massively connected IoT sensor networks in 5G and beyond wireless systems. P ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Complete Practical Side-Channel-Assisted Reverse Engineering of AES-Like Ciphers

Andrea Felice Caforio, Subhadeep Banik, Muhammed Fatih Balli

Public knowledge about the structure of a cryptographic system is a standard assumption in the literature and algorithms are expected to guarantee security in a setting where only the encryption key is kept secret. Nevertheless, undisclosed proprietary cry ...

2021

A new elementary proof of the Prime Number Theorem

Florian Karl Richter

Let

\Omega(n)

denote the number of prime factors of

n

. We show that for any bounded

f\colon\mathbb{N}\to\mathbb{C}

one has [ \frac{1}{N}\sum_{n=1}^N, f(\Omega(n)+1)=\frac{1}{N}\sum_{n=1}^N, f(\Omega(n))+\mathrm{o}_{N\to\infty}(1). ] This yields a ...

2021

On Polar Coding For Finite Blocklength Secret Key Generation Over Wireless Channels

Yanina Yurina Shkel

We consider the problem of secret key generation from correlated Gaussian random variables in the finite blocklength regime. Such keys could be used to encrypt communication in IoT networks, and have provable secrecy guarantees in contrast to classic crypt ...

IEEE2020

Classical Misuse Attacks on NIST Round 2 PQC: The Power of Rank-Based Schemes

Serge Vaudenay, Loïs Evan Huguenin-Dumittan

The US National Institute of Standards and Technology (NIST) recently announced the public-key cryptosystems (PKC) that have passed to the second round of the post-quantum standardization process. Most of these PKC come in two flavours: a weak IND-CPA vers ...

Springer, Cham2020

Bidirectional Asynchronous Ratcheted Key Agreement with Linear Complexity

Serge Vaudenay, Fatma Betül Durak

Following up mass surveillance and privacy issues, modern secure communication protocols now seek more security such as forward secrecy and post-compromise security. They cannot rely on an assumption such as synchronization, predictable sender/receiver rol ...

Springer2019

Methods and systems for secure data exchange

Bryan Alexander Ford, Linus Gasser, Eleftherios Kokoris Kogias

The present invention concerns a computer-implemented method for secure data exchange between a sender (A) and a recipient (B), wherein the method is performed by the sender (A) and comprises encrypting data using a symmetric key k, creating a write transa ...

2019

A spectral refinement of the Bergelson–Host–Kra decomposition and new multiple ergodic theorems

Florian Karl Richter

We investigate how spectral properties of a measure-preserving system (X, B, mu, T) are reflected in the multiple ergodic averages arising from that system. For certain sequences a :N -> N, we provide natural conditions on the spectrum sigma (T) such that, ...

2019

Implications of Position in Cryptography

Handan Kilinç Alper

In our daily lives, people or devices frequently need to learn their location for many reasons as some services depend on the absolute location or the proximity. The outcomes of positioning systems can have critical effects e.g., on military, emergency. Th ...

EPFL2018

Security of Distance-Bounding: A Survey

Serge Vaudenay, Gildas Avoine, Martin Benjamin, Srdan Capkun, Aslan Tchamkerten

Distance-bounding protocols allow a verifier to both authenticate a prover and evaluate whether the latter is located in his vicinity. These protocols are of particular interest in contactless systems, e.g. electronic payment or access control systems, whi ...

2018

Primeless Factoring-Based Cryptography

Graph Chatbot

Chat with Graph Search

Secret Key Generation Using Short Blocklength Polar Coding Over Wireless Channels

Complete Practical Side-Channel-Assisted Reverse Engineering of AES-Like Ciphers

A new elementary proof of the Prime Number Theorem

On Polar Coding For Finite Blocklength Secret Key Generation Over Wireless Channels

Classical Misuse Attacks on NIST Round 2 PQC: The Power of Rank-Based Schemes

Bidirectional Asynchronous Ratcheted Key Agreement with Linear Complexity

Methods and systems for secure data exchange

A spectral refinement of the Bergelson–Host–Kra decomposition and new multiple ergodic theorems

Implications of Position in Cryptography

Security of Distance-Bounding: A Survey

Secret Key Generation Using Short Blocklength Polar Coding Over Wireless Channels

Complete Practical Side-Channel-Assisted Reverse Engineering of AES-Like Ciphers

A new elementary proof of the Prime Number Theorem

Methods and systems for secure data exchange

Security of Distance-Bounding: A Survey

Implications of Position in Cryptography

A spectral refinement of the Bergelson–Host–Kra decomposition and new multiple ergodic theorems

Bidirectional Asynchronous Ratcheted Key Agreement with Linear Complexity

Classical Misuse Attacks on NIST Round 2 PQC: The Power of Rank-Based Schemes

On Polar Coding For Finite Blocklength Secret Key Generation Over Wireless Channels