Zobrazeno 1 - 10
of 519
pro vyhledávání: '"VERBAUWHEDE, INGRID"'
Autor:
Norga, Quinten, Kundu, Suparna, Ojha, Uttam Kumar, Ganguly, Anindya, Karmakar, Angshuman, Verbauwhede, Ingrid
Digital signature schemes based on multivariate- and code-based hard problems are promising alternatives for lattice-based signature schemes due to their smaller signature size. Hence, several candidates in the ongoing additional standardization for
Externí odkaz:
http://arxiv.org/abs/2411.00067
Autor:
Kundu, Suparna, Norga, Quinten, Karmakar, Angshuman, Gangopadhyay, Shreya, Mera, Jose Maria Bermudo, Verbauwhede, Ingrid
Recently, the construction of cryptographic schemes based on hard lattice problems has gained immense popularity. Apart from being quantum resistant, lattice-based cryptography allows a wide range of variations in the underlying hard problem. As cryp
Externí odkaz:
http://arxiv.org/abs/2409.09481
Autor:
Kundu, Suparna, Chowdhury, Siddhartha, Saha, Sayandeep, Karmakar, Angshuman, Mukhopadhyay, Debdeep, Verbauwhede, Ingrid
Post-quantum cryptographic (PQC) algorithms, especially those based on the learning with errors (LWE) problem, have been subjected to several physical attacks in the recent past. Although the attacks broadly belong to two classes - passive side-chann
Externí odkaz:
http://arxiv.org/abs/2401.14098
Masking is a well-known and provably secure countermeasure against side-channel attacks. However, due to additional redundant computations, integrating masking schemes is expensive in terms of performance. The performance overhead of integrating mask
Externí odkaz:
http://arxiv.org/abs/2311.08040
Physical attacks are serious threats to cryptosystems deployed in the real world. In this work, we propose a microarchitectural end-to-end attack methodology on generic lattice-based post-quantum key encapsulation mechanisms to recover the long-term
Externí odkaz:
http://arxiv.org/abs/2311.08027
Autor:
Ghosh, Archisman, Mera, Jose Maria Bermudo, Karmakar, Angshuman, Das, Debayan, Ghosh, Santosh, Verbauwhede, Ingrid, Sen, Shreyas
The hard mathematical problems that assure the security of our current public-key cryptography (RSA, ECC) are broken if and when a quantum computer appears rendering them ineffective for use in the quantum era. Lattice based cryptography is a novel a
Externí odkaz:
http://arxiv.org/abs/2305.10368
Autor:
Legiest, Wouter, D'Anvers, Jan-Pieter, Turan, Furkan, Van Beirendonck, Michiel, Verbauwhede, Ingrid
Homomorphic encryption (HE) enables calculating on encrypted data, which makes it possible to perform privacypreserving neural network inference. One disadvantage of this technique is that it is several orders of magnitudes slower than calculation on
Externí odkaz:
http://arxiv.org/abs/2304.09490
Autor:
Grujić, Miloš, Verbauwhede, Ingrid
Publikováno v:
M. Gruji\'c and I. Verbauwhede, "Optimizing Linear Correctors: A Tight Output Min-Entropy Bound and Selection Technique," in IEEE Transactions on Information Forensics and Security, vol. 19, pp. 586-600, 2024
Post-processing of the raw bits produced by a true random number generator (TRNG) is always necessary when the entropy per bit is insufficient for security applications. In this paper, we derive a tight bound on the output min-entropy of the algorith
Externí odkaz:
http://arxiv.org/abs/2304.05306
Cryptocurrency mining is an energy-intensive process that presents a prime candidate for hardware acceleration. This work-in-progress presents the first coprocessor design for the ASIC-resistant CryptoNight-Haven Proof of Work (PoW) algorithm. We con
Externí odkaz:
http://arxiv.org/abs/2212.05033
Fully Homomorphic Encryption is a technique that allows computation on encrypted data. It has the potential to change privacy considerations in the cloud, but computational and memory overheads are preventing its adoption. TFHE is a promising Torus-b
Externí odkaz:
http://arxiv.org/abs/2211.13696