# Boaz Tsaban

According to our database

Collaborative distances:

^{1}, Boaz Tsaban authored at least 41 papers between 2001 and 2023.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2023

IACR Cryptol. ePrint Arch., 2023

2020

Ann. Pure Appl. Log., 2020

2018

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017

Ann. Pure Appl. Log., 2017

2016

SL<sub>2</sub> homomorphic hash functions: worst case to average case reduction and short collision search.

Des. Codes Cryptogr., 2016

Des. Codes Cryptogr., 2016

2015

Polynomial-Time Solutions of Computational Problems in Noncommutative-Algebraic Cryptography.

J. Cryptol., 2015

J. Math. Cryptol., 2015

IACR Cryptol. ePrint Arch., 2015

Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

2014

Practical polynomial time solutions of several major problems in noncommutative-algebraic cryptography.

IACR Cryptol. ePrint Arch., 2014

IACR Cryptol. ePrint Arch., 2014

CoRR, 2014

Ann. Pure Appl. Log., 2014

2013

IACR Cryptol. ePrint Arch., 2013

2012

J. Math. Cryptol., 2012

IACR Cryptol. ePrint Arch., 2012

IACR Cryptol. ePrint Arch., 2012

Short expressions of permutations as products and cryptanalysis of the Algebraic Eraser.

Adv. Appl. Math., 2012

2008

J. Symb. Log., 2008

Cryptanalysis of the Algebraic Eraser and short expressions of permutations as products

CoRR, 2008

2007

J. Cryptol., 2007

J. Math. Cryptol., 2007

Discret. Appl. Math., 2007

Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions.

Proceedings of the Public Key Cryptography, 2007

2006

J. Symb. Log., 2006

Fast generators for the Diffie-Hellman key agreement protocol and malicious standards.

Inf. Process. Lett., 2006

CoRR, 2006

Ann. Pure Appl. Log., 2006

2005

Int. J. Algebra Comput., 2005

IACR Cryptol. ePrint Arch., 2005

CoRR, 2005

Adv. Appl. Math., 2005

2004

Ann. Pure Appl. Log., 2004

2003

J. Symb. Log., 2003

Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation.

J. Algorithms, 2003

IACR Cryptol. ePrint Arch., 2003

IACR Cryptol. ePrint Arch., 2003

IACR Cryptol. ePrint Arch., 2003

Discret. Appl. Math., 2003

2001

Am. Math. Mon., 2001