Browsing Bergen Open Research Archive by Author "Budroni, Alessandro"
Now showing items 1-6 of 6
-
Attacks on Integer-RLWE
Budroni, Alessandro; Chetioui, Benjamin; Franch, Ermes (Journal article; Peer reviewed, 2020)In 2019, Gu Chunsheng introduced Integer-RLWE, a variant of RLWE devoid of some of its efficiency flaws. Most notably, he proposes a setting where n can be an arbitrary positive integer, contrarily to the typical construction ... -
Efficient hash maps to G2 on BLS curves
Budroni, Alessandro; Pintore, Federico (Journal article; Peer reviewed, 2022)When a pairing e:G1×G2→GT, on an elliptic curve E defined over a finite field Fq, is exploited for an identity-based protocol, there is often the need to hash binary strings into G1 and G2. Traditionally, if E admits a ... -
Improvements on making BKW practical for solving LWE
Budroni, Alessandro; Guo, Qian; Johansson, Thomas; Mårtensson, Erik; Wagner, Paul Stankovski (Journal article; Peer reviewed, 2021)The learning with errors (LWE) problem is one of the main mathematical foundations of post-quantum cryptography. One of the main groups of algorithms for solving LWE is the Blum–Kalai–Wasserman (BKW) algorithm. This paper ... -
Making the BKW Algorithm Practical for LWE
Budroni, Alessandro; Guo, Qian; Johansson, Thomas; Mårtensson, Erik; Stankovski Wagner, Paul (Journal article; Peer reviewed, 2020)The Learning with Errors (LWE) problem is one of the main mathematical foundations of post-quantum cryptography. One of the main groups of algorithms for solving LWE is the Blum-Kalai-Wasserman (BKW) algorithm. This paper ... -
The mersenne low hamming combination search problem can be reduced to an ILP problem
Budroni, Alessandro; Tenti, Andrea (Lecture Notes in Computer Science, Chapter; Peer reviewed; Journal article, 2019)In 2017, Aggarwal, Joux, Prakash, and Santha proposed an innovative NTRU-like public-key cryptosystem that was believed to be quantum resistant, based on Mersenne prime numbers q=2N−1 . After a successful attack designed ... -
Notes on Lattice-Based Cryptography
Budroni, Alessandro (Doctoral thesis, 2022-09-06)Asymmetrisk kryptering er avhengig av antakelsen om at noen beregningsproblemer er vanskelige å løse. I 1994 viste Peter Shor at de to mest brukte beregningsproblemene, nemlig det diskrete logaritmeproblemet og ...