default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJiahui He 0002
Person information
- affiliation: Shandong University, School of Cyber Science and Technology, Key Laboratory of Cryptologic Technology and Information Security, Qingdao, China
Other persons with the same name
- Jiahui He — disambiguation page
- Jiahui He 0001
![[0000-0003-1004-9679]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0003-1004-9679")
— Hong Kong University of Science and Technology, Guangzhou, Hong Kong - Jiahui He 0003 — Chinese Academy of Sciences, Shenzhen Institute of Advanced Technology, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c5]Shuo Peng, Kai Hu, Jiahui He, Meiqin Wang:
Improved Key Recovery Attacks of Ascon. CT-RSA 2025: 123-146- [i8]Shuo Peng, Kai Hu, Jiahui He, Meiqin Wang:
Improved Key Recovery Attacks of Ascon. IACR Cryptol. ePrint Arch. 2025: 1029 (2025) - [i7]Jiahui He, Kai Hu, Guowei Liu:
Exploring Core Monomial Prediction Further: Weak-Key Superpoly Recovery for 852-Round Trivium. IACR Cryptol. ePrint Arch. 2025: 1330 (2025) - [i6]Shuo Peng, Jiahui He, Kai Hu, Zhongfeng Niu, Shahram Rasoolzadeh, Meiqin Wang:
Cryptanalysis of ChiLow with Cube-Like Attacks. IACR Cryptol. ePrint Arch. 2025: 1581 (2025) - 2024
- [j1]Hao Lei, Raghvendra Rohit, Guoxiao Liu, Jiahui He, Mohamed Rachidi, Keting Jia, Kai Hu, Meiqin Wang:
Symmetric Twin Column Parity Mixers and Their Applications. IACR Trans. Symmetric Cryptol. 2024(4): 1-37 (2024) - [c4]Jiahui He, Kai Hu, Hao Lei, Meiqin Wang:
Massive Superpoly Recovery with a Meet-in-the-Middle Framework - Improved Cube Attacks on Trivium and Kreyvium. EUROCRYPT (1) 2024: 368-397 - [i5]Jiahui He, Kai Hu, Hao Lei, Meiqin Wang:
Massive Superpoly Recovery with a Meet-in-the-middle Framework - Improved Cube Attacks on Trivium and Kreyvium. IACR Cryptol. ePrint Arch. 2024: 342 (2024) - [i4]Hao Lei, Raghvendra Rohit, Guoxiao Liu, Jiahui He, Mohamed Rachidi, Keting Jia, Kai Hu, Meiqin Wang:
Symmetric Twin Column Parity Mixers and their Applications. IACR Cryptol. ePrint Arch. 2024: 1867 (2024) - 2023
- [c3]Jikang Lin, Jiahui He, Yanhong Fan, Meiqin Wang:
From Unbalanced to Perfect: Implementation of Low Energy Stream Ciphers. AFRICACRYPT 2023: 204-226 - [c2]Hao Lei, Jiahui He, Kai Hu, Meiqin Wang:
More Balanced Polynomials: Cube Attacks on 810- And 825-Round Trivium with Practical Complexities. SAC 2023: 3-21 - [i3]Jikang Lin, Jiahui He, Yanhong Fan, Meiqin Wang:
From Unbalanced to Perfect: Implementation of Low Energy Stream Ciphers. IACR Cryptol. ePrint Arch. 2023: 676 (2023) - [i2]Hao Lei, Jiahui He, Kai Hu, Meiqin Wang:
More Balanced Polynomials: Cube Attacks on 810- and 825-Round Trivium with Practical Complexities. IACR Cryptol. ePrint Arch. 2023: 1237 (2023) - 2022
- [c1]Jiahui He, Kai Hu, Bart Preneel, Meiqin Wang:
Stretching Cube Attacks: Improved Methods to Recover Massive Superpolies. ASIACRYPT (4) 2022: 537-566 - [i1]Jiahui He, Kai Hu, Bart Preneel, Meiqin Wang:
Stretching Cube Attacks: Improved Methods to Recover Massive Superpolies. IACR Cryptol. ePrint Arch. 2022: 1218 (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 2025-11-11 02:32 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:
