Kazuhiro Yokoyama

IACR Cryptol. ePrint Arch., 2024

On Hilbert-Poincaré series of affine semi-regular polynomial sequences and related Gröbner bases.

[BibT_eX]

[DOI]

Momonari Kudo

IACR Cryptol. ePrint Arch., 2024

2023

Learning to Compute Gröbner Bases.

[BibT_eX]

[DOI]

CoRR, 2023

2021

On affine tropical F5 algorithms.

[BibT_eX]

[DOI]

Tristan Vaccon

Thibaut Verron

J. Symb. Comput., 2021

Algebraic approaches for solving isogeny problems of prime power degrees.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2021

Implementation Report of the Kohel-Lauter-Petit-Tignol Algorithm for the Constructive Deuring Correspondence.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Conference on Mathematics and Computing, 2021

2020

Complexity bounds on Semaev's naive index calculus method for ECDLP.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2020

On FGLM algorithms with tropical Gröbner bases.

[BibT_eX]

[DOI]

Yuki Ishihara

Tristan Vaccon

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

Hybrid Meet-in-the-Middle Attacks for the Isogeny Path-Finding Problem.

[BibT_eX]

[DOI]

Proceedings of the 7th on ASIA Public-Key Cryptography Workshop, 2020

2018

Usage of Modular Techniques for Efficient Computation of Ideal Operations.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2018

Effective Localization Using Double Ideal Quotient and Its Implementation.

[BibT_eX]

[DOI]

Yuki Ishihara

Proceedings of the Computer Algebra in Scientific Computing - 20th International Workshop, 2018

2017

Special issue on the conference ISSAC 2015: Symbolic computation and computer algebra.

[BibT_eX]

[DOI]

J. Symb. Comput., 2017

Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2017

A Tropical F5 Algorithm.

[BibT_eX]

[DOI]

Tristan Vaccon

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2015

New packing method in somewhat homomorphic encryption and its applications.

[BibT_eX]

[DOI]

Secur. Commun. Networks, 2015

Secure Data Devolution: Practical Re-encryption with Auxiliary Data in LWE-based Somewhat Homomorphic Encryption.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Workshop on Security in Cloud Computing, 2015

Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy - 20th Australasian Conference, 2015

2014

On the exact decryption range for Gentry-Halevi's implementation of fully homomorphic encryption.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2014

Verification of Gröbner Basis Candidates.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software - ICMS 2014, 2014

Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy - 19th Australasian Conference, 2014

2013

An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Practical Packing Method in Somewhat Homomorphic Encryption.

[BibT_eX]

[DOI]

Proceedings of the Data Privacy Management and Autonomous Spontaneous Security, 2013

Secure pattern matching using somewhat homomorphic encryption.

[BibT_eX]

[DOI]

Proceedings of the CCSW'13, 2013

Packed Homomorphic Encryption Based on Ideal Lattices and Its Application to Biometrics.

[BibT_eX]

[DOI]

Proceedings of the Security Engineering and Intelligence Informatics, 2013

2012

Efficient Arithmetic in Successive Algebraic Extension Fields Using Symmetries.

[BibT_eX]

[DOI]

Sébastien Orange

Math. Comput. Sci., 2012

