全文获取类型
收费全文 | 317篇 |
免费 | 79篇 |
国内免费 | 51篇 |
专业分类
电工技术 | 1篇 |
综合类 | 24篇 |
无线电 | 127篇 |
一般工业技术 | 13篇 |
自动化技术 | 282篇 |
出版年
2023年 | 1篇 |
2022年 | 6篇 |
2021年 | 10篇 |
2020年 | 13篇 |
2019年 | 10篇 |
2018年 | 9篇 |
2017年 | 20篇 |
2016年 | 20篇 |
2015年 | 16篇 |
2014年 | 24篇 |
2013年 | 81篇 |
2012年 | 27篇 |
2011年 | 18篇 |
2010年 | 28篇 |
2009年 | 24篇 |
2008年 | 17篇 |
2007年 | 24篇 |
2006年 | 12篇 |
2005年 | 10篇 |
2004年 | 12篇 |
2003年 | 20篇 |
2002年 | 9篇 |
2001年 | 3篇 |
2000年 | 9篇 |
1999年 | 2篇 |
1998年 | 1篇 |
1997年 | 6篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1982年 | 3篇 |
1981年 | 2篇 |
排序方式: 共有447条查询结果,搜索用时 31 毫秒
1.
CRAFT is a tweakable block cipher introduced in 2019 that aims to provide strong protection against differential fault analysis. In this paper, we show that CRAFT is vulnerable to side-channel cube attacks. We apply side-channel cube attacks to CRAFT with the Hamming weight leakage assumption. We found that the first half of the secret key can be recovered from the Hamming weight leakage after the first round. Next, using the recovered key bits, we continue our attack to recover the second half of the secret key. We show that the set of equations that are solvable varies depending on the value of the key bits. Our result shows that 99.90% of the key space can be fully recovered within a practical time. 相似文献
2.
AbstractCryptographic attacks are typically constructed by black-box methods and combinations of simpler properties, for example in [Generalised] Linear Cryptanalysis. In this article, we work with a more recent white-box algebraic-constructive methodology. Polynomial invariant attacks on a block cipher are constructed explicitly through the study of the space of Boolean polynomials which does not have a unique factorisation and solving the so-called Fundamental Equation (FE). Some recent invariant attacks are quite symmetric and exhibit some sort of clear structure, or work only when the Boolean function is degenerate. As a proof of concept, we construct an attack where a highly irregular product of seven polynomials is an invariant for any number of rounds for T-310 under certain conditions on the long term key and for any key and any IV. A key feature of our attack is that it works for any Boolean function which satisfies a specific annihilation property. We evaluate very precisely the probability that our attack works when the Boolean function is chosen uniformly at random. 相似文献
3.
AbstractThe KRYPTOS competition is an annual codebreaking competition for undergraduates. Debuting in 2011 with 49 participants from three states, after nine years we have seen over 1,000 students from 32 states and seven different countries. KRYPTOS will hold its tenth competition in April of 2020. Here we present some of the puzzles participants have found most elusive and challenge you to beat the clock on our fastest solver. 相似文献
4.
Olaf Ostwald 《Cryptologia》2017,41(5):395-421
“Breaking German Army Ciphers” is the title of a Cryptologia article from 2005, describing the lucky survival of several hundred authentic Enigma messages of World War II, and an account of a ciphertext-only cryptanalysis of a large number of these messages, leaving only a few (mostly short messages) unbroken. After reviewing the work done, and investigating the reasons for both lucky breaks and close misses, the modern ciphertext-only attack on Enigma messages is improved, especially on genuine ones with short lengths and/or many garbles. The difficulties of a proper measure for the candidate’s closeness to a plaintext are clarified. The influence on the decryption process of an empty plugboard and one with only a few correct plugs is examined. The method is extended by a partial exhaustion of the plugboard combined with an optimized hillclimbing strategy. The newly designed software succeeds in breaking formerly unbroken messages. 相似文献
5.
John C. King 《Cryptologia》2013,37(3):305-317
A reconstruction of the key used to encrypt B2 (Beale Cipher Number 2) reveals greater statistical anomalies in Bl than previously reported by Gillogly [8]. The 1885 pamphlet versions of the ciphers are used in this analysis. Several explanations of these anomalies are discussed. The application of artificial intelligence techniques to automated cryptanalysis of the Beale Ciphers is discussed. 相似文献
6.
LOUIS KRUH 《Cryptologia》2013,37(1):2-9
Abstract This article presents the original draft of the Zimmermann telegram from 1917 in facsimile. Its various annotations provide interesting insights, such as the idea to promise California to Japan and instructions concerning transmission and encryption. Further documents clarify how the telegram was sent and put various alternatives suggested in the literature to rest. The political background and fallout in Germany are discussed, as well. 相似文献
7.
In this paper, we describe a simplified version of the Advanced Encryption Standard algorithm. This version can be used in the classroom for explaining the Advanced Encryption Standard. After presentation of the simplified version, it is easier for students to understand the real version. This simplified version has the advantage that examples can be worked by hand. We also describe attacks on this version using both linear and differential cryptanalysis. These too can be used in the classroom as a way of explaining those kinds of attacks. 相似文献
8.
9.
J. Rives Childs 《Cryptologia》2013,37(3):201-214
Abstract In this article, we consider an attack on the SIGABA cipher under the assumption that the largest practical keyspace is used. The attack highlights various strengths and weaknesses of SIGABA and provides insight into the inherent level of security provided by the cipher. 相似文献
10.
文章对马华等人基于RSA加密算法的叛逆者追踪方案进行分析后,发现该方案存在一个明显的漏洞,并引入随机数解决了存在的问题。通过对何新华等人基于离散对数困难问题的无废除门限的公钥叛逆者追踪方案的分析,发现该方案实际上仍受到废除门限的限制,也就是被撤消的用户数仍不能超过废除门限。 相似文献