FGb

swMATH286MaRDI QIDQ13048FDOQ13048

Author name not available (Why is that?)

Described by source

• FGb: A Library for Computing Gröbner Bases

Cited In (only showing first 100 items - show all)

• Combinatorial Image Analysis
• Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
• Public-key cryptography from new multivariate quadratic assumptions
• Degeneracy loci and polynomial equation solving
• The membrane inclusions curvature equations
• Solving parametric systems of polynomial equations over the reals through Hermite matrices
• Implicit equations of the Henneberg-type minimal surface in the four-dimensional Euclidean space
• Lower bounds on the number of realizations of rigid graphs
• Solving rank-constrained semidefinite programs in exact arithmetic
• Solving rank-constrained semidefinite programs in exact arithmetic
• On conversions from CNF to ANF
• An algorithm for deciding zero equivalence of nested polynomially recurrent sequences
• Using Wiedemann’s Algorithm to Compute the Immunity Against Algebraic and Fast Algebraic Attacks
• On the computation of rational solutions of underdetermined systems over a finite field
• Cryptanalysis of HFE with Internal Perturbation
• Algebraic invariants of graphs; a study based on computer exploration
• Public Key Cryptography - PKC 2006
• On Black-Box Ring Extraction and Integer Factorization
• Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
• Public Key Cryptography - PKC 2005
• Computing critical points for invariant algebraic systems
• Topics in Cryptology – CT-RSA 2005
• Recovering an algebraic curve using its projections from different points. Applications to static and dynamic computational vision
• Certifying properties of an efficient functional program for computing Gröbner bases
• The Voronoi diagram of three lines
• Asymptotics of bivariate analytic functions with algebraic singularities
• Real root finding for determinants of linear matrices
• Compact packings of the plane with three sizes of discs
• Information Security and Privacy
• Title not available (Why is that?)
• Square, a New Multivariate Encryption Scheme
• The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic
• Security Analysis of Multivariate Polynomials for Hashing
• Rings: an efficient JVM library for commutative algebra (invited talk)
• Bilinear Systems with Two Supports
• Growth of the ideal generated by a quadratic Boolean function
• Algebraic attacks on the Courtois toy cipher
• Exact algorithms for linear matrix inequalities
• On the complexity of computing Gröbner bases for weighted homogeneous systems
• A Study on Gröbner Basis with Inexact Input
• Boolean Gröbner bases. Theory, algorithms and applications
• Working with multivariate polynomials in Maple
• On parallel block algorithms for exact triangularizations
• Border basis for polynomial system solving and optimization
• A family of weak keys in HFE and the corresponding practical key-recovery
• Decomposing polynomial sets simultaneously into Gröbner bases and normal triangular sets
• Proposal of a signature scheme based on STS trapdoor
• Real root finding for low rank linear matrices
• Accelerated Solution of Multivariate Polynomial Systems of Equations
• Extensions of the Cube Attack Based on Low Degree Annihilators
• Symmetrized summation polynomials: using small order torsion points to speed up elliptic curve index calculus
• Multivariate public key cryptosystem from Sidon spaces
• Computing generic bivariate Gröbner bases with Mathemagix
• Solving Kaltofen's challenge on Zolotarev's approximation problem
• Public Key Cryptography – PKC 2004
• Gröbner bases of ideals invariant under a commutative group: the non-modular case
• Linear recurring sequences for the UOV key generation
• Automated Deduction in Geometry
• Title not available (Why is that?)
• Recognizing graph theoretic properties with polynomial ideals
• Numerical homotopies to compute generic points on positive dimensional algebraic sets
• Solving equation systems by agreeing and learning
• Methods to solve algebraic equations in cryptanalysis
• Analysis of Trivium using compressed right hand side equations
• Critical points and Gröbner bases: the unmixed case
• On selection of nonmultiplicative prolongations in computation of Janet bases
• Comparison Between XL and Gröbner Basis Algorithms
• Information Security and Cryptology - ICISC 2003
• Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
• Decomposition of generic multivariate polynomials
• Geometric ideas for cryptographic equation solving in even characteristic
• Title not available (Why is that?)
• Algebraic, AIDA/Cube and side channel analysis of KATAN family of block ciphers
• Solving systems of polynomial equations over Galois–Eisenstein rings with the use of the canonical generating systems of polynomial ideals
• Involutive method for computing Gröbner bases over \(\mathbb F_2\)
• On the Discrete Logarithm Problem on Algebraic Tori
• Symbolic-numeric methods for solving polynomial equations and applications
• Irreducible decomposition of curves
• Strong Gröbner bases for polynomials over a principal ideal ring.
• Public Key Cryptography - PKC 2005
• On the relation between the MXL family of algorithms and Gröbner basis algorithms
• A geometric view of cryptographic equation solving
• Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT
• Fast Software Encryption
• Periodic ciphers with small blocks and cryptanalysis of Keeloq
• Using Galois ideals for computing relative resolvents
• Asymptotic acceleration of solving multivariate polynomial systems of equations
• Algebraic cryptanalysis of curry and flurry using correlated messages
• Practical cryptanalysis of the identification scheme based on the isomorphism of polynomial with one secret problem
• On computer-assisted classification of coupled integrable equations
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
• On the determination of cusp points of 3-RPR parallel manipulators
• A Groebner bases-based approach to backward reasoning in rule based expert systems
• Title not available (Why is that?)
• Parallel Dichotomy Algorithm for solving tridiagonal system of linear equations with multiple right-hand sides
• On the topology of planar algebraic curves
• Algebraic attacks from a Groebner basis perspective
• On the complexity of the \(F_5\) Gröbner basis algorithm
• Computation of non-commutative Gröbner bases in Grassmann and Clifford algebras
• Obtaining and solving systems of equations in key variables only for the small variants of AES

This page was built for software: FGb