default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBoaz Tsaban
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i36]Itay Bookstein, Boaz Tsaban:
TS-Hash: a lightweight cryptographic hash family based on Galois LFSRs. IACR Cryptol. ePrint Arch. 2023: 179 (2023)- 2020
- [j24]Aviv Eshed, María Vicenta Ferrer, Salvador Hernández, Piotr Szewczak
, Boaz Tsaban:
A classification of the cofinal structures of precompacta. Ann. Pure Appl. Log. 171(8): 102810 (2020)
2010 – 2019
- 2018
- [c4]Adi Ben-Zvi, Arkadius G. Kalka, Boaz Tsaban:
Cryptanalysis via Algebraic Spans. CRYPTO (1) 2018: 255-274 - 2017
- [j23]Piotr Szewczak, Boaz Tsaban:
Products of Menger spaces: A combinatorial approach. Ann. Pure Appl. Log. 168(1): 1-18 (2017) - 2016
- [j22]Matan Banin, Boaz Tsaban:
A reduction of Semigroup DLP to classic DLP. Des. Codes Cryptogr. 81(1): 75-82 (2016) - [j21]Ciaran Mullan, Boaz Tsaban:
SL2 homomorphic hash functions: worst case to average case reduction and short collision search. Des. Codes Cryptogr. 81(1): 83-107 (2016) - [c3]Adi Ben-Zvi, Simon R. Blackburn, Boaz Tsaban:
A Practical Cryptanalysis of the Algebraic Eraser. CRYPTO (1) 2016: 179-189 - 2015
- [j20]Boaz Tsaban, Noam Lifshitz:
Cryptanalysis of the MORE symmetric key fully homomorphic encryption scheme. J. Math. Cryptol. 9(2): 75-78 (2015) - [j19]Boaz Tsaban:
Polynomial-Time Solutions of Computational Problems in Noncommutative-Algebraic Cryptography. J. Cryptol. 28(3): 601-622 (2015) - [c2]Achiya Bar-On, Itai Dinur, Orr Dunkelman, Virginie Lallemand, Nathan Keller, Boaz Tsaban:
Cryptanalysis of SP Networks with Partial Non-Linear Layers. EUROCRYPT (1) 2015: 315-342 - [i35]Adi Ben-Zvi, Simon R. Blackburn, Boaz Tsaban:
A Practical Cryptanalysis of the Algebraic Eraser. CoRR abs/1511.03870 (2015) - [i34]Adi Ben-Zvi, Simon R. Blackburn, Boaz Tsaban:
A Practical Cryptanalysis of the Algebraic Eraser. IACR Cryptol. ePrint Arch. 2015: 1102 (2015) - 2014
- [j18]Arnold W. Miller, Boaz Tsaban, Lyubomyr Zdomskyy:
Selective covering properties of product spaces. Ann. Pure Appl. Log. 165(5): 1034-1057 (2014) - [i33]Arkadius G. Kalka, Boaz Tsaban, Gary Vinokur:
Complete simultaneous conjugacy invariants in Garside groups. CoRR abs/1403.4622 (2014) - [i32]Boaz Tsaban:
Practical polynomial time solutions of several major problems in noncommutative-algebraic cryptography. IACR Cryptol. ePrint Arch. 2014: 41 (2014) - [i31]Achiya Bar-On, Itai Dinur, Orr Dunkelman, Virginie Lallemand, Boaz Tsaban:
Improved Analysis of Zorro-Like Ciphers. IACR Cryptol. ePrint Arch. 2014: 228 (2014) - [i30]Boaz Tsaban, Noam Lifshitz:
Cryptanalysis of the MORE symmetric key fully homomorphic encryption scheme. IACR Cryptol. ePrint Arch. 2014: 250 (2014) - 2013
- [i29]Ciaran Mullan, Boaz Tsaban:
Short collision search in arbitrary SL2 homomorphic hash functions. CoRR abs/1306.5646 (2013) - [i28]Matan Banin, Boaz Tsaban:
A reduction of semigroup DLP to classic DLP. CoRR abs/1310.7903 (2013) - [i27]Ciaran Mullan, Boaz Tsaban:
Short collision search in arbitrary SL2 homomorphic hash functions. IACR Cryptol. ePrint Arch. 2013: 415 (2013) - [i26]Matan Banin, Boaz Tsaban:
A reduction of semigroup DLP to classic DLP. IACR Cryptol. ePrint Arch. 2013: 707 (2013) - 2012
- [j17]Arkadius G. Kalka, Mina Teicher, Boaz Tsaban:
Short expressions of permutations as products and cryptanalysis of the Algebraic Eraser. Adv. Appl. Math. 49(1): 57-76 (2012) - [j16]Matan Banin, Boaz Tsaban:
The discrete logarithm problem in Bergman's non-representable ring. J. Math. Cryptol. 6(2): 171-182 (2012) - [i25]Matan Banin, Boaz Tsaban:
The Discrete Logarithm Problem in non-representable rings. CoRR abs/1206.1077 (2012) - [i24]Boaz Tsaban:
Polynomial time cryptanalysis of noncommutative-algebraic key exchange protocols. CoRR abs/1210.8114 (2012) - [i23]Matan Banin, Boaz Tsaban:
The Discrete Logarithm Problem in non-representable rings. IACR Cryptol. ePrint Arch. 2012: 320 (2012) - [i22]Boaz Tsaban:
Polynomial time cryptanalysis of noncommutative-algebraic key exchange protocols. IACR Cryptol. ePrint Arch. 2012: 615 (2012)
2000 – 2009
- 2008
- [j15]Boaz Tsaban, Lyubomyr Zdomskyy:
Combinatorial images of sets of reals and semifilter trichotomy. J. Symb. Log. 73(4): 1278-1288 (2008) - [i21]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
- [j14]Boaz Tsaban:
Decompositions of graphs of functions and fast iterations of lookup tables. Discret. Appl. Math. 155(3): 386-393 (2007) - [j13]Dima Ruinskiy, Adi Shamir, Boaz Tsaban:
Length-based cryptanalysis: the case of Thompson's group. J. Math. Cryptol. 1(4): 359-372 (2007) - [j12]Boaz Tsaban:
Theoretical Cryptanalysis of the Klimov-Shamir Number Generator TF-1. J. Cryptol. 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 - [i20]Dima Ruinskiy, Adi Shamir, Boaz Tsaban:
Cryptanalysis of group-based key agreement protocols using subgroup distance functions. CoRR abs/0705.2862 (2007) - 2006
- [j11]Heike Mildenberger, Saharon Shelah, Boaz Tsaban:
Covering the Baire space by families which are not finitely dominating. Ann. Pure Appl. Log. 140(1-3): 60-71 (2006) - [j10]Boaz Tsaban:
Fast generators for the Diffie-Hellman key agreement protocol and malicious standards. Inf. Process. Lett. 99(4): 145-148 (2006) - [j9]Boaz Tsaban, Lyubomyr Zdomskyy:
Menger's covering property and groupwise density. J. Symb. Log. 71(3): 1053-1056 (2006) - [i19]Dima Ruinskiy, Adi Shamir, Boaz Tsaban:
Length-based cryptanalysis: The case of Thompson's Group. CoRR abs/cs/0607079 (2006) - [i18]Martin Hock, Boaz Tsaban:
A better length function for Artin's braid groups. CoRR abs/math/0611918 (2006) - [i17]Dima Ruinskiy, Adi Shamir, Boaz Tsaban:
Length-based cryptanalysis: The case of Thompson's Group. IACR Cryptol. ePrint Arch. 2006: 244 (2006) - 2005
- [j8]David Garber, Shmuel Kaplan, Mina Teicher, Boaz Tsaban, Uzi Vishne:
Probabilistic solutions of equations in the braid group. Adv. Appl. Math. 35(3): 323-334 (2005) - [j7]W. Charles Holland, Boaz Tsaban:
The Conjugacy Problem and Related Problems in Lattice-Ordered Groups. Int. J. Algebra Comput. 15(2): 395-404 (2005) - [i16]Boaz Tsaban:
Fast generators for the Diffie-Hellman key agreement protocol and malicious standards. CoRR abs/cs/0505082 (2005) - [i15]Boaz Tsaban:
Theoretical cryptanalysis of the Klimov-Shamir number generator TF-1. CoRR abs/cs/0507063 (2005) - [i14]Boaz Tsaban:
Decompositions of graphs of functions and efficient iterations of lookup tables. CoRR abs/cs/0508133 (2005) - [i13]W. Charles Holland, Boaz Tsaban:
The conjugacy problem and related problems in lattice-ordered groups. CoRR abs/math/0507041 (2005) - [i12]W. Charles Holland, Boaz Tsaban:
The conjugacy problem and related problems in lattice-ordered groups. IACR Cryptol. ePrint Arch. 2005: 218 (2005) - [i11]Boaz Tsaban:
Fast generators for the Diffie-Hellman key agreement protocol and malicious standards. IACR Cryptol. ePrint Arch. 2005: 231 (2005) - [i10]Boaz Tsaban:
Theoretical cryptanalysis of the Klimov-Shamir number generator TF-1. IACR Cryptol. ePrint Arch. 2005: 244 (2005) - [i9]Boaz Tsaban:
On an authentication scheme based on the Root Problem in the braid group. IACR Cryptol. ePrint Arch. 2005: 264 (2005) - 2004
- [j6]Boaz Tsaban:
The combinatorics of splittability. Ann. Pure Appl. Log. 129(1-3): 107-130 (2004) - [i8]David Garber, Shmuel 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. Discret. Appl. Math. 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) - [i7]Boaz Tsaban, Uzi Vishne:
Efficient linear feedback shift registers with maximal period. CoRR cs.CR/0304010 (2003) - [i6]Adi Shamir, Boaz Tsaban:
Guaranteeing the diversity of number generators. IACR Cryptol. ePrint Arch. 2003: 132 (2003) - [i5]Boaz Tsaban, Uzi Vishne:
Efficient linear feedback shift registers with maximal period. IACR Cryptol. ePrint Arch. 2003: 136 (2003) - [i4]Boaz Tsaban:
Bernoulli numbers and the probability of a birthday surprise. IACR Cryptol. ePrint Arch. 2003: 137 (2003) - [i3]Boaz Tsaban:
Permutation graphs, fast forward permutations, and. IACR Cryptol. ePrint Arch. 2003: 138 (2003) - 2002
- [i2]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. Am. Math. Mon. 108(1): 10-15 (2001) - [i1]Adi Shamir, Boaz Tsaban:
Guaranteeing the diversity of number generators. CoRR cs.CR/0112014 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
