Algebraic cryptography: new constructions and their security against provable break

DOI10.1090/S1061-0022-09-01079-6zbMath1206.94069MaRDI QIDQ3079281

No author found.

Publication date: 2 March 2011

Published in: St. Petersburg Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

cryptographic primitives; algebraic cryptography; provable break

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

16Z05: Computational aspects of associative rings (general theory)

Related Items

Minimal degrees of invariants of (super)groups – a connection to cryptology, Public-key cryptosystem based on invariants of diagonalizable groups, Algebraic cryptography: new constructions and their security against provable break

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Breaking RSA may be as difficult as factoring
• A Boolean function requiring 3n network size
• Group-based cryptography
• Probabilistic encryption
• One way functions and pseudorandom generators
• Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.
• Non-Abelian key agreement protocols
• An algebraic method for public-key cryptography
• Polly Two: a new algebraic polynomial-based public-key scheme
• Homomorphic public-key cryptosystems and encrypting Boolean circuits
• The tale of one-way functions
• Public-key cryptography and invariant theory
• On non-Abelian homomorphic public-key cryptosystems
• Algebraic cryptography: new constructions and their security against provable break
• A Feebly Secure Trapdoor Function
• A Complete Public-Key Cryptosystem
• Elliptic Curve Cryptosystems
• New directions in cryptography
• Cryptocomplexity and NP-completeness
• A method for obtaining digital signatures and public-key cryptosystems
• Breaking RSA may not be equivalent to factoring
• Matrix Transformation Is Complete for the Average Case
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Introduction to Quantum Computation and Information
• Quantum information theory
• Computational Complexity
• On Robust Combiners for Oblivious Transfer and Other Primitives
• Lattice-Based Cryptography
• On Worst‐Case to Average‐Case Reductions for NP Problems
• On lattices, learning with errors, random linear codes, and cryptography