Algebraic cryptography: new constructions and their security against provable break
From MaRDI portal
Publication:3079281
Recommendations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1617914 (Why is no real title available?)
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- scientific article; zbMATH DE number 45380 (Why is no real title available?)
- scientific article; zbMATH DE number 49752 (Why is no real title available?)
- scientific article; zbMATH DE number 1303131 (Why is no real title available?)
- scientific article; zbMATH DE number 1303132 (Why is no real title available?)
- scientific article; zbMATH DE number 1349933 (Why is no real title available?)
- scientific article; zbMATH DE number 475362 (Why is no real title available?)
- scientific article; zbMATH DE number 691465 (Why is no real title available?)
- scientific article; zbMATH DE number 1024027 (Why is no real title available?)
- scientific article; zbMATH DE number 1936525 (Why is no real title available?)
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- scientific article; zbMATH DE number 1361466 (Why is no real title available?)
- scientific article; zbMATH DE number 2114384 (Why is no real title available?)
- scientific article; zbMATH DE number 770727 (Why is no real title available?)
- scientific article; zbMATH DE number 2196515 (Why is no real title available?)
- A Boolean function requiring 3n network size
- A Complete Public-Key Cryptosystem
- A Feebly Secure Trapdoor Function
- A method for obtaining digital signatures and public-key cryptosystems
- Algebraic cryptography: new constructions and their security against provable break
- An algebraic method for public-key cryptography
- Breaking RSA may be as difficult as factoring
- Breaking RSA may not be equivalent to factoring
- Computational Complexity
- Constructions in public-key cryptography over matrix groups
- Cryptocomplexity and NP-completeness
- Elliptic Curve Cryptosystems
- Group-based cryptography
- Homomorphic public-key cryptosystems and encrypting Boolean circuits
- Introduction to Quantum Computation and Information
- Lattice-Based Cryptography
- Matrix Transformation Is Complete for the Average Case
- New combinatorial complete one-way functions
- New directions in cryptography
- Non-Abelian key agreement protocols
- On Robust Combiners for Oblivious Transfer and Other Primitives
- On Worst‐Case to Average‐Case Reductions for NP Problems
- On lattices, learning with errors, random linear codes, and cryptography
- On non-Abelian homomorphic public-key cryptosystems
- One way functions and pseudorandom generators
- Polly Two: a new algebraic polynomial-based public-key scheme
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Probabilistic encryption
- Public-key cryptography and invariant theory
- Quantum information theory
- Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.
- The tale of one-way functions
Cited in
(7)- Some new platforms for algebraic cryptography and one method of increasing the security
- Some cryptoprimitives in noncommutative algebraic cryptography
- Algebraic cryptography: new constructions and their security against provable break
- Minimal degrees of invariants of (super)groups – a connection to cryptology
- Cryptanalysis via algebraic spans
- scientific article; zbMATH DE number 3161573 (Why is no real title available?)
- Public-key cryptosystem based on invariants of diagonalizable groups
This page was built for publication: Algebraic cryptography: new constructions and their security against provable break
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3079281)