NESSIE工程简介

1 引言 NESSIE是欧洲委员会的信息社会技术(IST)规划中所支持的一项工程,支持年限三年(2000年1月至2002年12月),投资33亿欧元。目前,工程已进入具体实施阶段。

低轮Camellia的碰撞攻击

Camellia是欧洲密码大计划NESSIE的最终获胜者, 首先构造了Camellia的4轮区分器, 然后利用这些区分器和碰撞搜索技术分析Camellia的安全性. 在密钥长度为128比特的情况下, 攻击6轮Camellia的数据复杂度小于210个选择明文, 时间复杂度小于215次加密; 攻击7轮Camellia的数据复杂度小于212个选择明文, 时间复杂度小于254.5次加密; 攻击8轮Camellia的数据复杂度小于213个选择明文, 时间复杂度小于2112.1次加密; 攻击9轮Camellia的数据复杂度小于2113.6个选择明文, 时间复杂度小于2121次加密. 在密钥长度为192/256比特的情况下, 攻击8轮Camellia的数据复杂度小于213个选择明文, 时间复杂度小于2111.1次加密; 攻击9轮Camellia的数据复杂度小于213个选择明文, 时间复杂度小于2175.6次加密; 攻击10轮Camellia的数据复杂度小于214个选择明文, 时间复杂度小于2239.9次加密. 结果显示碰撞攻击是目前对低轮Camellia最有效的攻击方法.

NUSH分组密码的线性密码分析

NUSH是NESSIE公布的17个候选分组密码之一.对不同分组长度和密钥规模的NUSH进行了线性密码分析,每一种攻击的复杂度δ由它所需的数据复杂度ε和处理复杂度η组成,记为δ=(ε,η).对于分组长度为64 bit的NUSH,当密钥为128 bit时,3种攻击的复杂度分别为(258,2124)、(260,278)和(262,255);当密钥为192 bit时,3种攻击的复杂度分别为(258,2157)、(260,296)和(262,258);当密钥为256 bit时,3种攻击的复杂度分别为(258,2125)、(260,278)和(262,253).对于分组长度为128 bit的NUSH,当密钥为128bit时,3种攻击的复杂度分别为(2122,295)、(2124,257)和(2126,252);当密钥为192 bit时,3种攻击的复杂度分别为(2122,2142)、(2124,275)和(2126,258);当密钥为256 bit时,3种攻击的复杂度分别为(2122,2168)、(1224,281)和(2126,264).对于分组长度为256 bit的NUSH,当密钥为128 bit时,两种攻击的复杂度分别为(2252,2122)和(2254,2119);当密钥为192 bit时,两种攻击的复杂度分别为(2252,2181)和(2254,2177);当密钥为256 bit时,两种攻击的复杂度分别为(2252,2240)和(2254,2219).这些结果显示NUSH对线性密码分析是不免疫的,而且密钥规模的增大不能保证安全性的提高.

欧洲21世纪数据加密标准候选算法简评

简要介绍了欧洲 NESSIE( new European schemes for signatures,integrity,and encryption)大计划最近公布的 17个分组密码算法的基本设计思想、最新分析结果及其有效性 .

Q的线性密码分析

