default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuizhen Zhu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Yan Xu, Guizhen Zhu, Huaxiong Wang, Li-Ping Wang:
Large-Plaintext Functional Bootstrapping with Small Parameters for BGV Encoding. ISC (1) 2024: 252-272- 2022
- [j4]Guanglai Guo, Yan Zhu
, E. Chen, Guizhen Zhu, Di Ma, William Cheng-Chung Chu:
Continuous improvement of script-driven verifiable random functions for reducing computing power in blockchain consensus protocols. Peer-to-Peer Netw. Appl. 15(1): 304-323 (2022) - [c7]Yahong Nan, Jun Zhang, Guizhen Zhu:
New Constructions of Paraunitary Matrices for Golay Sequences. IWSDA 2022: 1-5 - 2021
- [j3]E. Chen, Yan Zhu, Guizhen Zhu, Kaitai Liang, Rongquan Feng:
How to implement secure cloud file sharing using optimized attribute-based access control with small policy matrix and minimized cumulative errors. Comput. Secur. 107: 102318 (2021)
2010 – 2019
- 2016
- [j2]Yujuan Li, Guizhen Zhu:
On the error distance of extended Reed-Solomon codes. Adv. Math. Commun. 10(2): 413-427 (2016) - 2015
- [c6]Dan Ding, Guizhen Zhu, Xiaoyun Wang:
A Genetic Algorithm for Searching the Shortest Lattice Vector of SVP Challenge. GECCO 2015: 823-830 - 2014
- [c5]Dan Ding, Guizhen Zhu:
A Random Sampling Algorithm for SVP Challenge Based on y-Sparse Representations of Short Lattice Vectors. CIS 2014: 425-429 - [c4]Dan Ding, Guizhen Zhu, Yang Yu, Zhongxiang Zheng:
A Fast Phase-based Enumeration Algorithm for SVP Challenge Through y y -Sparse Representations of Short Lattice Vectors. ICISC 2014: 101-113 - [c3]Dan Ding, Guizhen Zhu:
A Simulated Annealing Algorithm for SVP Challenge Through y-Sparse Representations of Short Lattice Vectors. INTRUST 2014: 51-69 - [i3]Dan Ding, Guizhen Zhu, Xiaoyun Wang:
A Genetic Algorithm for Searching Shortest Lattice Vector of SVP Challenge. IACR Cryptol. ePrint Arch. 2014: 489 (2014) - [i2]Dan Ding, Guizhen Zhu, Yang Yu, Zhongxiang Zheng:
A Fast Phase-Based Enumeration Algorithm for SVP Challenge through y-Sparse Representations of Short Lattice Vectors. IACR Cryptol. ePrint Arch. 2014: 980 (2014) - 2012
- [j1]Guizhen Zhu, Daqing Wan:
An asymptotic formula for counting subset sums over subgroups of finite fields. Finite Fields Their Appl. 18(1): 192-209 (2012) - [c2]Jianwei Li, Yanbin Pan, Mingjie Liu, Guizhen Zhu:
An efficient broadcast attack against NTRU. AsiaCCS 2012: 22-23 - [c1]Guizhen Zhu, Daqing Wan:
Computing Error Distance of Reed-Solomon Codes. TAMC 2012: 214-224 - 2011
- [i1]Jianwei Li, Yanbin Pan, Mingjie Liu, Guizhen Zhu:
An Efficient Broadcast Attack against NTRU. IACR Cryptol. ePrint Arch. 2011: 590 (2011)
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-01-09 13:17 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:
