全文获取类型
收费全文 | 346篇 |
免费 | 95篇 |
国内免费 | 1篇 |
专业分类
化学 | 9篇 |
力学 | 1篇 |
综合类 | 12篇 |
数学 | 47篇 |
物理学 | 373篇 |
出版年
2024年 | 2篇 |
2023年 | 4篇 |
2022年 | 47篇 |
2021年 | 28篇 |
2020年 | 17篇 |
2019年 | 6篇 |
2018年 | 3篇 |
2017年 | 32篇 |
2016年 | 14篇 |
2015年 | 17篇 |
2014年 | 39篇 |
2013年 | 28篇 |
2012年 | 22篇 |
2011年 | 31篇 |
2010年 | 23篇 |
2009年 | 24篇 |
2008年 | 25篇 |
2007年 | 16篇 |
2006年 | 13篇 |
2005年 | 13篇 |
2004年 | 9篇 |
2003年 | 10篇 |
2002年 | 2篇 |
2001年 | 4篇 |
2000年 | 1篇 |
1999年 | 1篇 |
1998年 | 6篇 |
1997年 | 4篇 |
1992年 | 1篇 |
排序方式: 共有442条查询结果,搜索用时 31 毫秒
271.
The design of the new compound two-dimensional chaotic function is presented by exploiting two one-dimensional chaotic functions which switch randomly, and the design is used as a chaotic sequence generator which is proved by Devaney’s definition proof of chaos. The properties of compound chaotic functions are also proved rigorously. In order to improve the robustness against difference cryptanalysis and produce avalanche effect, a new feedback image encryption scheme is proposed using the new compound chaos by selecting one of the two one-dimensional chaotic functions randomly and a new image pixels method of permutation and substitution is designed in detail by array row and column random controlling based on the compound chaos. The results from entropy analysis, difference analysis, statistical analysis, sequence randomness analysis, cipher sensitivity analysis depending on key and plaintext have proven that the compound chaotic sequence cipher can resist cryptanalytic, statistical and brute-force attacks, and especially it accelerates encryption speed, and achieves higher level of security. By the dynamical compound chaos and perturbation technology, the paper solves the problem of computer low precision of one-dimensional chaotic function. 相似文献
272.
运用重模多项式理论,设计了密钥控制下的重模多项式矩阵环上的可逆矩阵加密新算法,算法具备很好的抵抗现有攻击的性能,有很好的应用前景. 相似文献
273.
对一种超混沌图像加密算法及其改进版进行了安全性分析, 结果表明该类算法的置乱过程都是与混淆过程相脱离的, 且混淆过程的加密公式简单; 因此都不能抵抗选择明文和选择密文攻击. 进而提出了一种改进的加强型超混沌图像加密算法; 改进算法包含两轮像素值替代加密操作, 并使得密文与明文、密钥之间的关系更复杂. 安全性分析和实验测试表明, 改进算法不仅克服了原算法不能抵御选择明文和选择密文攻击的缺陷; 而且具有时间开销更小和抗差分攻击性能更好的优势. 相似文献
274.
该文提出了一种新的基于第二代电流传输器(CCII)的网格多涡卷混沌吸引子产生器,用于物理混沌加密和高级加密标准(AES)加密的混合图像加密算法.因CCII比普通运放有更好的频率特性和更大的动态范围,能产生频率更高,动力学特性更复杂的多涡卷物理混沌信号.基于CCII的多涡卷物理混沌加密和AES加密的混合加密系统。不存在确定的明文密文映射关系,密文统计特性也应优于其他加密系统.基于该算法研究了混合加密和单级加密的抗统计分析能力,以及涡卷数目不同的混沌信号在该算法中应用时密文统计特性的不同.完成了基于CCII的混沌电路设计与硬件实现,对加密系统进行了数值仿真,仿真结果与理论分析一致,同时表明涡卷数目越多的混沌系统其加密产生的密文相关性越弱. 相似文献
275.
The wireless sensor network (WSN) has been widely used in various fields, but it still remains in the preliminary discovery and research phase with a lack of various related mature technologies. Traditional encryption schemes are not suitable for wireless sensor networks due to intrinsic features of the nodes such as low energy, limited computation capability, and lack of storage resources. In this paper, we present a novel block encryption scheme based on the integer discretization of a chaotic map, the Feistel network structure, and an S-box. The novel scheme is fast, secure, has low resource consumption and is suitable for wireless sensor network node encryption schemes. The experimental tests are carried out with detailed analysis, showing that the novel block algorithm has a large key space, very good diffusion and disruptive performances, a strict avalanche effect, excellent statistical balance, and fast encryption speed. These features enable the encryption scheme to pass the SP800-22 test. Meanwhile, the analysis and the testing of speed, time, and storage space on the simulator platform show that this new encryption scheme is well able to hide data information in wireless sensor networks. 相似文献
276.
In this paper, we present the results for the security and the possible attacks on a new symmetric key encryption algorithm based on the ergodicity property of a logistic map. After analysis, we use mathematical induction to prove that the algorithm can be attacked by a chosen plaintext attack successfully and give an example to show how to attack it. According to the cryptanalysis of the original algorithm, we improve the original algorithm, and make a brief cryptanalysis. Compared with the original algorithm, the improved algorithm is able to resist a chosen plaintext attack and retain a considerable number of advantages of the original algorithm such as encryption speed, sensitive dependence on the key, strong anti-attack capability, and so on. 相似文献
277.
278.
Savvas A. Chatzichristofis Dimitris A. Mitzias Yiannis S. Boutalis 《Optics Communications》2010,283(21):4250-4260
This paper proposes a new method for visual multimedia content encryption using Cellular Automata (CA). The encryption scheme is based on the application of an attribute of the CLF XOR filter, according to which the original content of a cellular neighborhood can be reconstructed following a predetermined number of repeated applications of the filter.The encryption is achieved using a key image of the same dimensions as the image being encrypted. This technique is accompanied by the one-time pad (OTP) encryption method, rendering the proposed method reasonably powerful, given the very large number of resultant potential security keys. The method presented here makes encryption possible in cases where there is more than one image with the use of just one key image. A further significant characteristic of the proposed method is that it demonstrates how techniques from the field of image retrieval can be used in the field of image encryption. The proposed method is further strengthened by the fact that the resulting encrypted image for a given key image is different each time. The encryption result depends on the structure of an artificial image produced by the superposition of four 1-D CA time-space diagrams as well as from a CA random number generator.A semi-blind source separation algorithm is used to decrypt the encrypted image. The result of the decryption is a lossless representation of the encrypted image. Simulation results demonstrate the effectiveness of the proposed encryption method. The proposed method is implemented in C# and is available online through the img(Rummager) application. 相似文献
279.
Given a communication network (modelled as a graph), a message is transmitted to at one vertex transmits to all other vertices in such a way that each message transmission takes one time unit and each vertex participates in at most one transmission to its neighbor per time step. We call this process broadcasting. For t≥0, let Bt(n) be the number of edges in the sparsest possible graph on n vertices in which broadcasting can be accomplished in ⌈log2n⌉+t steps regardless of the originator. Shastri [A. Shastri, Time-relaxed broadcasting in communication networks, Discrete Applied mathematics 83 (1998) 263-278] conjectured that B1(22)=24 and B2(n)=n+1 for 25≤n≤29. In this paper, we show that B1(22)=24, B2(n)=n for 25≤n≤28 and 37≤n≤44, B2(n)≤n+1 for 45≤n≤49, B2(n)≤n+4 for 50≤n≤56, and B3(n)=n for 55≤n≤64. 相似文献
280.