Usage of Modular Techniques for Efficient Computation of Ideal Operations - (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 14th International Workshop, 2012

2011

Optimizing a Particular Real Root of a Polynomial by a Special Cylindrical Algebraic Decomposition.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2011

Development of QC2AS - A Computer Algebra System for Symbolic Quantum Chemical Computations.

[BibT_eX]

[DOI]

Takeshi Osoekawa

Yuji Mochizuki

Proceedings of the International Conference on Computational Science and Its Applications, 2011

2010

Gröbner Basis Technique for Algebraic Formulas in Electron Correlation Theories.

[BibT_eX]

[DOI]

Proceedings of the Prodeedings of the 2010 International Conference on Computational Science and Its Applications, 2010

2009

Parametric polynomial spectral factorization using the sum of roots and its application to a control design problem.

[BibT_eX]

[DOI]

J. Symb. Comput., 2009

Computation schemes for splitting fields of polynomials.

[BibT_eX]

[DOI]

Sébastien Orange

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Solution of algebraic riccati equations using the sum of roots.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

2008

Solution of the algebraic riccati equation using the sum of roots.

[BibT_eX]

[DOI]

Masaaki Kanno

ACM Commun. Comput. Algebra, 2008

Multi-modular algorithm for computing the splitting field of a polynomial.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

Symbolic optimization of algebraic functions.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2007

On systems of algebraic equations with parametric exponents II.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2007

Parametric optimization in control using the sum of roots for parametric polynomial spectral factorization.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

Sum of roots, polynomial spectral factorization, and control performance limitations.

[BibT_eX]

[DOI]

Proceedings of the 46th IEEE Conference on Decision and Control, 2007

2006

On the Relationship Between the Sum of Roots with Positive Real Parts and Polynomial Spectral Factorization.

[BibT_eX]

[DOI]

Masaaki Kanno

Proceedings of the Numerical Methods and Applications, 6th International Conference, 2006

Stability of Parametric Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software, 2006

A Modular Method for Computing the Splitting Field of a Polynomial.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, 7th International Symposium, 2006

2005

Sum of roots with positive real parts.

[BibT_eX]

[DOI]

Shinji Hara

Proceedings of the Symbolic and Algebraic Computation, 2005

Cylindrical Algebraic Decomposition via Numerical Computation with Validated Symbolic Reconstruction.

[BibT_eX]

Proceedings of the Algorithmic Algebra and Logic. Proceedings of the A3L 2005, 2005

2004

On systems of algebraic equations with parametric exponents.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2004

2003

Implementation of prime decomposition of polynomial ideals over small finite fields.

[BibT_eX]

[DOI]

SIGSAM Bull., 2003

2002

Yet another practical implementation of polynomial factorization over finite fields.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2002

2001

The Block Cipher SC2000.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption, 8th International Workshop, 2001

2000

Special Issue on Algorithmic Methods in Galois Theory - Foreword of the Guest Editors.

[BibT_eX]

[DOI]

B. Heinrich Matzat

John McKay

J. Symb. Comput., 2000

Efficient Implementation of Schoof's Algorithm in Case of Characteristic 2.

[BibT_eX]

[DOI]

Tetsuya Izu

Jun Kogure

Proceedings of the Public Key Cryptography, 2000

1999

A Modular Method to Compute the Rational Univariate Representation of Zero-dimensional Ideals.

[BibT_eX]

[DOI]

J. Symb. Comput., 1999

1998

Parameters for Secure Elliptic Curve Cryptosystem - Improvements on Schoof's Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 1998

Efficient Implementation of Schoof's Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1998

1996

Localization and Primary Decomposition of Polynomial Ideals.

[BibT_eX]

[DOI]

Takeshi Shimoyama

J. Symb. Comput., 1996

1995

Finding Roots of Unity Among Quotients of the Roots of an Integral Polynomial.

[BibT_eX]

[DOI]

Ziming Li

István Nemes

Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, 1995

1994

Multi-Modular Approach to Polynomial-Time Factorization of Bivariate Integral Polynomials.

[BibT_eX]

[DOI]

J. Symb. Comput., 1994

1993

On Hensel Construction of Eigenvalues and Eigenvectors of Matrices with Polynomial Entries.

[BibT_eX]

[DOI]

Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

1992

Solutions of Systems of Algebraic Equations and Linear Maps on Residue Class Rings.

[BibT_eX]

[DOI]

J. Symb. Comput., 1992

On distance transitive graphs whose automorphism groups are affine.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1992

1990

On Factoring Multi-Variate Polynomials over Algebraically Closed Fields (abstract).

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1990

On Determining the Solvability of Polynomials.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1990

1989

Computing Primitive Elements of Extension Fields.

[BibT_eX]

[DOI]

J. Symb. Comput., 1989

1988

On Distance Transitive Graphs in Which the Stabilizer of a Point Contains an Alternating Group.

[BibT_eX]

[DOI]