Constructions in public-key cryptography over matrix groups

The purpose of the paper is to give new key agreement protocols (a multi-party extension of the protocol due to Anshel-Anshel-Goldfeld and a generalization of the Diffie-Hellman protocol from abelian to solvable groups) anda new homomorphic public-key cryptosystem. They rely on difficulty of the conjugacy and membership problems for subgroups of a given group. To support these and other known cryptographic schemes we present a general technique to produce a family of instances being matrix groups (over finite commutative rings) which play a role for these schemes similar to the groups Z ∗ in the existing cryptographic constructions like RSA or discrete logarithm.

• Publication year

  2005

• Venue

  arXiv.org

• Publication date

  2005-06-10

• Fields of study

  Mathematics, Physics, Computer Science

• Identifiers
  DOI 10.1090/conm/418/07949arXiv math/0506180
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Matrix groups

  2006cited by this paper
• The Conjugacy Search Problem in Public Key Cryptography: Unnecessary and Insufficient

  2004cited by this paper
• Homomorphic public-key cryptosystems over groups and rings

  2003cited by this paper
• Lectures on Finite Fields and Galois Rings

  2003cited by this paper
• Homomorphic Public-Key Cryptosystems and Encrypting Boolean Circuits

  2003influential reference
• Public-key cryptography and invariant theory

  2002cited by this paper
• Computing with matrix groups

  2002cited by this paper
• The computational matrix group project

  2001cited by this paper
• Lecture Notes on Cryptography

  2001influential reference
• Improved Public Key Cryptosystem using Finite non Abelian Groups

  2001cited by this paper
• Open questions

  2001cited by this paper
• New Public-Key Cryptosystem Using Braid Groups

  2000cited by this paper
• Polynomial-time computation in matrix groups

  1999cited by this paper
• An algebraic method for public-key cryptography

  1999influential reference
• A new public key cryptosystem based on higher residues

  1998cited by this paper
• Polynomial time algorithms for modules over finite dimensional algebras

  1997cited by this paper
• Las Vegas algorithms for matrix groups

  1993cited by this paper
• Open Questions, Talk Abstracts, and Summary of Discussions

  1989cited by this paper
• Probabilistic Encryption

  1984cited by this paper
• On the maximal subgroups of the finite classical groups

  1984cited by this paper
• ON DATA BANKS AND PRIVACY HOMOMORPHISMS

  1978cited by this paper
• Finite Rings With Identity

  1974influential reference
• Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations

  1966cited by this paper

• The tropical Version of ElGamal Encryption

  2023cites this paper
• A review of the tropical approach in cryptography

  2022cites this paper
• Building Group Key Establishment on Group Theory: A Modular Approach

  2020cites this paper
• Key agreement based on automaton groups

  2019cites this paper
• Key-agreement based on automaton groups Rostislav Grigorchuk

  2019cites this paper
• An ECC with Probable Secure and Efficient Approach on Noncommutative Cryptography

  2019cites this paper
• Tropical cryptography II: Extensions by homomorphisms

  2018cites this paper
• A Study of Non-Abelian Public Key

  2018cites this paper
• Post-Quantum Cryptography: S381 Cyclic Subgroup of High Order

  2017cites this paper
• An Ordinal-free Proof of the Complete Cut-elimination Theorem for \Pi^1_1-CA+BI with the omega-rule

  2017cites this paper
• Post-Quantum Cryptography(PQC): Generalized ElGamal Cipher over GF(251^8)

  2017cites this paper
• Secure Multiparty Computation without One-way Functions.

  2017cites this paper
• Post-Quantum Cryptography: A Zero-Knowledge Authentication Protocol

  2017cites this paper
• Secure multiparty computation without one-way functions

  2016cites this paper
• Tropical Cryptography

  2013cites this paper
• Secrecy without one-way functions

  2013cites this paper
• Commutative Matrix-based Diffie-Hellman-Like Key-Exchange Protocol

  2013cites this paper
• No-leak authentication by the Sherlock Holmes method

  2012cites this paper
• Development of Matrix Cipher Modifications and Key Exchange Protocol

  2012cites this paper
• MULTIPARTY COMPUTATION AND SECRET SHARING

  2011cites this paper
• Cryptography without one-way functions

  2011cites this paper
• NO-LEAK AUTHENTICATION BY THE SHERLOCK HOLMES METHOD

  2010cites this paper
• Secure Hill cipher modifications and key exchange protocol

  2010cites this paper
• Authentication from Matrix Conjugation

  2010cites this paper
• Algebraic cryptography: New constructions and their security against provable break

  2009influential citation
• A Zero-knowledge Undeniable Signature Scheme in Non-abelian Group Setting

  2008cites this paper
• Ja n 20 06 Undeniable Signature Schemes Using Braid Groups February 1 , 2008

  2008cites this paper
• Invariant-based Cryptosystems and Their Security Against Provable Worst-Case Break ?

  2007influential citation
• Towards Provably Secure Group Key Agreement Building on Group Theory

  2006cites this paper
• Group Signature Schemes Using Braid Groups

  2006cites this paper
• Undeniable Signature Schemes Using Braid Groups

  2006cites this paper
• Another Cryptanalysis of a Tropical Key Exchange Protocol

  year unknowncites this paper
• A Survey of Public-Key Cryptography over Non-Abelian Groups

  year unknowninfluential citation
• EQSIGN: Practical Digital Signatures from the 1 Non-Abelian Hidden Subgroup Problem and 2 Information Theoretic Equivocation

  year unknowncites this paper