Polly cracker, revisited (Q285245): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(7 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 93C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6582290 / rank
 
Normal rank
Property / zbMATH Keywords
 
cryptography
Property / zbMATH Keywords: cryptography / rank
 
Normal rank
Property / zbMATH Keywords
 
multivariable systems
Property / zbMATH Keywords: multivariable systems / rank
 
Normal rank
Property / zbMATH Keywords
 
computational difficulty of problems
Property / zbMATH Keywords: computational difficulty of problems / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QUAD / 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: SageMath / 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.1007/s10623-015-0048-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3022480174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polly Cracker, Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms for Learning in Presence of Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why you cannot even hope to use Gröbner bases in public key cryptography: An open letter to a scientist who failed and a challenge to those who have not yet failed / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of computing syzygies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-instance Security and Its Application to Password-Based Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: QUAD: A multivariate stream cipher with provable security / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Homomorphism Becomes a Liability / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Leveled) fully homomorphic encryption without bootstrapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Fully Homomorphic Encryption from (Standard) LWE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2902935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on the translation of my PhD thesis: ``An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice polly cracker cryptosystems / 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: Approximate common divisors via lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption over the Integers with Shorter Public Keys / 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: Cryptanalysis of Block Ciphers with Overdefined Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5690494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack / rank
 
Normal rank
Property / cites work
 
Property / cites work: The membership problem for unmixed polynomial ideals is solvable in single exponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey on Polly Cracker Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new efficient algorithm for computing Gröbner bases \((F_4)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of zero-dimensional Gröbner bases by change of ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4314356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully homomorphic encryption using ideal lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Gentry’s Fully-Homomorphic Encryption Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Bootstrapping in Fully Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphic Evaluation of the AES Circuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: A well-characterized approximation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polly Cracker, Revisited, Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Key Sizes (and Attacks) for LWE-Based Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ideal Lattices and Learning with Errors over Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additively Homomorphic Encryption with d-Operand Multiplications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-based Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: De nugis Groebnerialium. II: Applying Macaulay's trick in order to easily write a Gröbner basis / 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 lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphic Encryption: From Private-Key to Public-Key / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gröbner Bases, Coding, and Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4406533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal achievable approximation ratio for MAX-MQ in finite fields / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 23:58, 11 July 2024

scientific article
Language Label Description Also known as
English
Polly cracker, revisited
scientific article

    Statements

    Polly cracker, revisited (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 May 2016
    0 references
    cryptography
    0 references
    multivariable systems
    0 references
    computational difficulty of problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers