default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammad Mahzoun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c3]Tomer Ashur, Thomas Buschman, Mohammad Mahzoun:
Algebraic Cryptanalysis of the HADES Design Strategy: Application to Poseidon and Poseidon2. ACISP (2) 2024: 225-244- [i10]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) - [i9]Fukang Liu, Mohammad Mahzoun, Willi Meier:
Modelling Ciphers with Overdefined Systems of Quadratic Equations: Application to Friday, Vision, RAIN and Biscuit. IACR Cryptol. ePrint Arch. 2024: 786 (2024) - 2023
- [j3]Tomer Ashur
, Mohammad Mahzoun, Dilara Toprakhisar:
How Not To Design An Efficient FHE-Friendly Block Cipher: Seljuk. Comput. J. 66(6): 1312-1319 (2023) - [j2]Fukang Liu, Mohammad Mahzoun, Morten Øygarden, Willi Meier:
Algebraic Attacks on RAIN and AIM Using Equivalent Representations. IACR Trans. Symmetric Cryptol. 2023(4): 166-186 (2023) - [i8]Tomer Ashur, Thomas Buschman, Mohammad Mahzoun:
Algebraic cryptanalysis of POSEIDON. IACR Cryptol. ePrint Arch. 2023: 537 (2023) - [i7]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) - [i6]Tomer Ashur, Al Kindi, Mohammad Mahzoun:
XHash8 and XHash12: Efficient STARK-friendly Hash Functions. IACR Cryptol. ePrint Arch. 2023: 1045 (2023) - [i5]Fukang Liu, Mohammad Mahzoun:
Algebraic Attacks on RAIN and AIM Using Equivalent Representations. IACR Cryptol. ePrint Arch. 2023: 1133 (2023) - [i4]Jolijn Cottaar, Kathrin Hövelmanns, Andreas Hülsing, Tanja Lange, Mohammad Mahzoun, Alex Pellegrini, Alberto Ravagnani, Sven Schäge, Monika Trimoska, Benne de Weger:
Report on evaluation of KpqC candidates. IACR Cryptol. ePrint Arch. 2023: 1853 (2023) - 2022
- [j1]Guillaume Barbu, Ward Beullens, Emmanuelle Dottax, Christophe Giraud, Agathe Houzelot, Chaoyun Li, Mohammad Mahzoun, Adrián Ranea, Jianrui Xie:
ECDSA White-Box Implementations: Attacks and Designs from CHES 2021 Challenge. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(4): 527-552 (2022) - [c2]Tomer Ashur, Mohammad Mahzoun, Dilara Toprakhisar:
Chaghri - A FHE-friendly Block Cipher. CCS 2022: 139-150 - [c1]Mohammad Mahzoun, Liliya Kraleva, Raluca Posteuca, Tomer Ashur:
Differential Cryptanalysis of K-Cipher. ISCC 2022: 1-7 - [i3]Guillaume Barbu, Ward Beullens, Emmanuelle Dottax, Christophe Giraud, Agathe Houzelot, Chaoyun Li, Mohammad Mahzoun, Adrián Ranea, Jianrui Xie:
ECDSA White-Box Implementations: Attacks and Designs from WhibOx 2021 Contest. IACR Cryptol. ePrint Arch. 2022: 385 (2022) - [i2]Tomer Ashur, Mohammad Mahzoun, Dilara Toprakhisar:
Chaghri - an FHE-friendly Block Cipher. IACR Cryptol. ePrint Arch. 2022: 592 (2022) - [i1]Mohammad Mahzoun, Liliya Kraleva, Raluca Posteuca, Tomer Ashur:
Differential Cryptanalysis of K-Cipher. IACR Cryptol. ePrint Arch. 2022: 1158 (2022)
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-07-31 21:39 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:
