default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomer Ashur
Person information
- affiliation: KU Leuven, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Tomer Ashur, Thomas Buschman, Mohammad Mahzoun:
Algebraic Cryptanalysis of the HADES Design Strategy: Application to Poseidon and Poseidon2. ACISP (2) 2024: 225-244- [i42]Tomer Ashur, Carmit Hazay, Rahul Satish:
On the Feasibility of Sliced Garbling. IACR Cryptol. ePrint Arch. 2024: 389 (2024) - [i41]Tomer Ashur, Mohammad Mahzoun, Jim Posen, Danilo Sijacic:
Vision Mark-32: ZK-Friendly Hash Function Over Binary Tower Fields. IACR Cryptol. ePrint Arch. 2024: 633 (2024) - [i40]Tomer Ashur, Amit Singh Bhati:
Generalized Indifferentiable Sponge and its Application to Polygon Miden VM. IACR Cryptol. ePrint Arch. 2024: 911 (2024) - [i39]Tomer Ashur, Sundas Tariq:
RPO-M31 and XHash-M31: Efficient Hash Functions for Circle STARKs. IACR Cryptol. ePrint Arch. 2024: 1635 (2024) - 2023
- [j12]Tomer Ashur, Chris J. Mitchell:
Special Issue on Failed Approaches and Insightful Losses in Cryptology - Foreword. Comput. J. 66(6): 1311 (2023) - [j11]Tomer Ashur
, Mohammad Mahzoun, Dilara Toprakhisar:
How Not To Design An Efficient FHE-Friendly Block Cipher: Seljuk. Comput. J. 66(6): 1312-1319 (2023) - [c16]Anasuya Acharya, Tomer Ashur, Efrat Cohen, Carmit Hazay, Avishay Yanai:
A New Approach to Garbled Circuits. ACNS 2023: 611-641 - [i38]Tomer Ashur, Erik Takke:
A New Linear Distinguisher for Four-Round AES. IACR Cryptol. ePrint Arch. 2023: 398 (2023) - [i37]Tomer Ashur, Thomas Buschman, Mohammad Mahzoun:
Algebraic cryptanalysis of POSEIDON. IACR Cryptol. ePrint Arch. 2023: 537 (2023) - [i36]Liliya Kraleva, Mohammad Mahzoun, Raluca Posteuca, Dilara Toprakhisar, Tomer Ashur, Ingrid Verbauwhede:
Cryptanalysis of Strong Physically Unclonable Functions. IACR Cryptol. ePrint Arch. 2023: 562 (2023) - [i35]Tomer Ashur, Al Kindi, Mohammad Mahzoun:
XHash8 and XHash12: Efficient STARK-friendly Hash Functions. IACR Cryptol. ePrint Arch. 2023: 1045 (2023) - [i34]Tomer Ashur, Al Kindi:
Arithmetization Oriented Encryption. IACR Cryptol. ePrint Arch. 2023: 1668 (2023) - 2022
- [j10]Jinyu Lu, Yunwen Liu, Tomer Ashur, Chao Li:
On the Effect of the Key-Expansion Algorithm in Simon-like Ciphers. Comput. J. 65(9): 2454-2469 (2022) - [j9]Jinyu Lu, Yunwen Liu, Tomer Ashur, Bing Sun, Chao Li:
Improved rotational-XOR cryptanalysis of Simon-like block ciphers. IET Inf. Secur. 16(4): 282-300 (2022) - [j8]Tomer Ashur, Mohsin Khan, Kaisa Nyberg:
Structural and Statistical Analysis of Multidimensional Linear Approximations of Random Functions and Permutations. IEEE Trans. Inf. Theory 68(2): 1296-1315 (2022) - [c15]Tomer Ashur, Mohammad Mahzoun, Dilara Toprakhisar:
Chaghri - A FHE-friendly Block Cipher. CCS 2022: 139-150 - [c14]Mohammad Mahzoun, Liliya Kraleva, Raluca Posteuca, Tomer Ashur:
Differential Cryptanalysis of K-Cipher. ISCC 2022: 1-7 - [i33]Jinyu Lu, Yunwen Liu, Tomer Ashur, Bing Sun, Chao Li:
Improved Rotational-XOR Cryptanalysis of Simon-like Block Ciphers. IACR Cryptol. ePrint Arch. 2022: 402 (2022) - [i32]Tomer Ashur, Mohammad Mahzoun, Dilara Toprakhisar:
Chaghri - an FHE-friendly Block Cipher. IACR Cryptol. ePrint Arch. 2022: 592 (2022) - [i31]Mohammad Mahzoun, Liliya Kraleva, Raluca Posteuca, Tomer Ashur:
Differential Cryptanalysis of K-Cipher. IACR Cryptol. ePrint Arch. 2022: 1158 (2022) - [i30]Tomer Ashur, Al Kindi, Willi Meier, Alan Szepieniec, Bobbin Threadbare:
Rescue-Prime Optimized. IACR Cryptol. ePrint Arch. 2022: 1577 (2022) - 2021
- [j7]Ignacio Fernández-Hernández, Tomer Ashur, Vincent Rijmen:
Analysis and Recommendations for MAC and Key Lengths in Delayed Disclosure GNSS Authentication Protocols. IEEE Trans. Aerosp. Electron. Syst. 57(3): 1827-1839 (2021) - [p1]Tomer Ashur, Atul Luykx:
An Account of the ISO/IEC Standardization of the Simon and Speck Block Cipher Families. Security of Ubiquitous Computing Systems 2021: 63-78 - [i29]Raluca Posteuca, Tomer Ashur:
How to Backdoor a Cipher. IACR Cryptol. ePrint Arch. 2021: 442 (2021) - [i28]Jinyu Lu, Yunwen Liu, Tomer Ashur, Chao Li:
On the Effect of the Key-expansion Algorithm in Simon-like Ciphers. IACR Cryptol. ePrint Arch. 2021: 674 (2021) - [i27]Tomer Ashur, Efrat Cohen, Carmit Hazay, Avishay Yanai:
A New Framework for Garbled Circuits. IACR Cryptol. ePrint Arch. 2021: 739 (2021) - [i26]Ignacio Fernández-Hernández, Tomer Ashur, Vincent Rijmen:
Analysis and Recommendations for MAC and Key Lengths in Delayed Disclosure GNSS Authentication Protocols. IACR Cryptol. ePrint Arch. 2021: 784 (2021) - [i25]Tomer Ashur, Mohsin Khan, Kaisa Nyberg:
Structural and Statistical Analysis of Multidimensional Linear Approximations of Random Functions and Permutations. IACR Cryptol. ePrint Arch. 2021: 1567 (2021) - 2020
- [j6]Tomer Ashur, Tim Beyne, Vincent Rijmen:
Revisiting the Wrong-Key-Randomization Hypothesis. J. Cryptol. 33(2): 567-594 (2020) - [j5]Abdelrahaman Aly, Tomer Ashur, Eli Ben-Sasson, Siemen Dhooghe, Alan Szepieniec:
Design of Symmetric-Key Primitives for Advanced Cryptographic Protocols. IACR Trans. Symmetric Cryptol. 2020(3): 1-45 (2020) - [c13]Jinyu Lu, Yunwen Liu, Tomer Ashur, Bing Sun, Chao Li:
Rotational-XOR Cryptanalysis of Simon-Like Block Ciphers. ACISP 2020: 105-124 - [c12]Liliya Kraleva, Tomer Ashur, Vincent Rijmen:
Rotational Cryptanalysis on MAC Algorithm Chaskey. ACNS (1) 2020: 153-168 - [c11]Tomer Ashur, Raluca Posteuca, Danilo Sijacic, Stef D'haeseleer:
Generalized Matsui Algorithm 1 with Application for the Full DES. SCN 2020: 448-467 - [i24]Jinyu Lu, Yunwen Liu, Tomer Ashur, Bing Sun, Chao Li:
Rotational-XOR Cryptanalysis of Simon-like Block Ciphers. IACR Cryptol. ePrint Arch. 2020: 486 (2020) - [i23]Tomer Ashur, Raluca Posteuca, Danilo Sijacic, Stef D'haeseleer:
The Strictly Zero-Correlation Attack with Application to the Full DES. IACR Cryptol. ePrint Arch. 2020: 523 (2020) - [i22]Liliya Kraleva, Tomer Ashur, Vincent Rijmen:
Rotational Cryptanalysis on MAC Algorithm Chaskey. IACR Cryptol. ePrint Arch. 2020: 538 (2020) - [i21]Tomer Ashur, Siemen Dhooghe:
Prelude to Marvellous (With the Designers' Commentary, Two Bonus Tracks, and a Foretold Prophecy). IACR Cryptol. ePrint Arch. 2020: 568 (2020) - [i20]Adrián Ranea, Yunwen Liu, Tomer Ashur:
An Easy-to-Use Tool for Rotational-XOR Cryptanalysis of ARX Block Ciphers. IACR Cryptol. ePrint Arch. 2020: 727 (2020) - [i19]Alan Szepieniec, Tomer Ashur, Siemen Dhooghe:
Rescue-Prime: a Standard Specification (SoK). IACR Cryptol. ePrint Arch. 2020: 1143 (2020)
2010 – 2019
- 2019
- [j4]Lennert Wouters, Eduard Marin, Tomer Ashur, Benedikt Gierlichs, Bart Preneel:
Fast, Furious and Insecure: Passive Keyless Entry and Start Systems in Modern Supercars. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2019(3): 66-85 (2019) - [c10]Tomer Ashur, Orr Dunkelman, Nael Masalha:
Linear Cryptanalysis Reduced Round of Piccolo-80. CSCML 2019: 16-32 - [i18]Abdelrahaman Aly, Tomer Ashur, Eli Ben-Sasson, Siemen Dhooghe, Alan Szepieniec:
Efficient Symmetric Primitives for Advanced Cryptographic Protocols (A Marvellous Contribution). IACR Cryptol. ePrint Arch. 2019: 426 (2019) - 2018
- [c9]Tomer Ashur, Maria Eichlseder, Martin M. Lauridsen, Gaëtan Leurent, Brice Minaud, Yann Rotella, Yu Sasaki, Benoît Viguier:
Cryptanalysis of MORUS. ASIACRYPT (2) 2018: 35-64 - [i17]Tomer Ashur, Maria Eichlseder, Martin M. Lauridsen, Gaëtan Leurent, Brice Minaud, Yann Rotella, Yu Sasaki, Benoît Viguier:
Cryptanalysis of MORUS. IACR Cryptol. ePrint Arch. 2018: 464 (2018) - [i16]Tomer Ashur, Raluca Posteuca:
On linear hulls in one round of DES. IACR Cryptol. ePrint Arch. 2018: 635 (2018) - [i15]Tomer Ashur, Siemen Dhooghe:
MARVELlous: a STARK-Friendly Family of Cryptographic Primitives. IACR Cryptol. ePrint Arch. 2018: 1098 (2018) - [i14]Tomer Ashur, Raluca Posteuca:
Cryptanalysis of the Full DES and the Full 3DES Using a New Linear Property. IACR Cryptol. ePrint Arch. 2018: 1219 (2018) - 2017
- [j3]Tomer Ashur, Achiya Bar-On, Orr Dunkelman:
Cryptanalysis of GOST2. IACR Trans. Symmetric Cryptol. 2017(1): 203-214 (2017) - [j2]Yunwen Liu, Glenn De Witte, Adrián Ranea, Tomer Ashur:
Rotational-XOR Cryptanalysis of Reduced-round SPECK. IACR Trans. Symmetric Cryptol. 2017(3): 24-36 (2017) - [c8]Tomer Ashur, Jeroen Delvaux, Sanghan Lee, Pieter Maene, Eduard Marin, Svetla Nikova, Oscar Reparaz, Vladimir Rozic, Dave Singelée, Bohan Yang, Bart Preneel:
A Privacy-Preserving Device Tracking System Using a Low-Power Wide-Area Network. CANS 2017: 347-369 - [c7]Tomer Ashur, Orr Dunkelman, Atul Luykx:
Boosting Authenticated Encryption Robustness with Minimal Modifications. CRYPTO (3) 2017: 3-33 - [i13]Tomer Ashur, Daniël Bodden, Orr Dunkelman:
Linear Cryptanalysis Using Low-bias Linear Approximations. IACR Cryptol. ePrint Arch. 2017: 204 (2017) - [i12]Tomer Ashur, Orr Dunkelman, Atul Luykx:
Boosting Authenticated Encryption Robustness With Minimal Modifications. IACR Cryptol. ePrint Arch. 2017: 239 (2017) - [i11]Yunwen Liu, Glenn De Witte, Adrián Ranea, Tomer Ashur:
Rotational-XOR Cryptanalysis of Reduced-round SPECK. IACR Cryptol. ePrint Arch. 2017: 1036 (2017) - 2016
- [j1]Tomer Ashur, Yunwen Liu:
Rotational Cryptanalysis in the Presence of Constants. IACR Trans. Symmetric Cryptol. 2016(1): 57-70 (2016) - [c6]Tomer Ashur, Vincent Rijmen:
On Linear Hulls and Trails. INDOCRYPT 2016: 269-286 - [c5]Tomer Ashur, Bart Mennink:
Damaging, Simplifying, and Salvaging p-OMD. ISC 2016: 73-92 - [c4]Tomer Ashur, Orr Dunkelman, Nimrod Talmon:
Breaching the Privacy of Israel's Paper Ballot Voting System. E-VOTE-ID 2016: 108-124 - [i10]Tomer Ashur, Orr Dunkelman, Nimrod Talmon:
Breaching the Privacy of Israel's Paper Ballot Voting System. CoRR abs/1608.08020 (2016) - [i9]Tomer Ashur, Vincent Rijmen:
On Linear Hulls and Trails in Simon. IACR Cryptol. ePrint Arch. 2016: 88 (2016) - [i8]Tomer Ashur, Achiya Bar-On, Orr Dunkelman:
Cryptanalysis of GOST2. IACR Cryptol. ePrint Arch. 2016: 532 (2016) - [i7]Tomer Ashur, Bart Mennink:
Damaging, Simplifying, and Salvaging p-OMD. IACR Cryptol. ePrint Arch. 2016: 534 (2016) - [i6]Tomer Ashur, Yunwen Liu:
Rotational Cryptanalysis in the Presence of Constants. IACR Cryptol. ePrint Arch. 2016: 826 (2016) - [i5]Tomer Ashur, Tim Beyne, Vincent Rijmen:
Revisiting the Wrong-Key-Randomization Hypothesis. IACR Cryptol. ePrint Arch. 2016: 990 (2016) - 2015
- [i4]Tomer Ashur, Bart Mennink:
Trivial Nonce-Misusing Attack on Pure OMD. IACR Cryptol. ePrint Arch. 2015: 175 (2015) - [i3]Tomer Ashur:
Improved Linear Trails for the Block Cipher Simon. IACR Cryptol. ePrint Arch. 2015: 285 (2015) - 2013
- [c3]Tomer Ashur, Orr Dunkelman:
A Practical Related-Key Boomerang Attack for the Full MMB Block Cipher. CANS 2013: 271-290 - [c2]Tomer Ashur, Orr Dunkelman:
On the anonymity of Israel's general elections. CCS 2013: 1399-1402 - [i2]Tomer Ashur, Orr Dunkelman:
A Practical Related-Key Boomerang Attack for the Full MMB Block Cipher. IACR Cryptol. ePrint Arch. 2013: 675 (2013) - 2011
- [c1]Tomer Ashur, Orr Dunkelman:
Linear Analysis of Reduced-Round CubeHash. ACNS 2011: 462-478 - 2010
- [i1]Tomer Ashur, Orr Dunkelman:
Linear Analysis of Reduced-Round CubeHash. IACR Cryptol. ePrint Arch. 2010: 535 (2010)
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-11-11 21:29 CET 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:
