Algebraic cryptography: new constructions and their security against provable break

DOI10.1090/S1061-0022-09-01079-6zbMATH Open1206.94069MaRDI QIDQ3079281FDOQ3079281

Authors:

Publication date: 2 March 2011

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

Recommendations

• Cryptographic algorithms on groups and algebras
• Some cryptoprimitives in noncommutative algebraic cryptography
• Cryptanalysis via algebraic spans
• Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
• Public-key cryptography and invariant theory

zbMATH Keywords

algebraic cryptographycryptographic primitivesprovable break

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Computational aspects of associative rings (general theory) (16Z05)

Cites Work

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

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
• Title not available (Why is that?)
• 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)