Cryptanalysis of a combinatorial public key cryptosystem
From MaRDI portal
Publication:1676249
Recommendations
Cites work
- scientific article; zbMATH DE number 3137403 (Why is no real title available?)
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 53528 (Why is no real title available?)
- scientific article; zbMATH DE number 3563392 (Why is no real title available?)
- scientific article; zbMATH DE number 534859 (Why is no real title available?)
- scientific article; zbMATH DE number 682387 (Why is no real title available?)
- scientific article; zbMATH DE number 1759777 (Why is no real title available?)
- scientific article; zbMATH DE number 2107935 (Why is no real title available?)
- scientific article; zbMATH DE number 7310214 (Why is no real title available?)
- scientific article; zbMATH DE number 3335108 (Why is no real title available?)
- A family of polycyclic groups over which the uniform conjugacy problem is NP-complete.
- A linear decomposition attack
- A nonlinear decomposition attack
- A public key cryptosystem and a signature scheme based on discrete logarithms
- An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
- Automorphisms of groups
- Combinatorial group theory.
- Cryptographic protocols based on inner product spaces and group theory with a special focus on the use of Nielsen transformations
- Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
- Infinite groups
- Linear decomposition method in analyzing hidden information protocols on algebraic platforms
- New directions in cryptography
- Non-commutative lattice problems
- Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
- Polynomial-time word problems.
- The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups
- The algorithmic theory of polycyclic-by-finite groups
- The status of polycyclic group-based cryptography: a survey and open problems
- Topics in infinite group theory. Nielsen methods, covering spaces, and hyperbolic groups
Cited in
(20)- Completion Attacks and Weak Keys of Oleshchuk’s Public Key Cryptosystem
- scientific article; zbMATH DE number 6129866 (Why is no real title available?)
- Cryptanalysis of Rational Multivariate Public Key Cryptosystems
- Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem
- Algebraic and quantum attacks on two digital signature schemes
- A PUBLIC KEY CRYPTOSYSTEM BASED ON COMPLEMENTING SETS
- scientific article; zbMATH DE number 4195883 (Why is no real title available?)
- scientific article; zbMATH DE number 5973815 (Why is no real title available?)
- Progress in Cryptology - INDOCRYPT 2004
- Implicit Polynomial Recovery and Cryptanalysis of a Combinatorial Key Cryptosystem
- Cryptanalysis of a computer cryptography scheme based on a filter bank
- Analysis of secret sharing schemes based on Nielsen transformations
- A Bird’s-Eye View of Modern Symmetric Cryptography from Combinatorial Designs
- Two general schemes of algebraic cryptography
- Cryptanalysis of the permutation based algorithm SpoC
- Cryptanalysis on a finite automaton public key cryptosystem
- scientific article; zbMATH DE number 5204734 (Why is no real title available?)
- Cryptanalysis of General Lu-Lee Type Systems
- Cryptanalysis of a public key cryptosystem based on boolean permutations
- Cryptanalysis of McEliece’s Public-Key Cryptosystem
This page was built for publication: Cryptanalysis of a combinatorial public key cryptosystem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1676249)
