首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   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条查询结果,搜索用时 15 毫秒
401.
张立民  孙克辉  刘文浩  贺少波 《中国物理 B》2017,26(10):100504-100504
In this paper, Adomian decomposition method(ADM) with high accuracy and fast convergence is introduced to solve the fractional-order piecewise-linear(PWL) hyperchaotic system. Based on the obtained hyperchaotic sequences,a novel color image encryption algorithm is proposed by employing a hybrid model of bidirectional circular permutation and DNA masking. In this scheme, the pixel positions of image are scrambled by circular permutation, and the pixel values are substituted by DNA sequence operations. In the DNA sequence operations, addition and substraction operations are performed according to traditional addition and subtraction in the binary, and two rounds of addition rules are used to encrypt the pixel values. The simulation results and security analysis show that the hyperchaotic map is suitable for image encryption, and the proposed encryption algorithm has good encryption effect and strong key sensitivity. It can resist brute-force attack, statistical attack, differential attack, known-plaintext, and chosen-plaintext attacks.  相似文献   
402.
郭绪坤  康显桂 《应用声学》2017,25(5):150-154
针对相位截断加密算法无法抵御信息泄露问题,文章提出了一种基于相位截断菲涅耳变换与随机振幅掩模的加密算法,以抵御信息泄露问题;算法首先将原彩色图像分为3个独立的颜色通道,在对其进行菲涅耳变换后加入随机振幅掩模通道,将4个通道分别进行菲涅耳衍射截断处理;算法通过级联处理不仅提高了秘钥与密文间的关联性,还消除了信息泄露的风险;通过仿真试验与结果分析可知,本算法不仅在波长与自由空间传播错误距离参数、密文噪声、遮挡污染、密文泄露以及不同攻击等情况下有较好的鲁棒性,还解决了信息泄露问题。  相似文献   
403.
网络信息安全中DES数据加密技术研究   总被引:1,自引:0,他引:1  
赵彩  丁凰 《应用声学》2017,25(8):49-49
网络信息安全关系到数据存储安全和数据通信安全,为了提高网络信息安全管理能力,需要进行数据优化加密设计,提出一种基于前向纠错编码的DES数据公钥加密技术,采用Gram-Schmidt正交化向量量化方法构建DES数据的Turbo码模型,通过三次重传机制产生密文序列,对密文序列进行前向纠错编码设计,结合差分演化方法进行频数检验,实现网络信息安全中DES数据加密密钥构造,选择二进制编码的公钥加密方案有效抵抗密文攻击。仿真结果表明,采用该加密技术进行DES数据加密的抗攻击能力较强,密钥置乱性较好,具有很高的安全性和可行性。  相似文献   
404.
王佳  俞信  赵磊 《光学技术》2005,31(6):935-938
利用Mie散射理论分析论证了自由空间光通信传输的光信号在信道外被截获的可能性。提出了两种适于自由空间光通信图像保密通信的方法,并对这两种方法的性能进行了比较。设计并研制了实验系统。利用所提出的方法实现了自由空间光通信的图像保密传输。  相似文献   
405.
柴秀丽  甘志华  路杨  张苗辉  陈怡然 《中国物理 B》2016,25(10):100503-100503
Recently, many image encryption algorithms based on chaos have been proposed. Most of the previous algorithms encrypt components R, G, and B of color images independently and neglect the high correlation between them. In the paper, a novel color image encryption algorithm is introduced. The 24 bit planes of components R, G, and B of the color plain image are obtained and recombined into 4 compound bit planes, and this can make the three components affect each other. A four-dimensional(4D) memristive hyperchaotic system generates the pseudorandom key streams and its initial values come from the SHA 256 hash value of the color plain image. The compound bit planes and key streams are confused according to the principles of genetic recombination, then confusion and diffusion as a union are applied to the bit planes,and the color cipher image is obtained. Experimental results and security analyses demonstrate that the proposed algorithm is secure and effective so that it may be adopted for secure communication.  相似文献   
406.
A new optical image watermarking technique based on compressive sensing using joint Fresnel transform correlator architecture has been presented. A secret scene or image is first embedded into a host image to perform optical image watermarking by use of joint Fresnel transform correlator architecture. Then, the watermarked image is compressed to much smaller signal data using single-pixel compressive holographic imaging in optical domain. At the received terminal, the watermarked image is reconstructed well via compressive sensing theory and a specified holographic reconstruction algorithm. The preliminary numerical simulations show that it is effective and suitable for optical image security transmission in the coming absolutely optical network for the reason of the completely optical implementation and largely decreased holograms data volume.  相似文献   
407.
To improve encryption efficiency and facilitate the secure transmission of multiple digital images, by defining the pure image element and mixed image element, this paper presents a new multiple-image encryption (MIE) algorithm based on the mixed image element and permutation, which can simultaneously encrypt any number of images. Firstly, segment the original images into pure image elements; secondly, scramble all the pure image elements with the permutation generated by the piecewise linear chaotic map (PWLCM) system; thirdly, combine mixed image elements into scrambled images; finally, diffuse the content of mixed image elements by performing the exclusive OR (XOR) operation among scrambled images and the chaotic image generated by another PWLCM system. The comparison with two similar algorithms is made. Experimental results and algorithm analyses show that the proposed MIE algorithm is very simple and efficient, which is suitable for practical image encryption.  相似文献   
408.
This paper provides an exposition of methods by which a trusted authority can distribute keys and/or broadcast a message over a network, so that each member of a privileged subset of users can compute a specified key or decrypt the broadcast message. Moreover, this is done in such a way that no coalition is able to recover any information on a key or broadcast message they are not supposed to know. The problems are studied using the tools of information theory, so the security provided is unconditional (i.e., not based on any computational assumption).We begin by surveying some useful schemes for key distribution that have been presented in the literature, giving background and examples (but not too many proofs). In particular, we look more closely at the attractive concept of key distribution patterns, and present a new method for making these schemes more efficient through the use of resilient functions. Then we present a general approach to the construction of broadcast schemes that combines key predistribution schemes with secret sharing schemes. We discuss the Fiat-Naor Broadcast Scheme, as well as other, new schemes that can be constructed using this approach.  相似文献   
409.
In this paper we propose an encryption/decryption technique of gray-level image information using an on-axis 2-f digital holographic optical encrypting system with two-step phase-shifting method. This technique reduces the number of holograms in phase-shifting digital holography and minimizes the setup of the encryption system more than multistep phase-shifting technique. We are able to get the complete decrypted image by controlling the K-ratio which is defined as the reference beam intensity versus the object beam intensity. We remove the DC-term of the phase-shifting digital hologram to reconstruct and decrypt the original image information. Simulation results show that the proposed method can be used for encryption and decryption of a 256 gray-level image. Also, the result shows some errors of the decrypted image according to K-ratio.  相似文献   
410.
In practical optical security systems we must consider various circumstances for reading and decrypting encrypted holograms. Binarization of the hologram is best suited for such applications because of the ease of handling encrypted data. However, the decrypted image is greatly degraded by binarization. Therefore, optimization of a binary hologram is essential in using such a technique. In this paper, we propose a fast optimization method of a binary encrypted hologram to obtain a good reconstruction based on the error correction algorithm. In the proposed method, multiple pixels of the binary hologram are simultaneously flipped for the optimization according to the priority for the correction. The time for the optimization is only 3% of that of the simulated annealing method.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号