东、西方蜜蜂对大蜡螟(Galleria mellonella L.)幼虫和成虫的清理行为差异研究

大蜡螟(Galleria mellonella.L)是一种遍及世界且对蜜蜂巢脾极具破坏性的害虫。为比较东、西方蜜蜂对大蜡螟幼虫和成虫的清理行为差异,探讨防治大蜡螟的新途径,本研究通过在蜂箱巢门口和蜂群内分别放置5龄大蜡螟幼虫、刚交尾的大蜡螟雌蛾和死亡雌蛾各30头(只),观察记录攻击大蜡螟的东、西方蜜蜂的数量、攻击时间及清理情况。结果显示:在蜂箱巢门口和巢内,参与攻击5龄大蜡螟幼虫和刚交尾的雌蛾的西方蜜蜂数量较东方蜜蜂多,攻击时间较长;西方蜜蜂会对死亡雌蛾进行清理,但东方蜜蜂不会;攻击结束后,西方蜜蜂会将遭攻击死亡的5龄大蜡螟幼虫和雌蛾拖离蜂箱,东方蜜蜂则放弃清理。表明西方蜜蜂对大蜡螟更敏感,清理能力更强。

Collision Attacks against AEZ-PRF for Authenticated Encryption AEZ

AEZ is an AES-based authenticated encryption submitted to the ongoing CAESAR competition and was presented at Eurocrypt2015 with AEZ v3. There are three models for AEZ, AEZ-core, AEZ-tiny and AEZ-prf. In this paper, we consider the security of AEZprf for AEZ v4.2, the latest version of AEZ.Our major finding is a collision of any 256-bit associated data for AES-prf. Then we launch collision attacks in a quantum setting and a classical setting respectively under different assumptions. In the quantum setting, by Simon's quantum algorithm, we amount a forgery with O(n) quantum superposition queries and an overwhelming probability close to 1.In the classical setting, one with the key of AEZ-prf can also construct the forgeries. Our results show that the AEZ-prf models of AEZ v4.2 is not secure in both the quantum setting and classical world. Furthermore, our results can also be applied to AEZ v3, which has been published on Eurocrypt 2015. As far as we know, no cryptanalysis of AEZ v4.2 has been published so far.

Cryptanalysis of Cryptosystems Based on General Linear Group

Advances in quantum computers threaten to break public key cryptosystems such as RSA, ECC, and EIGamal on the hardness of factoring or taking a discrete logarithm, while no quantum algorithms are found to solve certain mathematical problems on non-commutative algebraic structures until now. In this background, Majid Khan et al.proposed two novel public-key encryption schemes based on large abelian subgroup of general linear group over a residue ring. In this paper we show that the two schemes are not secure. We present that they are vulnerable to a structural attack and that, it only requires polynomial time complexity to retrieve the message from associated public keys respectively. Then we conduct a detailed analysis on attack methods and show corresponding algorithmic description and efficiency analysis respectively. After that, we propose an improvement assisted to enhance Majid Khan's scheme. In addition, we discuss possible lines of future work.

Universal Steganalysis of Data Hiding in Grayscale Images

This paper proposed an universal steganalysis program based on quantification attack which can detect several kinds of data hiding algorithms for grayscale images. In practice, most techniques produce stego images that are perceptually identical to the cover images but exhibit statistical irregularities that distinguish them from cover images. Attacking the suspicious images using the quantization method, we can obtain statistically different from embedded-and-quantization attacked images and from quantization attacked-but-not-embedded sources. We have developed a technique based on one-class SVM for discriminating between cover-images and stego-images. Simulation results show our approach is able to distinguish between cover and stego images with reasonable accuracy.

Managing High Volume Data for Network Attack Detection Using Real-Time Flow Filtering

In this paper, we present Real-Time Flow Filter (RTFF) -a system that adopts a middle ground between coarse-grained volume anomaly detection and deep packet inspection. RTFF was designed with the goal of scaling to high volume data feeds that are common in large Tier-1 ISP networks and providing rich, timely information on observed attacks. It is a software solution that is designed to run on off-the-shelf hardware platforms and incorporates a scalable data processing architecture along with lightweight analysis algorithms that make it suitable for deployment in large networks. RTFF also makes use of state of the art machine learning algorithms to construct attack models that can be used to detect as well as predict attacks.

A NEW METHOD FOR RESYNCHRONIZATION ATTACK

This paper presents a new method for resynchronization attack, which is the combination of the differential cryptanalysis and algebraic attack. By using the new method one gets a system of linear equations or low-degree equations about initial keys, and the solution of the system of equations results in the recovery of the initial keys. This method has a lower computational complexity and better performance of attack in contrast to the known methods. Accordingly, the design of the resynchronization stream generators should be reconsidered to make them strong enough to avoid our attacks. When implemented to the Toyocrypt, our method gains the computational complexity of O（2^17）, and that of 0（2^67） for LILI-128.

Multi-Party Quantum Private Comparison Protocol Based on Entanglement Swapping of Bell Entangled States

Recently, Liu et al. proposed a two-party quantum private comparison(QPC) protocol using entanglement swapping of Bell entangled state(Commun. Theor. Phys. 57(2012) 583). Subsequently, Liu et al. pointed out that in Liu et al.'s protocol, the TP can extract the two users' secret inputs without being detected by launching the Bell-basis measurement attack, and suggested the corresponding improvement to mend this loophole(Commun. Theor. Phys. 62(2014) 210). In this paper, we first point out the information leakage problem toward TP existing in both of the above two protocols, and then suggest the corresponding improvement by using the one-way hash function to encrypt the two users' secret inputs. We further put forward the three-party QPC protocol also based on entanglement swapping of Bell entangled state, and then validate its output correctness and its security in detail. Finally, we generalize the three-party QPC protocol into the multi-party case, which can accomplish arbitrary pair's comparison of equality among K users within one execution.