Popping "R-propping": breaking hardness assumptions for matrix groups over F_{2^8}

No abstract is available for this paper.

• Publication year

  2023

• Venue

  IACR Cryptology ePrint Archive

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• PQC: R-Propping of a Simple Oblivious Transfer

  2021influential reference
• PQC: R-Propping of a New Group-Based Digital Signature

  2021cited by this paper
• PQC: R-Propping of Burmester-Desmedt Conference Key Distribution System

  2021cited by this paper
• PQC: R-Propping of Public-Key Cryptosystems Using Polynomials over Non-commutative Algebraic Extension Rings

  2020cited by this paper
• R-Propping of HK17: Upgrade for a Detached Proposal of NIST PQC First Round Survey

  2020cited by this paper
• The Simplest Protocol for Oblivious Transfer

  2015cited by this paper
• Breaking '128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in 𝔽24·1223 and 𝔽212·367)

  2014cited by this paper
• Discrete Logarithm in GF(2809) with FFS

  2014cited by this paper
• On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in $\mathbb{F}_{2^{1971}}$ and $\mathbb{F}_{2^{3164}}$

  2013cited by this paper
• Quantum algorithm for the discrete logarithm problem for matrices over finite group rings

  2012cited by this paper
• Non-Commutative Cryptography and Complexity of Group-Theoretic Problems

  2011cited by this paper
• Post-quantum cryptography

  2008cited by this paper
• New Public Key Cryptosystems Using Polynomials over Non-commutative Rings

  2007cited by this paper
• National Institute of Standards and Technologyにおける超伝導研究及び生活

  2001cited by this paper
• Advanced Encryption Standard (AES)

  1999cited by this paper
• The Discrete Logarithm Problem in GL(n, q)

  1997cited by this paper
• Algorithms for quantum computation: discrete logarithms and factoring

  1994cited by this paper
• A public key cryptosystem and a signature scheme based on discrete logarithms

  1984cited by this paper

• No citing papers are available for this paper.