Algorithms for CRT-variant of approximate greatest common divisor problem (Q2025331): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1515/jmc-2019-0031 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: fhe / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: fpLLL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1515/jmc-2019-0031 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3095958347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lovász' lattice reduction and the nearest lattice point problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch Fully Homomorphic Encryption over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalysis of the Multilinear Map over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomophic Encryption over the Integers Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Multilinear Maps over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the approximate common divisor problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random matrices: law of the determinant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption over the Integers / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1515/JMC-2019-0031 / rank
 
Normal rank

Latest revision as of 19:37, 16 December 2024

scientific article
Language Label Description Also known as
English
Algorithms for CRT-variant of approximate greatest common divisor problem
scientific article

    Statements

    Algorithms for CRT-variant of approximate greatest common divisor problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 May 2021
    0 references
    CCK-ACD
    0 references
    lattice
    0 references
    orthogonal lattice attack
    0 references
    SDA
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references