全文获取类型
收费全文 | 345篇 |
免费 | 10篇 |
国内免费 | 26篇 |
专业分类
综合类 | 6篇 |
数学 | 140篇 |
物理学 | 20篇 |
综合类 | 215篇 |
出版年
2023年 | 2篇 |
2022年 | 11篇 |
2021年 | 3篇 |
2020年 | 6篇 |
2019年 | 2篇 |
2018年 | 4篇 |
2017年 | 4篇 |
2016年 | 4篇 |
2015年 | 4篇 |
2014年 | 16篇 |
2013年 | 17篇 |
2012年 | 20篇 |
2011年 | 25篇 |
2010年 | 13篇 |
2009年 | 22篇 |
2008年 | 23篇 |
2007年 | 28篇 |
2006年 | 32篇 |
2005年 | 29篇 |
2004年 | 14篇 |
2003年 | 21篇 |
2002年 | 10篇 |
2001年 | 11篇 |
2000年 | 5篇 |
1999年 | 4篇 |
1998年 | 2篇 |
1997年 | 5篇 |
1996年 | 4篇 |
1995年 | 5篇 |
1994年 | 8篇 |
1993年 | 1篇 |
1992年 | 6篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1979年 | 2篇 |
1978年 | 3篇 |
1977年 | 1篇 |
排序方式: 共有381条查询结果,搜索用时 31 毫秒
121.
Subliminal Channels in the NTRU and the Subliminal-Free Methods 总被引:1,自引:0,他引:1
CAI Qingjun ZHANG Yuli 《武汉大学学报:自然科学英文版》2006,11(6):1541-1544
The construetion and destruction of subliminal channel are important problems in the information hiding. The subliminal channel can send secret information without notice. Two subliminal-free methods named weak (strong) subliminal-free on public-key cryptosystem (PKC) are proposed in this paper using the combinatorial method. The first method can only free the subliminal information with any minor probability and the second can free all. Moreover, the "traitor problem" which is same as the model of the subliminal channel in PKC is given. Two subliminal channels are embedded in N-th degree truncated polynomial ring (NTRU) cryptosystem, and their subliminal-free methods are also be obtained by the action of surveillant. 相似文献
122.
123.
Joseph L. Balintfy G. Terry Ross Prabhakant Sinha Andris A. Zoltners 《Mathematical Programming》1978,15(1):63-76
In this paper, the analytical representation of food preference is used in a separable non-linear program to yield the serving frequencies of menu items for a finite time horizon. The frequencies obtained in this way insure cost and nutritional control. Subsequently, the scheduling problem dealing with item assignments to meals and days is formulated as an integer program consisting of several transportation problems linked by weekly nutritional constraints. This problem is solved using a branch and bound algorithm which employs Lagrangian relaxation to obtain bounds and to decide on branching strategy. 相似文献
124.
高海英 《华中科技大学学报(自然科学版)》2008,36(11)
对两个基于多个私钥产生中心的私钥分发协议给出了具体的攻击方法,指出这两个协议都无法抵抗恶意的私钥产生中心的攻击;提出了相应的改进方案,改进方案由用户的秘密参数和私钥产生中心的秘密参数共同生成用户私钥,并且在协议的交互过程中接收方都要验证收到的消息的真实性,从而使恶意的私钥产生中心无法成功得到系统用户的私钥,解决了私钥分发协议存在的用户私钥托管问题;并且对改进方案的安全性和计算复杂度进行了分析. 相似文献
125.
Chosen Ciphertext Attack (CCA) security on the standard model is widely accepted as the standard security notion for the public key cryptosystem. The existing CCA-secure public key cryptosystems on the standard model are expensive in terms of efficiency and practicality. In this paper, an efficient and practical public key cryptosystem is presented over the group of signed quadratic residues. It is provably secure against CCA on the standard model. Furthermore, public verifiability for this scheme is also realized in the way that projects the verification privacy key into public key on trapdoor pretending. It will be useful to devise efficient CCA-secure threshold and proxy re-encryption schemes on the standard model. 相似文献
126.
127.
环签名可以让用户完全匿名地对消息进行签名.迄今为止所有的环签名都基于传统密码体制.然而随着量子计算机的出现,传统密码体制的安全性受到威胁.多变量公钥密码学是一种高效的密码体制,并且有可能成为后量子时代安全的密码体制.提出了一个基于多变量公钥密码体制的环签名方案,该方案满足无条件匿名性,在非适应性选择消息下满足不可为造性,且运算效率高. 相似文献
128.
《河南师范大学学报(自然科学版)》2017,(3)
格在公钥密码分析领域中有着十分重要的地位.1996年,Coppersmith以多项式方程求小值解的问题为桥梁,把攻击RSA密码体制的问题转换为求格中短向量的问题,开辟了基于格的RSA密码分析的研究,他的工作也在后人的简化完善下逐渐形成了Coppersmith方法.一方面,关于基于格的Coppersmith方法,依次介绍了模多项式方程求小值解的方法、整系数多项式方程求小值解的方法、求解近似公共因子问题的方法,还简单描述了除Coppersmith方法外的一种在低维格中寻找最短非零向量的格方法.另一方面,关于RSA密码分析,回顾了小加密指数攻击、小解密指数攻击、部分私钥泄露攻击、求解私钥d与分解模数N的等价性证明、隐式分解问题的分析、素因子部分比特泄露攻击、共模攻击等,并且以Prime Power RSA,Takagi's RSA,CRT-RSA,Common Prime RSA为例,介绍了格方法在RSA密码变体分析中的应用. 相似文献
129.
In this paper, we study the sensitivity of the optimum to perturbations of the weight of a subset of items of both the knapsack problem (denoted KP) and knapsack sharing problem (denoted KSP). The sensitivity interval of the weight associated to an item is characterized by two limits, called lower and upper values, which guarantee the optimality of the solution at hand whenever the new weight’s value belongs to such an interval. For each perturbed weight, we try to establish approximate values of the sensitivity interval whenever the original problem is solved. We do it by applying a dynamic programming method where all established results require a negligible runtime. First, two cases are studied when considering an optimal solution of KP: (i) the case in which all perturbations are (non)negatives and (ii) the general case in which the set of the perturbed items is divided into two disjoint subsets (the first subset contains the nonnegative perturbations and the second one represents the subset of negative perturbations). Second, we show how we can adapt the results of KP to the KSP. All established results require a negligible runtime which grows the interest of such a study. Finally, for each of these problems, we will see the impact of the established results on an example while considering the various cases. 相似文献
130.
Pablo A. Maya Duque Sofie Coene Peter Goos Kenneth Sörensen Frits Spieksma 《European Journal of Operational Research》2013
The accessibility arc upgrading problem (AAUP) is a network upgrading problem that arises in real-life decision processes such as rural network planning. In this paper, we propose a linear integer programming formulation and two solution approaches for this problem. The first approach is based on the knapsack problem and uses the knowledge gathered from an analytical study of some special cases of the AAUP. The second approach is a variable neighbourhood search with strategic oscillation. The excellent performance of both approaches is demonstrated using a large set of randomly generated instances. Finally, we stress the importance of a proper allocation of scarce resources in accessibility improvement. 相似文献