Data structures and network algorithms
Data structures and network algorithms
On the generation of cryptographically strong pseudorandom sequences
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Computer Systems (TOCS)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fundamentals of Computer Alori
Fundamentals of Computer Alori
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
An efficient signature scheme based on quadratic equations
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Average-case completeness of a word problem for groups
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
New Key Agreement Protocols in Braid Group Cryptography
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
New Public-Key Cryptosystem Using Braid Groups
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
A Practical Attack on Some Braid Group Based Cryptographic Primitives
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Provable security for communication on the internet
ICCC '02 Proceedings of the 15th international conference on Computer communication
On the Security of Two Public Key Cryptosystems Using Non-Abelian Groups
Designs, Codes and Cryptography
Attacking a public key cryptosystem based on tree replacement
Discrete Applied Mathematics
One-more matching conjugate problem and security of braid-based signatures
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Security analysis of word problem-based cryptosystems
Designs, Codes and Cryptography
Public key encryption and encryption emulation attacks
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Generalized learning problems and applications to non-commutative cryptography
ProvSec'11 Proceedings of the 5th international conference on Provable security
On the wagner–magyarik cryptosystem
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Completion attacks and weak keys of oleshchuk’s public key cryptosystem
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
A new cramer-shoup like methodology for group based provably secure encryption schemes
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Attacks on public key cryptosystems based on free partially commutative monoids and groups
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
| Hi-index | 0.00 |
The undecidable word problem for groups and semigroups is investigated as a basis for a public-key cryptosystem. A specific approach is discussed along with the results of an experimental implementation This approach does not give a provably secure or practical system, but shows the type of cryptosystem that could be constructed around the word problem. This cryptosystem is randomized, with infinitely many ciphertexts corresponding to each plaintext.