Result 1 to 20 of 45 total
Generalized learning problems and applications to non-commutative cryptography. (Extended abstract). (English)
Boyen, Xavier (ed.) et al., Provable security. 5th international conference, ProvSec 2011, Xi’an, China, October 16‒18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24315-8/pbk). Lecture Notes in Computer Science 6980, 324-339 (2011).
1
Generalized learning problems and applications to non-commutative cryptography (English)
IACR Cryptology ePrint Archive 2011, 357 (2011).
2
Generalized learning problems and applications to non-commutative cryptography - (Extended abstract) (English)
ProvSec, 324-339 (2011).
3
Challenge response password security using combinatorial group theory. (English)
Groups Complex. Cryptol. 2, No. 1, 67-81 (2010).
4
Reflections on some groups of B. H. Neumann. (English)
J. Group Theory 12, No. 5, 771-781 (2009).
5
Some cryptoprimitives in noncommutative algebraic cryptography. (English)
Fine, Benjamin (ed.) et al., Aspects of infinite groups. A Festschrift in honor of Anthony Gaglione. Papers of the conference, Fairfield, USA, March 2007 in honour of Anthony Gaglione’s 60th birthday. Hackensack, NJ: World Scientific (ISBN 978-981-279-340-9/hbk). Algebra and Discrete Mathematics (Hackensack) 1, 26-44 (2008).
6
Virtually free-by-cyclic one-relator groups. I. (English)
Fine, Benjamin (ed.) et al., Aspects of infinite groups. A Festschrift in honor of Anthony Gaglione. Papers of the conference, Fairfield, USA, March 2007 in honour of Anthony Gaglione’s 60th birthday. Hackensack, NJ: World Scientific (ISBN 978-981-279-340-9/hbk). Algebra and Discrete Mathematics (Hackensack) 1, 9-25 (2008).
7
Recognizing powers in nilpotent groups and nilpotent images of free groups. (English)
J. Aust. Math. Soc. 83, No. 2, 149-155 (2007).
8
Reflections on the residual finiteness of one-relator groups. (English)
Groups Geom. Dyn. 1, No. 3, 209-219 (2007).
9
The isomorphism problem for residually torsion-free nilpotent groups. (English)
Groups Geom. Dyn. 1, No. 1, 1-20 (2007).
10
Designing key transport protocols using combinatorial group theory. (English)
Gerritzen, Lothar (ed.) et al., Algebraic methods in cryptography. AMS/DMV joint international meeting, June 16‒19, 2005, Mainz, Germany. International workshop on algebraic methods in cryptography, November 17‒18, 2005, Bochum, Germany. Providence, RI: American Mathematical Society (AMS) (ISBN 0-8218-4037-1/pbk). Contemporary Mathematics 418, 35-43 (2006).
11
A proposed public key cryptosystem using the modular group. (English)
Fine, Benjamin (ed.) et al., Combinatorial group theory, discrete groups, and number theory. A conference in honor of Gerhard Rosenberger’s sixtieth birthday, Fairfield, CT, USA, December 8‒9, 2004 and the AMS special session on infinite groups, Bard College, Annandale-on-Hudson, NY, USA, October 8‒9, 2005. Providence, RI: American Mathematical Society (AMS) (ISBN 0-8218-3985-3/pbk). Contemporary Mathematics 421, 35-43 (2006).
12
Cryptosystems using linear groups. (English)
Appl. Algebra Eng. Commun. Comput. 17, No. 3-4, 205-217 (2006).
13
Parafree one-relator groups. (English)
J. Group Theory 9, No. 2, 191-201 (2006).
14
Experimenting with infinite groups. I. (English)
Exp. Math. 13, No. 4, 495-502 (2004).
15
Discriminating completions of hyperbolic groups. (English)
Geom. Dedicata 92, 115-143 (2002).
16
Fibre products, non-positive curvature, and decision problems. (English)
Comment. Math. Helv. 75, No.3, 457-477 (2000).
17
Malnormality is decidable in free groups. (English)
Int. J. Algebra Comput. 9, No.6, 687-692 (1999).
18
Finitely generated residually torsion-free nilpotent groups. I. (English)
J. Aust. Math. Soc., Ser. A 67, No.3, 289-317 (1999).
19
Open problems in combinatorial group theory. (English)
Gilman, Robert H. (ed.), Groups, languages and geometry. 1998 AMS-IMS-SIAM joint summer research conference on geometric group theory and computer science, South Hadley, MA, USA, July 5-9, 1998. Providence, RI: American Mathematical Society. Contemp. Math. 250, 1-27 (1999).
20
Result 1 to 20 of 45 total
Start
Contact
Print
General Help
