1 citations · 2 across the 3 of their papers we have counts for
6 papers
Algebraic Extension Ring Framework for Non-Commutative Asymmetric Cryptography
Pedro Hecht
Post-Quantum Cryptography PQC attempts to find cryptographic protocols resistant to attacks using Shors polynomial time algorithm for numerical field problems or Grovers algorithm…
PQC: Extended Triple Decomposition Problem (XTDP) Applied To GL(d, Fp)-An Evolved Framework For Canonical Non-Commutative Cryptography
P. Hecht
Post-Quantum Cryptography (PQC) attempts to find cryptographic protocols resistant to attacks using Shor polynomial time algorithm for numerical field problems or Grover search alg…
PQC: Triple Decomposition Problem Applied To GL(d, Fp) - A Secure Framework For Canonical Non-Commutative Cryptography
Pedro Hecht
Post-Quantum Cryptography (PQC) attempts to find cryptographic protocols resistant to attacks using Shor polynomial time algorithm for numerical field problems or Grover search alg…
Post-Quantum Cryptography: S381 Cyclic Subgroup of High Order
Pedro Hecht
Currently there is an active Post-Quantum Cryptography (PQC) solutions search, which attempts to find cryptographic protocols resistant to attacks by means of for instance Shor pol…
Post-Quantum Cryptography: A Zero-Knowledge Authentication Protocol
Pedro Hecht
In this paper, we present a simple bare-bones solution of a Zero-Knowledge authentication protocol which uses non-commutative algebra and a variation of the generalized symmetric d…
Post-Quantum Cryptography(PQC): Generalized ElGamal Cipher over GL(8,F251)
Pedro Hecht
Post-quantum cryptography (PQC) attempts to find cryptographic protocols resistant to attacks using for instance Shor's polynomial time algorithm for numerical field problems like…