全文获取类型
收费全文 | 1738篇 |
免费 | 16篇 |
国内免费 | 37篇 |
专业分类
系统科学 | 21篇 |
丛书文集 | 69篇 |
教育与普及 | 33篇 |
理论与方法论 | 17篇 |
现状及发展 | 15篇 |
综合类 | 1636篇 |
出版年
2024年 | 7篇 |
2023年 | 8篇 |
2022年 | 19篇 |
2021年 | 21篇 |
2020年 | 17篇 |
2019年 | 16篇 |
2018年 | 9篇 |
2017年 | 18篇 |
2016年 | 24篇 |
2015年 | 49篇 |
2014年 | 107篇 |
2013年 | 117篇 |
2012年 | 118篇 |
2011年 | 136篇 |
2010年 | 134篇 |
2009年 | 144篇 |
2008年 | 136篇 |
2007年 | 125篇 |
2006年 | 154篇 |
2005年 | 108篇 |
2004年 | 93篇 |
2003年 | 93篇 |
2002年 | 60篇 |
2001年 | 33篇 |
2000年 | 30篇 |
1999年 | 4篇 |
1998年 | 4篇 |
1997年 | 3篇 |
1996年 | 1篇 |
1995年 | 3篇 |
排序方式: 共有1791条查询结果,搜索用时 0 毫秒
81.
信息安全与“三金工程” 总被引:3,自引:0,他引:3
赵战生 《科技导报(北京)》1995,(4):29-32,11
信息安全与“三金工程”InformationSecurityandChina'sInformationEngineering¥//赵战生(中国科学技术大学研究生院信息安全国家重点实验室,教授北京100039)一、“三金工程”可能受到的信息安全威胁由金... 相似文献
82.
信息安全关系到经济发展、国家安全和社会稳定,关系到政府工作的正常运转。电子政务信息安全防范是电子政务建设的关键,本文对此进行了分析探讨。 相似文献
83.
WUZhi-ping YEDing-feng MAWei-ju 《武汉大学学报:自然科学英文版》2005,10(1):259-262
Algebraic attack was applied to attack Filter-Combiner model keystream generators. We proposed thetechnique of function composition to improve the model, and the improved model can resist the algebraic attack. A new criterion for designing Filter-Combiner model was also proposed: the total length L of Linear Finite State Machines used in the model should be large enough and the degree d of Filter-Combiner function should be approximate [L/2]. 相似文献
84.
在现有信息安全体系模型的基础上提出一种新的信息安全模型——动态综合信息安全模型。该模型综合了其它模型的优点,可以用于指导企业合理、有效地利用各种现有的技术和非技术因素,建立可靠的安全防护体系,提高企业资源的安全性和抗风险能力,它适合于安全防护工程的整个过程,尤其是大型的、复杂的项目。 相似文献
85.
针对目前校园网上的各种信息安全隐患,深入分析产生这些网络安全问题的根源,运用实践经验,全方位地提出构建高效安全校园网的具体措施,详尽地介绍了解决校园网信息安全的做法,使校园网建成一个安全、稳定、高效的网络系统。 相似文献
86.
87.
WANG Xiaofei HONG Fan~ TANG Xueming CUI Guohua College of Computer Science Technology Huazhong University of Science Technology Wuhan Hubei China 《武汉大学学报:自然科学英文版》2006,11(6):1467-1472
0 IntroductionDigital signatureis a key technique to provide datainteg-rity andsource authenticationcapabilities to enhance da-ta trustworthiness in trusted computing platform. Most cur-rent digital signature schemes are based on complex mathe-matical problems , such as integer factoring, discrete log-arithm,and discrete logarithm on elliptic curves . The hard-ness of these underlying mathematical problems is really un-certain at present . Merkle treeis a method used for authenti-cation and di… 相似文献
88.
SU Li CUI Guohua YANG Muxiang CHEN Jing 《武汉大学学报:自然科学英文版》2006,11(6):1485-1488
The subliminal channel is used to send a secret message to an authorized receiver; the message cannot he discovered by any unauthorized receivers. Designated verifier signature (DVS) provide authentication of a message, we design a DVS scheme with message recovery mechanism and use it as a subliminal channel. In order to share a message among n users securely and allows t or more users can reconstruct the secret in dynamic groups, we combine both subliminal channel and (t, n) threshold cryptography. Then we proposed a threshold subliminal channel which can convey a subliminal message to a group of users based on message-recovery designated verifier signatures. Reconstructing the subliminal message relies on the cooperation of t or more users in the group and they can verify the validity of the subliminal message. Security and performance analysis show that the proposed scheme is secure and efficient. 相似文献
89.
WANG Hui LIU Shufen ZHANG Xinjia 《武汉大学学报:自然科学英文版》2006,11(6):1498-1502
This paper presents a novel probability generation algorithm to predict attacks from an insider who exploits known system vulnerabilities through executing authorized operations. It is different from most intrusion detection systems (IDSs) because these IDSs are inefficient to resolve threat from authorized insiders. To deter cracker activities, this paper introduces an improved structure of augmented attack tree and a notion of "minimal attack tree", and proposes a new generation algorithm of minimal attack tree. We can provide a quantitative approach to help system administrators make sound decision. 相似文献
90.
ZHU Fengxiang QI Wenfeng 《武汉大学学报:自然科学英文版》2006,11(6):1549-1553
The k-error linear complexity and the linear complexity of the keystream of a stream cipher are two important standards to scale the randomness of the key stream. For a pq^n-periodic binary sequences where p, q are two odd primes satisfying that 2 is a primitive root module p and q^2 and gcd(p-1, q-1) = 2, we analyze the relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity. 相似文献