Simon
Simon的相关文献在1982年到2022年内共计217篇,主要集中在无线电电子学、电信技术、自动化技术、计算机技术、建筑科学
等领域,其中期刊论文212篇、专利文献5篇;相关期刊135种,包括科技新时代、石油炼制与化工、计算机网络世界等;
Simon的相关文献由183位作者贡献,包括Adel Kalboussi、崔好青、张恩霞等。
Simon
-研究学者
- Adel Kalboussi
- 崔好青
- 张恩霞
- 戴金
- 王曦
- Amine Touati
- Nabil Sghaier
- Samir Chatbouri
- 关杰
- 刘忠立
- 周荃(审)
- 庞晓华
- 张会红
- 张国强
- 张正选
- 张永强
- 张章
- 张跃军
- 易万兵
- 李斌
- 王韬
- 程心
- 金波
- 陈浩
- 陈猛
- 陈鑫辉
- 陈静
- 马云飞
- Andreas Kasper
- Aram Saeed
- Bernd
- Bilel Hafsi
- Christopher Chafin
- Daniel Simon(图)
- Dilek Bolcan
- Guy Van Marcke
- Helen
- Holly(编译)
- H·考尔
- James E. Evans
- Jasmin
- Jason Barlow
- Jingyuan ZHAO
- Joyce
- J·G·山德里
- J·沃克
- Keting JIA
- M·A·安德斯
- Ning WANG
- Pershing Yachts(图)
-
-
谭明敏;
柏建岭;
陈峰;
杨旻;
仲子航;
于全骥;
于朝雷;
周佳薇;
倪森淼;
蔡丽馨;
于浩
-
-
摘要:
目的 探讨贝叶斯方法和Simon二阶段方法应用于篮子试验设计的优劣及实例分析判断试验疗效.方法 模拟研究针对二分类结局变量,考虑不同试验层数、期中分析纳入人数等参数设置,比较两种方法的篮子试验设计在检验效能、控制I错误率及样本量的区别,并通过实例来介绍其应用.结果 模拟试验结果表明,除异质性较高的2种情景外,贝叶斯方法的篮子试验设计效能均高于应用Simon二阶段方法,且对假阳性率控制更为严格,代价便是无效篮子增多时检验效能降低.贝叶斯方法的篮子试验的样本量总体较少,尤其在试验层数较多和同质情况下.结论 贝叶斯方法的篮子试验更加灵活,可借用层间信息,相比Simon二阶段方法,更严格地控制整体一类错误率,且在试验层数和期中分析次数多时更节省平均总样本量.
-
-
-
Xiaoyang DONG1;
Zheng LI2;
Xiaoyun WANG12
-
-
摘要:
Post-quantum cryptography has attracted much attention from worldwide cryptologists.In ISIT 2010,Kuwakado and Morii gave a quantum distinguisher with polynomial time against 3-round Feistel networks.However,generalized Feistel schemes(GFS)have not been systematically investigated against quantum attacks.In this paper,we study the quantum distinguishers about some generalized Feistel schemes.For d-branch Type-1 GFS(CAST256-like Feistel structure),we introduce(2d-1)-round quantum distinguishers with polynomial time.For 2d-branch Type-2 GFS(RC6/CLEFIA-like Feistel structure),we give(2d + 1)-round quantum distinguishers with polynomial time.Classically,Moriai and Vaudenay proved that a7-round 4-branch Type-1 GFS and 5-round 4-branch Type-2 GFS are secure pseudo-random permutations.Obviously,they are no longer secure in quantum setting.Using the above quantum distinguishers,we introduce generic quantum key-recovery attacks by applying the combination of Simon’s and Grover’s algorithms recently proposed by Leander and May.We denote n as the bit length of a branch.For(d^2-d + 2)-round Type-1 GFS with d branches,the time complexity is 2(1/2d^2-3/2d+2)·n/2,which is better than the quantum brute force search(Grover search)by a factor 2(1/4d^2+1/4d)n.For 4d-round Type-2 GFS with d2 branches,the time complexity is 2((d^2n)/2(,which is better than the quantum brute force search by a factor 2(3d^2n)/2.
-
-
艾普丽;
Pershing Yachts(图)
-
-
摘要:
因为Fuivio De Simoni设计的独特外观,在水面上认出一艘博星游艇非常简单,就像只听前奏就能猜到你最熟悉的那首歌。轻快与犀利“博星游艇从来没有经典或者保守的风格,这不是船厂想要的,”De Simoni说,“她们又快又犀利,专为那些想要从人群中脱颖而出的船东打造。
-
-
李俊志;
关杰
-
-
摘要:
基于混合运算的密码算法(MOC)以安全性高、软硬件实现效率高等特点受到人们的广泛关注.完全性指输出的每一比特都包含有输入每一比特的信息,达到完全性是密码算法设计的一个基本原则.该文提出针对MOC算法完全性分析的通用算法,并在此基础上提出利用完全性寻找MOC算法的不可能差分区分器的方法,此构造方法可直接给出MOC算法高重量的不可能差分区分器且搜索效率高,为MOC算法不可能差分区分器的实际构造提供了理论指导和技术支持.应用此方法找到了 SIMON 系列算法全部现有的最长不可能差分区分器,并找到了SPECK系列算法更多的不可能差分区分器.%Mixed Operation based Ciphers (MOC) attract cryptographers owing to their high security and high efficiency on both software and hardware platforms. As a basic principle of cryptosystem design, completeness refers to that every output bit contains the information of every input bit. This paper presents a universal algorithm of completeness analysis against MOC. Based on the algorithm, a method of constructing impossible differential distinguishers utilizing completeness is proposed. This method constructs heavy weight impossible differential distinguishers directly with high efficiency. The method can provide theory and technology direction for the construction of impossible differential distinguishers. Then, this paper analysis SIMON and SPECK with this method and introduces all the longest impossible differential distinguishers of SIMON currently public and new impossible differential distinguishers of SPECK.
-
-
张仕伟;
陈少真
-
-
摘要:
对于分组密码,不可能差分和零相关线性分析都是很重要的分析手段.通过研究非线性组件与(AND)的性质,首先得到用于刻画SIMON轮函数差分及线性传播特性的约束式,再基于布尔可满足约束问题(SAT),提出一种普适性不可能差分和零相关路径自动化搜索算法,并利用该算法搜索得到SIMON更多的不可能差分及零相关路径.除用于自动化搜索外,该算法还可判断特定的差分对(掩码对)是否能构成一条有效不可能差分和零相关路径.此外,基于该算法,从抵抗不可能差分攻击的角度出发,给出SIMON轮函数设计中循环移位常数的选取依据.
-
-
-
-