Computation of a 768-bit prime field discrete logarithm

T Kleinjung, C Diem, AK Lenstra, C Priplata… - Advances in Cryptology …, 2017 - Springer
This paper reports on the number field sieve computation of a 768-bit prime field discrete
logarithm, describes the different parameter optimizations and resulting algorithmic changes …

A complete quantum circuit to solve the information set decoding problem

S Perriello, A Barenghi, G Pelosi - 2021 IEEE International …, 2021 - ieeexplore.ieee.org
Providing strong security margins against cryptanalytic attackers equipped with quantum
computers is a major research direction fostered by the US National Institute of Standards …

Using the cloud to determine key strengths

T Kleinjung, AK Lenstra, D Page, NP Smart - International Conference on …, 2012 - Springer
We develop a new methodology to assess cryptographic key strength using cloud
computing, by calculating the true economic cost of (symmetric-or private-) key retrieval for …

Computational hardness of IFP and ECDLP

M Yasuda, T Shimoyama, J Kogure, T Izu - Applicable Algebra in …, 2016 - Springer
The RSA cryptosystem and elliptic curve cryptography (ECC) have been used practically
and widely in public key cryptography. The security of RSA and ECC respectively relies on …

[PDF][PDF] Using resource allocation for seamless service provisioning in cloud computing

MM Akawee, MA Ahmed, RA Hasan - Indonesian Journal of …, 2022 - academia.edu
A resources allocation is one of the most important things in cloud computing because the
environment in which work depends is heterogeneous environment and there are many who …

On the strength comparison of the ECDLP and the IFP

M Yasuda, T Shimoyama, J Kogure, T Izu - Security and Cryptography for …, 2012 - Springer
At present, the RSA cryptosystem is most widely used in public key cryptography. On the
other hand, elliptic curve cryptography (ECC) has recently received much attention since …

Using the Cloud to Determine Key Strengths--Triennial Update

M Delcourt, T Kleinjung, AK Lenstra, S Nath… - Cryptology ePrint …, 2018 - eprint.iacr.org
We develop a new methodology to assess cryptographic key strength using cloud
computing, by calculating the true economic cost of (symmetric-or private-) key retrieval for …

Quantum Computing Research Lines in the Italian Center for Supercomputing

A Barenghi, P Cremonesi, G Pelosi - International Conference on …, 2023 - Springer
Quantum computing is widely seen as an evolution step in computer science, with the
potential for disruptive changes in how we think about problem solvability. The significant …

Remotely Observing Reverse Engineers to Evaluate Software Protection

C Taylor - 2022 - search.proquest.com
Software often contains proprietary information---algorithms, intellectual property, and
encryption keys, for example---which malicious actors seek to access through reverse …

Iterative sparse matrix-vector multiplication for integer factorization on GPUs

B Schmidt, H Aribowo, HV Dang - Euro-Par 2011 Parallel Processing: 17th …, 2011 - Springer
Abstract The Block Wiedemann (BW) and the Block Lanczos (BL) algorithms are frequently
used to solve sparse linear systems over GF (2). Iterative sparse matrix-vector multiplication …