期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到5篇文章
< 1 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
INTEGRAL DISTINGUISHERS OF JH AND GRSTL-512 认领 引用 被引量：3
1
作者 LiYanjun WuWenling DongLe 《Journal of Electronics(China)》 2012年第1期94-102,共9页
In December of 2010 NIST selected five SHA-3 finalists - BLAKE, Grcstl, JH, Keccak, and Skein to advance to the third （and final） round of the SHA-3 competition. At present most specialists and scholars focus on the... In December of 2010 NIST selected five SHA-3 finalists - BLAKE, Grcstl, JH, Keccak, and Skein to advance to the third （and final） round of the SHA-3 competition. At present most specialists and scholars focus on the design and the attacks on these hash functions. However, it is very significant to study some properties of their primitives and underlying permutations. Because some properties reflect the pseudo-randomness of the structures. Moreover, they help us to find new cryptanalysis for some block cipher structures. In this paper, we analyze the resistance of JH and Grcstl-512 against structural properties built on integral distinguishers. And then 31.5 （out of 42） rounds integral distinguishers for JH compression function and 11.5 （out of 14） rounds for Grcstl-512 compression function are presented. 展开更多
关键词 Hash function SHA-3 candidates Integral distinguisher JH Grcstl
暂未订购 下载PDF
An Additive Problem with Primes in Arithmetic Progressions 认领 引用
2
作者 ZhenFengZHANG 《Acta Mathematica Sinica,English Series》 SCIE 2005年第1期155-168,共14页
In this paper, we extend a classical result of Hua to arithmetic progressionswith large moduli. The result implies the Linnik Theorem on the least prime in an arithmeticprogression.
关键词 Additive problem Prime Arithmetic progression Circle method
暂未订购 下载PDF
New Semantic Model for Authentication Protocols in ASMs 认领 引用 被引量：5
3
作者 RuiXue Deng-GuoFeng 《Journal of Computer Science & Technology》 SCIE EI 2004年第4期555-563,共9页
A new semantic model in Abstract State Model (ASM) for authentication protocols is presented. It highlights the Woo-Lam's ideas for authentication, which is the strongest one in Lowe's definition hierarchy for... A new semantic model in Abstract State Model (ASM) for authentication protocols is presented. It highlights the Woo-Lam's ideas for authentication, which is the strongest one in Lowe's definition hierarchy for entity authentication. Apart from the flexible and natural features in forming and analyzing protocols inherited from ASM, the model defines both authentication and secrecy properties explicitly in first order sentences as invariants. The process of proving security properties with respect to an authentication protocol blends the correctness and secrecy properties together to avoid the potential flaws which may happen when treated separately. The security of revised Helsinki protocol is shown as a case study. The new model is different from the previous ones in ASMs. 展开更多
关键词 cryptographic protocol formal analysis abstract state machine (ASM) authentication protocol
暂未订购 下载PDF
The Internet accessible mathematical computation framework 认领 引用
4
作者 PaulS.Wang SimonGray +3 位作者 NorbertKajler DongdaiLin WeidongLiao XiaoZou 《Science in China(Series F)》 2004年第1期75-88,共14页
The Internet Accessible Mathematical Computation (IAMC) framework aims to make it easy to supply mathematical computing powers over the Internet/Web. The protocol-based IAMC framework enables developers to create inte... The Internet Accessible Mathematical Computation (IAMC) framework aims to make it easy to supply mathematical computing powers over the Internet/Web. The protocol-based IAMC framework enables developers to create interoperable clients and servers easily and independently. Presented are conceptual and experimental work on the IAMC framework architecture and major components: the Mathematical Computation Protocol (MCP), a client prototype (Dragonfly), a server prototype (Starfish), a mathematical encoding converter (XMEC), and an open mathematical compute engine interface (OMEI). 展开更多
关键词 Internet accessible mathematical computation mathematical computation protocol open mathematical engine interface MathML OpenMath.
Collision attack on reduced-round Camellia 认领 引用 被引量：11
5
作者 WUWenling FENGDengguo 《Science in China(Series F)》 2005年第1期78-90,共13页
Camellia is the final winner of 128-bit block cipher in NESSIE. In this paper, we construct some efficient distinguishers between 4-round Camellia and a random permutation of the blocks space. By using collision-searc... Camellia is the final winner of 128-bit block cipher in NESSIE. In this paper, we construct some efficient distinguishers between 4-round Camellia and a random permutation of the blocks space. By using collision-searching techniques, the distinguishers are used to attack on 6, 7, 8 and 9 rounds of Camellia with 128-bit key and 8, 9 and 10 rounds of Camellia with 192/256-bit key. The 128-bit key of 6 rounds Camellia can be recovered with 210 chosen plaintexts and 215 encryptions. The 128-bit key of 7 rounds Camellia can be recovered with 212 chosen plaintexts and 254.5 encryptions. The 128-bit key of 8 rounds Camellia can be recovered with 213 chosen plaintexts and 2112.1 encryptions. The 128-bit key of 9 rounds Camellia can be recovered with 2113.6 chosen plaintexts and 2121 encryptions. The 192/256-bit key of 8 rounds Camellia can be recovered with 213 chosen plaintexts and 2111.1 encryptions. The 192/256-bit key of 9 rounds Camellia can be recovered with 213 chosen plaintexts and 2175.6 encryptions. The 256-bit key of 10 rounds Camellia can be recovered with 214 chosen plaintexts and 2239.9 encryptions. 展开更多
关键词 block cipher collision attack key data complexity time complexity.
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