Using Decision Problems in Public Key Cryptography
From MaRDI portal
Publication:3617415
DOI10.1515/GCC.2009.33zbMath1156.94379arXivmath/0703656MaRDI QIDQ3617415
Gabriel Zapata, Vladimir Shpilrain
Publication date: 23 March 2009
Published in: Groups – Complexity – Cryptology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0703656
94A60: Cryptography
Related Items
Unnamed Item, Unnamed Item, A unique key sharing protocol among three users using non-commutative group for electronic health record system, Properties of certain semigroups and their potential as platforms for cryptosystems, Linear decomposition method in analyzing hidden information protocols on algebraic platforms, Evolution of group-theoretic cryptology attacks using hyper-heuristics
Uses Software
Cites Work
- Cogrowth of groups and simple random walks
- Probabilistic encryption
- On the multiplicator of \(F/\gamma_cR\)
- Generic-case complexity, decision problems in group theory, and random walks.
- Homomorphic public-key cryptosystems and encrypting Boolean circuits
- Combinatorial group theory and public key cryptography
- ALGORITHMIC PROBLEMS IN VARIETIES