Cryptanalysis via algebraic Spans

Adi Ben-Zvi; Arkadius Kalka; Boaz Tsaban

doi:10.1007/978-3-319-96884-1_9

Cryptanalysis via algebraic Spans

Adi Ben-Zvi, Arkadius Kalka, Boaz Tsaban

Department of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

17 Scopus citations

Abstract

We introduce a method for obtaining provable polynomial time solutions of problems in nonabelian algebraic cryptography. This method is widely applicable, easier to apply, and more efficient than earlier methods. After demonstrating its applicability to the major classic nonabelian protocols, we use this method to cryptanalyze the Triple Decomposition key exchange protocol, the only classic group theory based key exchange protocol that could not be cryptanalyzed by earlier methods.

Original language	English
Title of host publication	Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings
Editors	Alexandra Boldyreva, Hovav Shacham
Publisher	Springer Verlag
Pages	255-274
Number of pages	20
ISBN (Print)	9783319968834
DOIs	https://doi.org/10.1007/978-3-319-96884-1_9
State	Published - 2018
Event	38th Annual International Cryptology Conference, CRYPTO 2018 - Santa Barbara, United States Duration: 19 Aug 2018 → 23 Aug 2018

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10991 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	38th Annual International Cryptology Conference, CRYPTO 2018
Country/Territory	United States
City	Santa Barbara
Period	19/08/18 → 23/08/18

Bibliographical note

Publisher Copyright:
© International Association for Cryptologic Research 2018.

Funding

Acknowledgments. We thank Avraham (Rami) Eizenbud and Craig Gentry for intriguing discussions. A part of this work was carried out while the third named author was on Sabbatical at the Weizmann Institute of Science. This author thanks his hosts for their kind hospitality. The research of the first and third named authors was partially supported by the European Research Council under the ERC starting grant n. 757731 (LightCrypt), and by the BIU Center for Research in Applied Cryptography and Cyber Security, in conjunction with the Israel National Cyber Bureau in the Prime Minister’s Office.

Funders	Funder number
Horizon 2020 Framework Programme
European Commission	757731

Access to Document

10.1007/978-3-319-96884-1_9

Cite this

Ben-Zvi, A., Kalka, A., & Tsaban, B. (2018). Cryptanalysis via algebraic Spans. In A. Boldyreva, & H. Shacham (Eds.), Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings (pp. 255-274). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10991 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-96884-1_9

Ben-Zvi, Adi ; Kalka, Arkadius ; Tsaban, Boaz. / Cryptanalysis via algebraic Spans. Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings. editor / Alexandra Boldyreva ; Hovav Shacham. Springer Verlag, 2018. pp. 255-274 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{ddaf53a9184d4fbcbf0ee18695104e66,

title = "Cryptanalysis via algebraic Spans",

abstract = "We introduce a method for obtaining provable polynomial time solutions of problems in nonabelian algebraic cryptography. This method is widely applicable, easier to apply, and more efficient than earlier methods. After demonstrating its applicability to the major classic nonabelian protocols, we use this method to cryptanalyze the Triple Decomposition key exchange protocol, the only classic group theory based key exchange protocol that could not be cryptanalyzed by earlier methods.",

author = "Adi Ben-Zvi and Arkadius Kalka and Boaz Tsaban",

note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2018.; 38th Annual International Cryptology Conference, CRYPTO 2018 ; Conference date: 19-08-2018 Through 23-08-2018",

year = "2018",

doi = "10.1007/978-3-319-96884-1_9",

language = "אנגלית",

isbn = "9783319968834",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "255--274",

editor = "Alexandra Boldyreva and Hovav Shacham",

booktitle = "Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings",

address = "גרמניה",

}

Ben-Zvi, A, Kalka, A & Tsaban, B 2018, Cryptanalysis via algebraic Spans. in A Boldyreva & H Shacham (eds), Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10991 LNCS, Springer Verlag, pp. 255-274, 38th Annual International Cryptology Conference, CRYPTO 2018, Santa Barbara, United States, 19/08/18. https://doi.org/10.1007/978-3-319-96884-1_9

Cryptanalysis via algebraic Spans. / Ben-Zvi, Adi; Kalka, Arkadius; Tsaban, Boaz.
Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings. ed. / Alexandra Boldyreva; Hovav Shacham. Springer Verlag, 2018. p. 255-274 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10991 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Cryptanalysis via algebraic Spans

AU - Ben-Zvi, Adi

AU - Kalka, Arkadius

AU - Tsaban, Boaz

PY - 2018

Y1 - 2018

N2 - We introduce a method for obtaining provable polynomial time solutions of problems in nonabelian algebraic cryptography. This method is widely applicable, easier to apply, and more efficient than earlier methods. After demonstrating its applicability to the major classic nonabelian protocols, we use this method to cryptanalyze the Triple Decomposition key exchange protocol, the only classic group theory based key exchange protocol that could not be cryptanalyzed by earlier methods.

AB - We introduce a method for obtaining provable polynomial time solutions of problems in nonabelian algebraic cryptography. This method is widely applicable, easier to apply, and more efficient than earlier methods. After demonstrating its applicability to the major classic nonabelian protocols, we use this method to cryptanalyze the Triple Decomposition key exchange protocol, the only classic group theory based key exchange protocol that could not be cryptanalyzed by earlier methods.

UR - http://www.scopus.com/inward/record.url?scp=85052367683&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-96884-1_9

DO - 10.1007/978-3-319-96884-1_9

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85052367683

SN - 9783319968834

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 255

EP - 274

BT - Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings

A2 - Boldyreva, Alexandra

A2 - Shacham, Hovav

PB - Springer Verlag

T2 - 38th Annual International Cryptology Conference, CRYPTO 2018

Y2 - 19 August 2018 through 23 August 2018

ER -

Ben-Zvi A, Kalka A, Tsaban B. Cryptanalysis via algebraic Spans. In Boldyreva A, Shacham H, editors, Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings. Springer Verlag. 2018. p. 255-274. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-96884-1_9

Cryptanalysis via algebraic Spans

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this