- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j15 |      | Matan Banin, Boaz Tsaban: The discrete logarithm problem in Bergman's non-representable ring. J. Mathematical Cryptology 6(2): 171-182 (2012) |
| i27 | | Matan Banin, Boaz Tsaban: The Discrete Logarithm Problem in non-representable rings. CoRR abs/1206.1077 (2012) |
| i26 | | Boaz Tsaban: Polynomial time cryptanalysis of noncommutative-algebraic key exchange protocols. CoRR abs/1210.8114 (2012) |
| i25 | | Matan Banin, Boaz Tsaban: The Discrete Logarithm Problem in non-representable rings. IACR Cryptology ePrint Archive 2012: 320 (2012) |
| i24 | | Boaz Tsaban: Polynomial time cryptanalysis of noncommutative-algebraic key exchange protocols. IACR Cryptology ePrint Archive 2012: 615 (2012) |
| 2008 | ||
| j14 | | Boaz Tsaban, Lyubomyr Zdomskyy: Combinatorial images of sets of reals and semifilter trichotomy. J. Symb. Log. 73(4): 1278-1288 (2008) |
| i23 | | Arkadius G. Kalka, Mina Teicher, Boaz Tsaban: Cryptanalysis of the Algebraic Eraser and short expressions of permutations as products. CoRR abs/0804.0629 (2008) |
| 2007 | ||
| j13 | | Boaz Tsaban: Decompositions of graphs of functions and fast iterations of lookup tables. Discrete Applied Mathematics 155(3): 386-393 (2007) |
| j12 | | Dima Ruinskiy, Adi Shamir, Boaz Tsaban: Length-based cryptanalysis: the case of Thompson's group. J. Mathematical Cryptology 1(4): 359-372 (2007) |
| j11 | | Boaz Tsaban: Theoretical Cryptanalysis of the Klimov-Shamir Number Generator TF-1. J. Cryptology 20(3): 389-392 (2007) |
| c1 | | Dima Ruinskiy, Adi Shamir, Boaz Tsaban: Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions. Public Key Cryptography 2007: 61-75 |
| i22 | | Dima Ruinskiy, Adi Shamir, Boaz Tsaban: Cryptanalysis of group-based key agreement protocols using subgroup distance functions. CoRR abs/0705.2862 (2007) |
| 2006 | ||
| j10 | | Heike Mildenberger, Saharon Shelah, Boaz Tsaban: Covering the Baire space by families which are not finitely dominating. Ann. Pure Appl. Logic 140(1-3): 60-71 (2006) |
| j9 | | Boaz Tsaban: Fast generators for the Diffie-Hellman key agreement protocol and malicious standards. Inf. Process. Lett. 99(4): 145-148 (2006) |
| j8 | | Boaz Tsaban, Lyubomyr Zdomskyy: Menger's covering property and groupwise density. J. Symb. Log. 71(3): 1053-1056 (2006) |
| i21 | | Dima Ruinskiy, Adi Shamir, Boaz Tsaban: Length-based cryptanalysis: The case of Thompson's Group. CoRR abs/cs/0607079 (2006) |
| i20 | | Martin Hock, Boaz Tsaban: A better length function for Artin's braid groups. CoRR abs/math/0611918 (2006) |
| i19 | | Dima Ruinskiy, Adi Shamir, Boaz Tsaban: Length-based cryptanalysis: The case of Thompson's Group. IACR Cryptology ePrint Archive 2006: 244 (2006) |
| 2005 | ||
| j7 | | W. Charles Holland, Boaz Tsaban: The Conjugacy Problem and Related Problems in Lattice-Ordered Groups. IJAC 15(2): 395-404 (2005) |
| i18 | | Boaz Tsaban: Fast generators for the Diffie-Hellman key agreement protocol and malicious standards. CoRR abs/cs/0505082 (2005) |
| i17 | | Boaz Tsaban: Theoretical cryptanalysis of the Klimov-Shamir number generator TF-1. CoRR abs/cs/0507063 (2005) |
| i16 | | Boaz Tsaban: Decompositions of graphs of functions and efficient iterations of lookup tables. CoRR abs/cs/0508133 (2005) |
| i15 | | Boaz Tsaban: On an authentication scheme based on the Root Problem in the braid group. CoRR abs/cs/0509059 (2005) |
| i14 | | W. Charles Holland, Boaz Tsaban: The conjugacy problem and related problems in lattice-ordered groups. CoRR abs/math/0507041 (2005) |
| i13 | | W. Charles Holland, Boaz Tsaban: The conjugacy problem and related problems in lattice-ordered groups. IACR Cryptology ePrint Archive 2005: 218 (2005) |
| i12 | | Boaz Tsaban: Fast generators for the Diffie-Hellman key agreement protocol and malicious standards. IACR Cryptology ePrint Archive 2005: 231 (2005) |
| i11 | | Boaz Tsaban: Theoretical cryptanalysis of the Klimov-Shamir number generator TF-1. IACR Cryptology ePrint Archive 2005: 244 (2005) |
| i10 | | Boaz Tsaban: On an authentication scheme based on the Root Problem in the braid group. IACR Cryptology ePrint Archive 2005: 264 (2005) |
| 2004 | ||
| j6 | | |
| i9 | | David Garber, S. Kaplan, Mina Teicher, Boaz Tsaban, Uzi Vishne: Probabilistic Solutions of Equations in the Braid Group. CoRR math.GR/0404076 (2004) |
| 2003 | ||
| j5 | | Boaz Tsaban: Bernoulli Numbers and the Probability of a Birthday Surprise. Discrete Applied Mathematics 127(3): 657-663 (2003) |
| j4 | | Boaz Tsaban: Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation. J. Algorithms 47(2): 104-121 (2003) |
| j3 | | Tomek Bartoszynski, Saharon Shelah, Boaz Tsaban: Additivity properties of topological diagonalizations. J. Symb. Log. 68(4): 1254-1260 (2003) |
| i8 | | Boaz Tsaban, Uzi Vishne: Efficient linear feedback shift registers with maximal period. CoRR cs.CR/0304010 (2003) |
| i7 | | Adi Shamir, Boaz Tsaban: Guaranteeing the diversity of number generators. IACR Cryptology ePrint Archive 2003: 132 (2003) |
| i6 | | Boaz Tsaban, Uzi Vishne: Efficient linear feedback shift registers with maximal period. IACR Cryptology ePrint Archive 2003: 136 (2003) |
| i5 | | Boaz Tsaban: Bernoulli numbers and the probability of a birthday surprise. IACR Cryptology ePrint Archive 2003: 137 (2003) |
| i4 | | Boaz Tsaban: Permutation graphs, fast forward permutations, and. IACR Cryptology ePrint Archive 2003: 138 (2003) |
| 2002 | ||
| i3 | | Boaz Tsaban: Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation. CoRR cs.CR/0207027 (2002) |
| 2001 | ||
| j2 | | Adi Shamir, Boaz Tsaban: Guaranteeing the Diversity of Number Generators. Inf. Comput. 171(2): 350-363 (2001) |
| j1 | | David Garber, Boaz Tsaban: A Mechanical Derivation of the Area of the Sphere. The American Mathematical Monthly 108(1): 10-15 (2001) |
| i2 | | |
| i1 | | |
Colors in the list of coauthors
Last update Sun May 19 20:42:38 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page