Polly cracker, revisited (Q285245)

From MaRDI portal

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

Polly cracker, revisited (English)

0 references

zbMATH Open document ID

0 references

10.1007/s10623-015-0048-8

0 references

Martin R. Albrecht

0 references

Jean-Charles Faugère

0 references

0 references

Gottfried Herold

0 references

0 references

Designs, Codes and Cryptography

0 references

publication date

19 May 2016

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

cryptography

0 references

multivariable systems

0 references

computational difficulty of problems

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10623-015-0048-8

0 references

0 references

Polly Cracker, Revisited

0 references

Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems

0 references

New Algorithms for Learning in Presence of Errors

0 references

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

0 references

On the complexity of computing syzygies

0 references

0 references

The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs

0 references

Multi-instance Security and Its Application to Password-Based Cryptography

0 references

QUAD: A multivariate stream cipher with provable security

0 references

When Homomorphism Becomes a Liability

0 references

(Leveled) fully homomorphic encryption without bootstrapping

0 references

Efficient Fully Homomorphic Encryption from (Standard) LWE

0 references

0 references

0 references

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''

0 references

Lattice polly cracker cryptosystems

0 references

Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers

0 references

Approximate common divisors via lattices

0 references

Fully Homomorphic Encryption over the Integers with Shorter Public Keys

0 references

Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers

0 references

Cryptanalysis of Block Ciphers with Overdefined Systems of Equations

0 references

0 references

Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack

0 references

The membership problem for unmixed polynomial ideals is solvable in single exponential time

0 references

A Survey on Polly Cracker Systems

0 references

A new efficient algorithm for computing Gröbner bases \((F_4)\)

0 references

0 references

Efficient computation of zero-dimensional Gröbner bases by change of ordering

0 references

Advances in Cryptology - CRYPTO 2003

0 references

Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases

0 references

0 references

Fully homomorphic encryption using ideal lattices

0 references

Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits

0 references

Implementing Gentry’s Fully-Homomorphic Encryption Scheme

0 references

Better Bootstrapping in Fully Homomorphic Encryption

0 references

Homomorphic Evaluation of the AES Circuit

0 references

A well-characterized approximation problem

0 references

Polly Cracker, Revisited, Revisited

0 references

Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato

0 references

0 references

Better Key Sizes (and Attacks) for LWE-Based Encryption

0 references

On Ideal Lattices and Learning with Errors over Rings

0 references

Additively Homomorphic Encryption with d-Operand Multiplications

0 references

Lattice-based Cryptography

0 references

De nugis Groebnerialium. II: Applying Macaulay's trick in order to easily write a Gröbner basis

0 references

A Framework for Efficient and Composable Oblivious Transfer

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

Homomorphic Encryption: From Private-Key to Public-Key

0 references

Gröbner Bases, Coding, and Cryptography

0 references

Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes

0 references

Fully Homomorphic Encryption over the Integers

0 references

0 references

Multiplying matrices faster than coppersmith-winograd

0 references

Minimal achievable approximation ratio for MAX-MQ in finite fields

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:285245

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q285245&oldid=36250341"