abelian [326, 408, 91, 337]. Abstract [117]. Accelerated [512]. Accelerating [398]. Achieve [477]. Acoustic [525]. Adaptive [241, 390, 471]. Adaptively [523, 390]. Adic [130]. Advance [279]. Adversarial [458]. Adversaries [353, 345, 357, 403, 450, 472, 501, 236]. Adversary [173]. AES [373, 474, 346, 459]. AES-192 [474]. AES-256 [474]. AES-like [459]. after [76]. Against [353, 480, 520, 348, 500...

The motion of charge particles in a superlattice structure subject to the crossed magnetic and electric fields, both applied in the in-plane direction, is discussed with respect to the novel type of terahertz oscillations suggested recently, [M. Orlita, R. Grill, L. Smrčka, M. Zvára, Phys. Rev. B 74 (2006) 125312]. The effects of the finite size of the superlattice is considered in comparison w...

We remark that the Bellare-Rivest protocol for translucent cryptography [J. Cryptology (1999) 12: 117-139] can not truly enable the government to decrypt partial encrypted communications.

Near-MDS matrices provide better trade-offs between security and efficiency compared to constructions based on MDS matrices, which are favored for hardwareoriented designs. We present new designs of lightweight linear diffusion layers by constructing lightweight near-MDS matrices. Firstly generic n×n near-MDS circulant matrices are found for 5 ≤ n ≤ 9. Secondly , the implementation cost of inst...

The Rank Decoding problem (RD) is at the core of rank-based cryptography. Cryptosystems such as ROLLO and RQC, which made it to second round NIST Post-Quantum Standardization Process, well Durandal signature scheme, rely on or its variants. This can also be seen a structured version MinRank, ubiquitous in multivariate Recently, Bardet et al. (in: Canteaut Ishai, Advances cryptology—EUROCRYPT 20...

1 Acknowledgments I would like to acknowledge the guidance provided by my advisor, Prof. Dollas at every stage of work on this thesis. I also would like to thank Prof. D. Pneumatikatos and Prof. K. Kalaizakis for reviewing my thesis and participating in my thesis defense and the staff, the undergraduate and the postgraduate students of the Microprocessor and Hardware Laboratory. Introduction En...

In previous work, we developed a single Evolutionary Algorithm (EA) to solve random instances of the Anshel-Anshel-Goldfeld (AAG) key exchange protocol over polycyclic groups. The EA consisted six simple heuristics which manipulated strings. present work extends this by exploring use hyper-heuristics in group-theoretic cryptology for first time. Hyper-heuristics are way generate new algorithms ...

The …eld of cryptology and data security hardly needs any introduction; numerous popular accounts of the subject have appeared over the years, and it is already a core topic in undergraduate computer science. The very term “cryptology”is testimony to the long history of the …eld; the term is derived from the words o& (meaning hidden), and o o& (meaning speech), which have retained their meaning...