Number Not Used Once - Practical fault attack on pqm4 implementations of NIST candidates

In this paper, we demonstrate practical fault attacks over a number of lattice based schemes, in particular NewHope, Kyber, Frodo, Dilithium which are based on the hardness of the Learning with Errors (LWE) problem. One of the common traits of all the considered LWE schemes is the use of nonces as domain separators to sample the secret components of the LWE instance. We show that simple faults targeting the usage of nonce can result in a nonce-reuse scenario which allows key recovery and message recovery attacks. To the best of our knowledge, we propose the first practical fault attack on lattice-based Key encapsulation schemes secure in the CCA model. We perform experimental validation of our attack using Electromagnetic fault injection on reference implementations of the aforementioned schemes taken from the pqm4 library, a benchmarking and testing framework for post quantum cryptographic implementations for the ARM Cortex-M4. We use the instruction skip fault model, which is very practical and popular in microcontroller based implementations. Our attack requires to inject a very few number of faults (numbering less than 10 for recommended parameter sets) and can be repeated with a 100% accuracy with our Electromagnetic fault injection setup

TRCyberLab: An Infrastructure for Future Internet and Security Studies

The digital world is continuously changing, and new technologies affecting every aspect of our life. In order to keep up with these changes and have some impact and/or control over it; we must conduct advanced research on information technologies, future networks and security. In addition, we must educate the necessary human resource for the field. Today, developed countries are establishing large-scale research and education testbeds to support their researchers. Using these testbeds, they seek to increase their impact in the technology and security fields. In this paper, we propose a national information and communication technologies and security testbed, TRCyberLab. We also propose a road-map for the establishment and sustainment of this testbed. We believe, this testbed will help researchers in Turkey to conduct advanced research and develop new technologies also have an impact in the field

On the Efficiency of Polynomial Multiplication for Lattice-Based Cryptography on GPUs Using CUDA

Polynomial multiplication is the most time-consuming part of cryptographic schemes whose security is based on ideal lattices. Thus, any efficiency improvement on this building block has great impact on the practicability of lattice-based cryptography. In this work, we investigate several algorithms for polynomial multiplication on a graphical processing unit (GPU), and implement them in both serial and parallel way on the GPU using the compute unified device architecture (CUDA) platform. Moreover, we focus on the quotient ring (Z/pZ)[x]/(xn+1), where p is a prime number and n is a power of 2. We stress that this ring constitutes the most common setting in lattice-based cryptography for efficiency reasons. As an application we integrate the different implementations of polynomial multiplications into a lattice-based signature scheme proposed by Güneysu et al. (CHES 2012) and identify which algorithm is the preferable choice with respect to the ring of degree n

COVID-19 VACCINATION OF SPONDYLOARTHRITIS PATIENTS RECEIVING BIOLOGICAL THERAPY: REAL-LIFE DATA

Bu çalışma, 01-04 Haziran 2022 tarihlerinde Copenhagen[Danimarka]’da düzenlenen Annual European Congress of Rheumatology (EULAR) Kongresi‘nde bildiri olarak sunulmuştur.European Alliance Assoc Rheumato

From 5-pass MQ-based identification to MQ-based signatures

Contains fulltext : 166097.pdf (publisher's version ) (Closed access)Advances in Cryptology – ASIACRYPT 2016: 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 201