Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-02295-1_13 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W112021158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice reduction: a toolbox for the cryptoanalyst / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice basis reduction: Improved practical algorithms and solving subset sum problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of polynomial time lattice basis reduction algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A more efficient algorithm for lattice basis reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast LLL-type lattice reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sieve algorithm for the shortest lattice vector problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Polynomial-Factor Approximations to the Shortest Lattice Vector Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Floating-Point LLL Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing hard lattices with O(n log n) bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Compact Knapsacks Are Collision Resistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: SWIFFT: A Modest Proposal for FFT Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lattice-based cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy trapdoor functions and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-Based Identification Schemes Secure Under Active Attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Efficient Lattice-Based Digital Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for hard lattices and new cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Efficient and Composable Oblivious Transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Lattice Problems with Polynomial Approximation Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating shortest lattice vectors is not harder than approximating closest lattice vectors / 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: The worst-case behavior of schnorr's algorithm approximating the shortest nonzero vector in a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relation of primal--dual lattices and the complexity of shortest lattice vector problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicting Lattice Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2757225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting cryptographic key sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice problems and norm embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generalized Basis Reduction Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symplectic Lattice Reduction and NTRU / rank
 
Normal rank

Latest revision as of 13:09, 2 July 2024

scientific article; zbMATH DE number 5677891
Language Label Description Also known as
English
Cryptographic Functions from Worst-Case Complexity Assumptions
scientific article; zbMATH DE number 5677891

    Statements

    Cryptographic Functions from Worst-Case Complexity Assumptions (English)
    0 references
    0 references
    5 March 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references