Identification and signatures based on NP-hard problems of indefinite quadratic forms (Q3612243): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Small solutions of the Legendre equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Solutions of Quadratic Diophantine Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Key Identification Based on the Equivalence of Quadratic Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice basis reduction for indefinite forms and an application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of approximating the shortest vector problem in lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case complexity bounds for algorithms in the theory of integral quadratic forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-complete decision problems for binary quadratics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Floating-Point LLL Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient solution of the congruence<tex>x^2 + ky^2 = mpmod{n}</tex> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic equations using reduced unimodular quadratic forms / rank
 
Normal rank

Latest revision as of 03:28, 29 June 2024

scientific article
Language Label Description Also known as
English
Identification and signatures based on NP-hard problems of indefinite quadratic forms
scientific article

    Statements

    Identification and signatures based on NP-hard problems of indefinite quadratic forms (English)
    0 references
    0 references
    0 references
    0 references
    3 March 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    identification protocols
    0 references
    proof of knowledge
    0 references
    quadratic forms
    0 references
    NP-hardness
    0 references
    LLL-reduction
    0 references