Boaz Tsaban

According to our database1, Boaz Tsaban authored at least 41 papers between 2001 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
TS-Hash: a lightweight cryptographic hash family based on Galois LFSRs.
IACR Cryptol. ePrint Arch., 2023

2020
A classification of the cofinal structures of precompacta.
Ann. Pure Appl. Log., 2020

2018
Cryptanalysis via Algebraic Spans.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
Products of Menger spaces: A combinatorial approach.
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

A reduction of Semigroup DLP to classic DLP.
Des. Codes Cryptogr., 2016

2015
Polynomial-Time Solutions of Computational Problems in Noncommutative-Algebraic Cryptography.
J. Cryptol., 2015

Cryptanalysis of the MORE symmetric key fully homomorphic encryption scheme.
J. Math. Cryptol., 2015

A Practical Cryptanalysis of the Algebraic Eraser.
IACR Cryptol. ePrint Arch., 2015

Cryptanalysis of SP Networks with Partial Non-Linear Layers.
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

Improved Analysis of Zorro-Like Ciphers.
IACR Cryptol. ePrint Arch., 2014

Complete simultaneous conjugacy invariants in Garside groups.
CoRR, 2014

Selective covering properties of product spaces.
Ann. Pure Appl. Log., 2014

2013
Short collision search in arbitrary SL2 homomorphic hash functions.
IACR Cryptol. ePrint Arch., 2013

2012
The discrete logarithm problem in Bergman's non-representable ring.
J. Math. Cryptol., 2012

Polynomial time cryptanalysis of noncommutative-algebraic key exchange protocols.
IACR Cryptol. ePrint Arch., 2012

The Discrete Logarithm Problem in non-representable rings.
IACR Cryptol. ePrint Arch., 2012

Short expressions of permutations as products and cryptanalysis of the Algebraic Eraser.
Adv. Appl. Math., 2012

2008
Combinatorial images of sets of reals and semifilter trichotomy.
J. Symb. Log., 2008

Cryptanalysis of the Algebraic Eraser and short expressions of permutations as products
CoRR, 2008

2007
Theoretical Cryptanalysis of the Klimov-Shamir Number Generator TF-1.
J. Cryptol., 2007

Length-based cryptanalysis: the case of Thompson's group.
J. Math. Cryptol., 2007

Decompositions of graphs of functions and fast iterations of lookup tables.
Discret. Appl. Math., 2007

Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions.
Proceedings of the Public Key Cryptography, 2007

2006
Menger's covering property and groupwise density.
J. Symb. Log., 2006

Fast generators for the Diffie-Hellman key agreement protocol and malicious standards.
Inf. Process. Lett., 2006

A better length function for Artin's braid groups
CoRR, 2006

Covering the Baire space by families which are not finitely dominating.
Ann. Pure Appl. Log., 2006

2005
The Conjugacy Problem and Related Problems in Lattice-Ordered Groups.
Int. J. Algebra Comput., 2005

On an authentication scheme based on the Root Problem in the braid group.
IACR Cryptol. ePrint Arch., 2005

Decompositions of graphs of functions and efficient iterations of lookup tables
CoRR, 2005

Probabilistic solutions of equations in the braid group.
Adv. Appl. Math., 2005

2004
The combinatorics of splittability.
Ann. Pure Appl. Log., 2004

2003
Additivity properties of topological diagonalizations.
J. Symb. Log., 2003

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

Efficient linear feedback shift registers with maximal period.
IACR Cryptol. ePrint Arch., 2003

Permutation graphs, fast forward permutations, and.
IACR Cryptol. ePrint Arch., 2003

Guaranteeing the diversity of number generators.
IACR Cryptol. ePrint Arch., 2003

Bernoulli Numbers and the Probability of a Birthday Surprise.
Discret. Appl. Math., 2003

2001
A Mechanical Derivation of the Area of the Sphere.
Am. Math. Mon., 2001


  Loading...