全文获取类型
收费全文 | 1252篇 |
免费 | 206篇 |
国内免费 | 18篇 |
专业分类
化学 | 70篇 |
晶体学 | 2篇 |
力学 | 62篇 |
综合类 | 16篇 |
数学 | 44篇 |
物理学 | 129篇 |
无线电 | 1153篇 |
出版年
2024年 | 4篇 |
2023年 | 26篇 |
2022年 | 44篇 |
2021年 | 52篇 |
2020年 | 60篇 |
2019年 | 43篇 |
2018年 | 42篇 |
2017年 | 59篇 |
2016年 | 63篇 |
2015年 | 75篇 |
2014年 | 119篇 |
2013年 | 89篇 |
2012年 | 94篇 |
2011年 | 99篇 |
2010年 | 79篇 |
2009年 | 66篇 |
2008年 | 98篇 |
2007年 | 76篇 |
2006年 | 58篇 |
2005年 | 48篇 |
2004年 | 48篇 |
2003年 | 31篇 |
2002年 | 22篇 |
2001年 | 11篇 |
2000年 | 22篇 |
1999年 | 12篇 |
1998年 | 3篇 |
1997年 | 6篇 |
1996年 | 7篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 3篇 |
1992年 | 4篇 |
1991年 | 3篇 |
1990年 | 1篇 |
1984年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有1476条查询结果,搜索用时 0 毫秒
21.
针对ZigBee通信中易遭受同频攻击导致数据阻塞和失真问题,该文提出一种同频攻击检测模型。该模型利用信号频谱的高斯分布规律和同频攻击对变换域幅值的影响进行同频攻击检测。在此基础上,通过嵌入空闲频带信道跳变机制和基于可变退避周期及接入概率的自适应退避算法,给出了同频攻击检测抑制方案。实验结果表明,该文模型和方案可以有效抵御同频攻击。 相似文献
22.
23.
GIFT,a lightweight block cipher proposed at CHES2017,has been widely cryptanalyzed this years.This paper studies the differential diffusion characteristics of round function of GIFT at first,and proposes a random nibble-based differential fault attack.The key recovery scheme is developed on the statistical properties we found for the differential distribution table of the S-box.A lot of experiments had been done and experimental results show that one round key can be retrieved with an average of 20.24 and 44.96 fault injections for GIFT-64 and GIFT-128 respectively.Further analysis shows that a certain number of fault injections recover most key bits.So we demonstrate an improved fault attack combined with the method of exhaustive search,which shows that the master key can be recovered by performing 216 and 217 computations and injecting 31 and 32 faults on an average for GIFT-64 and GIFT-128 respectively. 相似文献
24.
文中对基于双线性对提出的可验证无证书环签密方案的安全性进行了密码分析,指出该方案不能抵抗替换公钥攻击,并给出了一种攻击方法,攻击者利用该攻击可以任意选定一组用户构成一个环对任意选择的消息进行环签密,密文可以顺利通过验证并正确解密,得出该方案是不安全的. 相似文献
25.
KeeLoq密码是由Willem Smit设计的分组密码算法,广泛应用于汽车的无线门锁装置。Courtois等人在2007年提出了破译KeeLoq的4种滑动-代数攻击方法,其中第4种滑动-代数攻击方法的计算复杂性最小。本文证明了Courtois的第4种滑动-代数攻击方法的攻击原理是错误的,因而无法实现对KeeLoq的破译。此外,本文还对该方法进行了修正,提出了改进的攻击方法,利用232个已知明文能够以O(248) 次加密的计算复杂性求出KeeLoq密码的密钥,成功率为1。对于KeeLoq密码26%的密钥,其连续64圈圈函数形成的复合函数至少具有两个不动点,此时改进的攻击方法的计算复杂性还可降至O(248) 次加密。 相似文献
26.
27.
28.
Xue-qiang ZOU Peng ZHANG Cai-yun HUANG Zhi-peng CHEN Yong SUN Qing-yun LIU 《通信学报》2016,37(Z1):116-124
Based on the similarity of the layout structure between the phishing sites and real sites,an approach to discover phishing sites was presented.First,the tag with link attribute as a feature was extracted,and then based on the feature,the page tag sequence branch to identify website was extracted,followed by the page layout similarity-HTMLTagAntiPhish,the alignment of page tag sequence tree into the alignment of page tag sequence branches was converted,this converted two-dimention tree structure into one-dimention string structure,and finally through the substitution matrix of bioinfor-matics BLOSUM62 coding,alignment score quickly to improve the phishing sites detection efficiency was computed.A series of simulation experiments show that this approach is feasible and has higher precision and recall rates. 相似文献
29.
HTML5 application cache (AppCache) allowed Web browser to access Web offline.But it also brought a new method of cache poisoning attack that was more persisting.As for websites which used the AppCache,a novel poisoning method RFTM (replace file twice method),in which the attacker replaced the manifest file twice to poison the client’s AppCache,was proposed.Compared with the original attack,the legal server would not receive abnormal HTTP requests from the client in the attack.Therefore,changing the server configuration could not prevent the client from the RFTM AppCache poisoning.To avoid the attack mentioned above,a lightweight signature defense scheme Sec-Cache in application layer was designed.Furthermore,experiments show that it has good performance and compatibility. 相似文献
30.
The Grover's a1gorithm was used for fau1t attack against the pub1ic key cryptography.A fixed phase rotation based Grover's a1gorithm was proposed,and the probabi1ity of success achieved 99.23% with 0.1π phase rotation.Combined with the fau1t attack further,ECC(e11iptic curve cryptography)vo1tage burr attack a1gorithm based on Grover a1gorithm with 0.1π phase rotation was proposed.Then a safety Kob1itz curve,K-163,pub1ished successfu11y attacked by NIST on binary domain in simu1ation and the success rate was 100%.The comp1exity of the attack great1y reduces on the exponentia1.It was a new effective way,except the Shor's a1gorithm,to attack pub1ic key cryptography by quantum computing,and it contributed to extend the attack ways to the other pub1ic key cryptography. 相似文献