对NESSIE公布的17个分组密码之一的Q进行了线性密码分析，攻击所需的数据复杂不大于2^118(相应的成功率为0．785），空间复杂度不大于2^33+2^19+2^18+2^12+2^11+2^10。此结果显示Q对线性密码分析是不免疫的。

对低轮SAFER++的差分-非线性密码分析

SAFER++是进入NESSIE第2轮评估的7个分组算法之一。采用差分密码分析和非线性密码分析相结合的方法对4轮、5轮和6轮SAFER++进行分析，结果表明：6轮SAFER++对这种攻击方法不免疫；攻击4轮和5轮SAFER++时，与已有结果相比，攻击复杂度大大减小。攻击对2\+{250}个256比特长度的密钥有效。

简评欧洲密码大计划的发展现状

NESSIE(New European Schemes for Signatures，Integrity，and Encryption)是一个为时三年的密码大计划，它的主要目的是为了推出一系列安全的密码模块，另一个目的是保持欧洲在密码研究领域的领先地位并增强密码在欧洲工业中的作用。它的整个运作过程是公开透明的，2000年3月公布了征集通告，2000年11月13～14日，召开第一次NESSIE会议，并公布征集到的所有算法。NESSIE共征集17个分组密码算法，经过一年多的评估，在今年9月12～13日召开的第二次NESSIE会议上，NESSIE公布了评选出的7个算法：IDEA，Khazad，MISTY1，SAFER++，Camellia，RC6，SHACAL，它们将作为NESSIE计划下一阶段重点评估的对象。NEESIE预计将在明年秋季召开第三次会议，届时将宣布最后的评选结果。本文简要介绍NESSIE的评估原则，阐述NESSIE对各个候选算法的取舍原因，同时列出算法设计者和公众对各个算法的分析情况。

关于Noekeon分组密码

Noekeon是NESSIE公布的17个候选算法之一,讨论了Noekeon各个模块的密码特性及它们在整个密码中的作用,从中体会Noekeon的设计技巧.

Hardware Performance Analysis of the SHACAL-2 Encryption Algorithm

A hardware performance analysis of the SHACAL-2 encryption algorithm is presented in this paper. SHACAL-2 was one of four symmetric key algorithms chosen in the New European Schemes for Signatures, Integrity and Encryption (NESSIE) initiative in 2003. The paper describes a fully pipelined encryption SHACAL-2 architecture implemented on a Xilinx Field Programmable Gate Array (FPGA) device that achieves a throughput of over 25 Gbps. This is the fastest private key encryption algorithm architecture currently available. The SHACAL-2 decryption algorithm is also defined in the paper as it was not provided in the NESSIE submission.

Very high speed 17 Gbps SHACAL encryption architecture

Very high speed and low area hardware architectures of the SHACAL-1 encryption algorithm are presented in this paper. The SHACAL algorithm was a submission to the New European Schemes for Signatures, Integrity and Encryption (NESSIE) project and it is based on the SHA-1 hash algorithm. To date, there have been no performance metrics published on hardware implementations of this algorithm. A fully pipelined SHACAL-1 encryption architecture is described in this paper and when implemented on a Virtex-II X2V4000 FPGA device, it runs at a throughput of 17 Gbps. A fully pipelined decryption architecture achieves a speed of 13 Gbps when implemented on the same device. In addition, iterative architectures of the algorithm are presented. The SHACAL-1 decryption algorithm is derived and also presented in this paper, since it was not provided in the submission to NESSIE. © Springer-Verlag Berlin Heidelberg 2003.

Ted Hughes: the development of a children's poet

This article looks at how Ted Hughes' poetry for children developed over more than 30 years of publication. It traces the movement from his earlier, more conventional rhyming poems, such as Meet My Folks! (1961) and Nessie the Mannerless Monster (1964), to the mature, free verse "animal poems" for older readers of Season Songs (1976c), Under the North Star (1981) and the "farmyard fable" What is the Truth? (1984). The article argues that the later lyrical poems for younger readers where Hughes returned to rhyme, The Cat and the Cuckoo (1987) and The Mermaid's Purse (1993), represent an undervalued final phase of Hughes' work for children which is rarely discussed by critics. The discussion considers Hughes' changing attitude to the concept of the "children's poet" at different periods of his career. Reference is made throughout to Hughes' own writing about children and poetry, such as Poetry in the Making (1967), and to parallel developments in his poetry for adults.

Prototipo di un tracciatore per particelle cariche con risoluzione millimetrica

Questa tesi si inserisce nell’ambito del progetto WA104-NESSiE al CERN per il quale era richiesto lo sviluppo di un tracciatore di particelle cariche da utilizzare in presenza di campi magnetici e avente una risoluzione sulla posizione ricostruita di 1-2 mm. Il lavoro di tesi ha riguardato l'analisi dei dati raccolti con un prototipo del tracciatore composto da barre di scintillatori a sezione triangolare, accoppiati a SiPM i cui segnali sono acquisiti in modalità analogica. Il prototipo è stato esposto a particelle cariche presso la linea di fascio T9 del PS del CERN nel maggio 2016. La catena di analisi è stata validata con dati provenienti da una simulazione Monte Carlo basata su Geant4 che fornisce la risposta del tracciatore al passaggio di particelle cariche (pioni e muoni) a diversi impulsi (1-10 GeV/c). Successivamente, è stata fatta un'analisi preliminare dei dati reali e un confronto con la simulazione Monte Carlo. La risoluzione ottenuta per pioni di 5 GeV è di ∼ 2 mm, compatibile con il valore ottenuto dalla simulazione Monte Carlo di ∼ 1.5 mm. Questi risultati sono stati ricavati analizzando una frazione degli eventi acquisiti durante il test beam. Una misura più accurata della risoluzione del tracciatore può essere ottenuta introducendo alcune correzioni, come ad esempio l’allineamento dei piani, la ricalibrazione dei segnali dei singoli canali e, infine, analizzando l’intero campione.