PQC: Triple Decomposition Problem Applied To GL(d, Fp) - A Secure Framework For Canonical Non-Commutative Cryptography

10/21/2018
by   Pedro Hecht, et al.
0

Post-Quantum Cryptography (PQC) attempts to find cryptographic protocols resistant to attacks using Shor polynomial time algorithm for numerical field problems or Grover search algorithm. A mostly overlooked but valuable line of solutions is provided by non-commutative algebraic structures, specifically canonical protocols that rely on one-way trapdoor functions (OWTF). Here we develop an algebraic framework who could be applied to different asymmetric protocols like D-H KE (Diffie-Hellman key exchange), Public Key Encryption, Digital Signature, ZKP (zero-knowledge proof) authentication, Oblivious Transfer, Multi-Party Computing, and so on. The trapdoor one-way functions selected are (a) Triple decomposition Problem (TDP) developed by Kurt, where a known element is factored into a product of three unknown factors and (b) a new version of conjugacy search that we refer from now on as Blind Conjugacy Search Problem (BCSP). Our platform structure is the general linear group GL(d,F_p) d-square non-singular matrices of prime field values. We give support to the fact that this framework is cryptographically secure against classical attacks like linear algebra attacks, length-based attacks, side-channel attacks against square (or duplicate) and multiply (or sum) algorithm, high sensitivity to pseudo random deterministic generators, etc. At same time it is immune against quantum attacks (using Grover and Shor), if the size parameters are carefully selected. Semantic security and IND-CCA2 compliance for this framework is discussed.

READ FULL TEXT
research
11/20/2018

PQC: Extended Triple Decomposition Problem (XTDP) Applied To GL(d, Fp)-An Evolved Framework For Canonical Non-Commutative Cryptography

Post-Quantum Cryptography (PQC) attempts to find cryptographic protocols...
research
02/19/2020

Algebraic Extension Ring Framework for Non-Commutative Asymmetric Cryptography

Post-Quantum Cryptography PQC attempts to find cryptographic protocols r...
research
02/06/2022

Post Quantum Cryptography: Techniques, Challenges, Standardization, and Directions for Future Research

The development of large quantum computers will have dire consequences f...
research
02/05/2022

A proof of P != NP (New symmetric encryption algorithm against any linear attacks and differential attacks)

P vs NP problem is the most important unresolved problem in the field of...
research
11/12/2022

Distributed and secure linear algebra – Master Thesis

Cryptography is the discipline that allows securing of the exchange of i...
research
07/22/2022

Cryptanalysis of a System based on Twisted Dihedral Group Algebras

Several cryptographic protocols constructed based on less-known algorith...
research
01/04/2023

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

We present in this paper an algorithm for exchanging session keys, coupl...

Please sign up or login with your details

Forgot password? Click here to reset