default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHadi Soleimany
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Milad Seddigh
, Mahdi Esfahani, Sarani Bhattacharya, Mohammad Reza Aref, Hadi Soleimany:
Breaking KASLR on mobile devices without any use of cache memory (extended version). J. Cryptogr. Eng. 14(2): 281-294 (2024)- [j21]Raziyeh Salarifard, Hadi Soleimany:
An efficient hardware accelerator for NTT-based polynomial multiplication using FPGA. J. Cryptogr. Eng. 14(2): 415-426 (2024) - [j20]Ali Asghar Beigizad, Hadi Soleimany, Sara Zarei, Hamed Ramzanipour:
Linked Fault Analysis. IEEE Trans. Inf. Forensics Secur. 19: 632-645 (2024) - 2023
- [j19]Navid Vafaei, Hadi Soleimany, Nasour Bagheri:
Exploiting statistical effective fault attack in a blind setting. IET Inf. Secur. 17(4): 639-646 (2023) - [i13]Raziyeh Salarifard, Hadi Soleimany:
Efficient Accelerator for NTT-based Polynomial Multiplication. IACR Cryptol. ePrint Arch. 2023: 686 (2023) - 2022
- [j18]Milad Seddigh, Hadi Soleimany:
Flush+Reload Attacks on SEED. Comput. J. 65(10): 2769-2779 (2022) - [j17]Muhamadali Hajisoltani, Raziyeh Salarifard, Hadi Soleimany:
Secure and Low-Area Implementation of the AES Using FPGA. ISC Int. J. Inf. Secur. 14(3): 93-99 (2022) - [j16]Hadi Soleimany, Nasour Bagheri, Hosein Hadipour, Prasanna Ravi, Shivam Bhasin, Sara Mansouri:
Practical Multiple Persistent Faults Analysis. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(1): 367-390 (2022) - [j15]Nasour Bagheri, Sadegh Sadeghi, Prasanna Ravi, Shivam Bhasin, Hadi Soleimany:
SIPFA: Statistical Ineffective Persistent Faults Analysis on Feistel Ciphers. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(3): 367-390 (2022) - [j14]Navid Vafaei, Sara Zarei, Nasour Bagheri, Maria Eichlseder, Robert Primas, Hadi Soleimany:
Statistical Effective Fault Attacks: The Other Side of the Coin. IEEE Trans. Inf. Forensics Secur. 17: 1855-1867 (2022) - [j13]Milad Seddigh, Hadi Soleimany:
Cross-VM cache attacks on Camellia. J. Comput. Virol. Hacking Tech. 18(2): 91-99 (2022) - [j12]Hadi Soleimany, Farokhlagha Moazami:
A generalized framework for accelerating exhaustive search utilizing deterministic related-key differential characteristics. J. Comput. Virol. Hacking Tech. 18(2): 141-146 (2022) - [c4]Milad Seddigh, Mahdi Esfahani, Sarani Bhattacharya, Mohammad Reza Aref, Hadi Soleimany:
Breaking KASLR on Mobile Devices without Any Use of Cache Memory. ASHES@CCS 2022: 45-54 - [i12]Nasour Bagheri, Sadegh Sadeghi, Prasanna Ravi, Shivam Bhasin, Hadi Soleimany:
SIPFA: Statistical Ineffective Persistent Faults Analysis on Feistel Ciphers. IACR Cryptol. ePrint Arch. 2022: 459 (2022) - [i11]Navid Vafaei, Sara Zarei, Nasour Bagheri, Maria Eichlseder, Robert Primas, Hadi Soleimany:
Statistical Effective Fault Attacks: The other Side of the Coin. IACR Cryptol. ePrint Arch. 2022: 642 (2022) - [i10]Ali Asghar Beigizad, Hadi Soleimany, Sara Zarei, Hamed Ramzanipour:
Linked Fault Analysis. IACR Cryptol. ePrint Arch. 2022: 865 (2022) - 2021
- [j11]Mahdi Esfahani, Hadi Soleimany, Mohammad Reza Aref:
Enhanced cache attack on AES applicable on ARM-based devices with new operating systems. Comput. Networks 198: 108407 (2021) - [j10]Vahid Meraji, Hadi Soleimany:
Evict+Time Attack on Intel CPUs without Explicit Knowledge of Address Offsets. ISC Int. J. Inf. Secur. 13(1): 19-27 (2021) - [j9]Sara Zarei, Aein Rezaei Shahmirzadi, Hadi Soleimany, Raziyeh Salarifard, Amir Moradi:
Low-Latency Keccak at any Arbitrary Order. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(4): 388-411 (2021) - [i9]Sara Zarei, Aein Rezaei Shahmirzadi, Hadi Soleimany, Raziyeh Salarifard, Amir Moradi:
Low-Latency Keccak at any Arbitrary Order. IACR Cryptol. ePrint Arch. 2021: 892 (2021) - [i8]Hadi Soleimany, Nasour Bagheri, Hosein Hadipour, Prasanna Ravi, Shivam Bhasin, Sara Mansouri:
Practical Multiple Persistent Faults Analysis. IACR Cryptol. ePrint Arch. 2021: 1362 (2021) - 2020
- [j8]Parinaz Mahdion, Hadi Soleimany, Pouya Habibi, Farokhlagha Moazami:
New single-trace side-channel attacks on a specific class of Elgamal cryptosystem. IET Inf. Secur. 14(2): 151-156 (2020) - [j7]Christoph Dobraunig, Farokhlagha Moazami, Christian Rechberger, Hadi Soleimany:
Framework for faster key search using related-key higher-order differential properties: applications to Agrasta. IET Inf. Secur. 14(2): 202-209 (2020) - [j6]Milad Seddigh, Hadi Soleimany:
Enhanced Flush+Reload Attack on AES. ISC Int. J. Inf. Secur. 12(2): 81-89 (2020) - [i7]Milad Seddigh, Hadi Soleimany:
Enhanced Flush+Reload Attack on AES. IACR Cryptol. ePrint Arch. 2020: 907 (2020) - [i6]Mahdi Esfahani, Hadi Soleimany, Mohammad Reza Aref:
Modified Cache Template Attack on AES. IACR Cryptol. ePrint Arch. 2020: 1560 (2020)
2010 – 2019
- 2018
- [j5]Farokhlagha Moazami, Alireza Mehrdad, Hadi Soleimany:
Impossible Differential Cryptanalysis on Deoxys-BC-256. ISC Int. J. Inf. Secur. 10(2): 93-105 (2018) - [j4]Christian Rechberger, Hadi Soleimany, Tyge Tiessen:
Cryptanalysis of Low-Data Instances of Full LowMCv2. IACR Trans. Symmetric Cryptol. 2018(3): 163-181 (2018) - [i5]Alireza Mehrdad, Farokhlagha Moazami, Hadi Soleimany:
Impossible Differential Cryptanalysis on Deoxys-BC-256. IACR Cryptol. ePrint Arch. 2018: 48 (2018) - [i4]Parinaz Mahdion, Hadi Soleimany, Pouya Habibi, Farokhlagha Moazami:
New Single-Trace Side-Channel Attacks on a Specific Class of Elgamal Cryptosystem. IACR Cryptol. ePrint Arch. 2018: 761 (2018) - [i3]Christian Rechberger, Hadi Soleimany, Tyge Tiessen:
Cryptanalysis of Low-Data Instances of Full LowMCv2. IACR Cryptol. ePrint Arch. 2018: 859 (2018) - 2016
- [c3]Christina Boura, Avik Chakraborti, Gaëtan Leurent, Goutam Paul, Dhiman Saha, Hadi Soleimany, Valentin Suder:
Key Recovery Attack Against 2.5-Round \pi -Cipher. FSE 2016: 535-553 - [i2]Christina Boura, Avik Chakraborti, Gaëtan Leurent, Goutam Paul, Dhiman Saha, Hadi Soleimany, Valentin Suder:
Key Recovery Attack against 2.5-round pi-Cipher. IACR Cryptol. ePrint Arch. 2016: 502 (2016) - 2015
- [j3]Hadi Soleimany:
Self-similarity cryptanalysis of the block cipher ITUbee. IET Inf. Secur. 9(3): 179-184 (2015) - [j2]Hadi Soleimany, Céline Blondeau, Xiaoli Yu, Wenling Wu, Kaisa Nyberg, Huiling Zhang, Lei Zhang, Yanfeng Wang:
Reflection Cryptanalysis of PRINCE-Like Ciphers. J. Cryptol. 28(3): 718-744 (2015) - 2014
- [b1]Hadi Soleimany:
Studies in Lightweight Cryptography ; Tutkimuksia kevyen luokan salaustekniikasta. Aalto University, Helsinki, Finland, 2014 - [j1]Hadi Soleimany, Kaisa Nyberg:
Zero-correlation linear cryptanalysis of reduced-round LBlock. Des. Codes Cryptogr. 73(2): 683-698 (2014) - [c2]Hadi Soleimany:
Probabilistic Slide Cryptanalysis and Its Applications to LED-64 and Zorro. FSE 2014: 373-389 - 2013
- [c1]Hadi Soleimany, Céline Blondeau, Xiaoli Yu, Wenling Wu, Kaisa Nyberg, Huiling Zhang, Lei Zhang, Yanfeng Wang:
Reflection Cryptanalysis of PRINCE-Like Ciphers. FSE 2013: 71-91 - 2012
- [i1]Hadi Soleimany:
Zero-Correlation Linear Cryptanalysis of Reduced-Round LBlock. IACR Cryptol. ePrint Arch. 2012: 570 (2012)
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-10-07 22:12 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:
