Zobrazeno 1 - 10
of 76
pro vyhledávání: '"Chunxiang Gu"'
Publikováno v:
Journal of Cloud Computing: Advances, Systems and Applications, Vol 13, Iss 1, Pp 1-17 (2024)
Abstract Owing to the emergence and rapid advances of new-generation information and digitalization technologies, the concept of model-driven digital twin has received widespread attentions and is developing vigorously. Driven by data and simulators,
Externí odkaz:
https://doaj.org/article/749badd6ab79490abe267303e1bc7590
Publikováno v:
网络与信息安全学报, Vol 7, Pp 93-104 (2021)
Symbolic execution can comprehensively analyze program execution space in theory, but it is not feasible in practice for large programs like security protocols, due to the explosion of path space and the limitation of difficulty in solving path const
Externí odkaz:
https://doaj.org/article/8bf41f354ab9434d886f029ec356fcbd
Publikováno v:
Mathematics, Vol 11, Iss 3, p 766 (2023)
Lattice enumeration is a linear-space algorithm for solving the shortest lattice vector problem (SVP). Extreme pruning is a practical technique for accelerating lattice enumeration, which has a mature theoretical analysis and practical implementation
Externí odkaz:
https://doaj.org/article/c5df3ac42feb4744b8de756d5fd7e85a
Publikováno v:
Tongxin xuebao, Vol 41, Pp 88-97 (2020)
Aiming at the problem that a large number of unknown protocols exist in the Internet,which makes it very difficult to manage and maintain the network security,a classification and identification method of unknown protocols was proposed.Combined with
Externí odkaz:
https://doaj.org/article/07ecea005b9244c7aa68249dda337f4d
Publikováno v:
IEEE Access, Vol 8, Pp 190475-190486 (2020)
As a category of algorithms to solve the shortest lattice vector problem, sieve algorithms have drawn more and more attention due to the prominent performance in recent years. Enumeration algorithms used to perform better in practice even though siev
Externí odkaz:
https://doaj.org/article/b45af6d1e50543ca821da0f429325edc
Publikováno v:
Symmetry, Vol 15, Iss 2, p 355 (2023)
The bounded distance decoding (BDD) is a fundamental problem in lattice-based cryptography which is derived from the closest vector problem (CVP). In this paper, we adapt the lattice enumeration with discrete pruning, a burgeoning method for the shor
Externí odkaz:
https://doaj.org/article/25e3cc93c8434e898c34e3fa7588f760
Publikováno v:
IEEE Access, Vol 7, Pp 171322-171332 (2019)
With the development of Internet of Things (IoT) technology, the demand for secure communication by smart devices has dramatically increased, and the security of the IoT protocol has become the focus of cyberspace. Recently, some scholars have attemp
Externí odkaz:
https://doaj.org/article/8568cf2cee7a43b2aee8b0e215a19ab8
Publikováno v:
Sensors, Vol 21, Iss 24, p 8231 (2021)
With the rapid increase in encrypted traffic in the network environment and the increasing proportion of encrypted traffic, the study of encrypted traffic classification has become increasingly important as a part of traffic analysis. At present, in
Externí odkaz:
https://doaj.org/article/e8c46aefb001462d8d8b4f60edf405a3
Publikováno v:
IEEE Internet of Things Journal. 10:5114-5127
Publikováno v:
IEICE Transactions on Information and Systems. :1172-1184