The following pages link to Alexander Ushakov (Q260111):
Displaying 44 items.
- Quadratic equations in the Grigorchuk group. (Q260112) (← links)
- Authenticated commutator key agreement protocol (Q338834) (← links)
- Algorithmic theory of free solvable groups: randomized computations. (Q402669) (← links)
- The word problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable. (Q408527) (← links)
- The conjugacy problem in the Grigorchuk group is polynomial time decidable. (Q531917) (← links)
- Generic case completeness (Q736607) (← links)
- Analysis of a certain polycyclic-group-based cryptosystem (Q745107) (← links)
- Group-based cryptography (Q925085) (← links)
- Analysis of secret sharing schemes based on Nielsen transformations (Q1647857) (← links)
- Analysis of a key exchange protocol based on tropical matrix algebra (Q1787191) (← links)
- Orientable quadratic equations in free metabelian groups (Q2029200) (← links)
- Attack on Kayawood protocol: uncloaking private keys (Q2033519) (← links)
- Cryptanalysis of matrix conjugation schemes (Q2247963) (← links)
- Quantum algorithm for discrete logarithm problem for matrices over finite group rings (Q2249565) (← links)
- Conjugacy search problem and the Andrews-Curtis conjecture (Q2305693) (← links)
- An attack on the Walnut digital signature algorithm (Q2324764) (← links)
- The conjugacy search problem in public key cryptography: unnecessary and insufficient (Q2432565) (← links)
- Algebraic and quantum attacks on two digital signature schemes (Q2689205) (← links)
- Spherical quadratic equations in free metabelian groups (Q2790248) (← links)
- Strong law of large numbers on graphs and groups (Q2882826) (← links)
- Random van Kampen diagrams and algorithmic problems in groups (Q2882828) (← links)
- Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P (Q2904763) (← links)
- Mean-set attack: cryptanalysis of Sibert et al. authentication protocol (Q3056340) (← links)
- (Q3101433) (← links)
- (Q3442582) (← links)
- Random subgroups and analysis of the length-based and quotient attacks (Q3516765) (← links)
- Cryptanalysis of the shifted conjugacy authentication protocol (Q3537518) (← links)
- (Q3545328) (← links)
- Thompson’s Group and Public Key Cryptography (Q3593139) (← links)
- Cryptanalysis of the Anshel-Anshel-Goldfeld-Lemieux Key Agreement Protocol (Q3617417) (← links)
- POWER CIRCUITS, EXPONENTIAL ALGEBRA, AND TIME COMPLEXITY (Q4649509) (← links)
- EFFICIENT ALGORITHMS FOR HIGHLY COMPRESSED DATA: THE WORD PROBLEM IN HIGMAN'S GROUP IS IN P (Q4904514) (← links)
- The word and geodesic problems in free solvable groups (Q4930015) (← links)
- A Practical Attack on a Certain Braid Group Based Shifted Conjugacy Authentication Protocol (Q5189808) (← links)
- Search problems in groups and branching processes (Q5252307) (← links)
- Magnus embedding and algorithmic properties of groups 𝐹/𝑁^{(𝑑)} (Q5267968) (← links)
- A Practical Attack on a Braid Group Based Cryptographic Protocol (Q5451020) (← links)
- Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol (Q5756527) (← links)
- Public Key Cryptography - PKC 2006 (Q5898951) (← links)
- Conjugacy search problem and the Andrews-Curtis conjecture (Q6277095) (← links)
- Random presentations and random subgroups: a survey (Q6282885) (← links)
- Orientable quadratic equations in free metabelian groups (Q6300433) (← links)
- On subset sum problem in branch groups (Q6342194) (← links)
- Complexity of Spherical Equations in Finite Groups (Q6448525) (← links)