DeepAI AI Chat
Log In Sign Up

Post-Quantum Key Agreement Protocol based on Non-Square Integer Matrices

by   Hugo Daniel Scolnik, et al.

We present in this paper an algorithm for exchanging session keys, coupled with a hashing encryption module. We show schemes designed for their potential invulnerability to classical and quantum attacks. In turn, if the parameters included were appropriate, brute-force attacks exceed the (five) security levels used in the NIST competition of new post-quantum standards. The original idea consists of products of rectangular matrices in Zp as public values and whose factorization is proved to be an NP-complete problem. We present running times as a function of the explored parameters and their link with operational safety. To our knowledge there are no classical and quantum attacks of polynomial complexity available at hand, remaining only the systematic exploration of the private-key space.


page 1

page 2

page 3

page 4


A Simple Construction of Quantum Public-Key Encryption from Quantum-Secure One-Way Functions

Quantum public-key encryption [Gottesman; Kawachi et al., Eurocrypt'05] ...

On homomorphic encryption using abelian groups: Classical security analysis

In [15], Leonardi and Ruiz-Lopez propose an additively homomorphic publi...

Smaller public keys for MinRank-based schemes

MinRank is an NP-complete problem in linear algebra whose characteristic...

Forging quantum data: classically defeating an IQP-based quantum test

In 2009, Shepherd and Bremner proposed a "test of quantum capability" ar...

An Efficient Quantum Factoring Algorithm

We show that n-bit integers can be factorized by independently running a...