# Kazuhiro Yokoyama

According to our database

Collaborative distances :

^{1}, Kazuhiro Yokoyama authored at least 57 papers between 1988 and 2018.Collaborative distances :

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Usage of Modular Techniques for Efficient Computation of Ideal Operations.

Mathematics in Computer Science, 2018

On Affine Tropical F5 Algorithms.

CoRR, 2018

On Affine Tropical F5 Algorithms.

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

2017

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

J. Symb. Comput., 2017

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

J. Mathematical Cryptology, 2017

A Tropical F5 algorithm.

CoRR, 2017

A Tropical F5 Algorithm.

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.

Security and Communication Networks, 2015

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

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

Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption.

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.

J. Mathematical Cryptology, 2014

Verification of Gröbner Basis Candidates.

Proceedings of the Mathematical Software - ICMS 2014, 2014

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

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

2013

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

Theor. Comput. Sci., 2013

Practical Packing Method in Somewhat Homomorphic Encryption.

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

Secure pattern matching using somewhat homomorphic encryption.

Proceedings of the CCSW'13, 2013

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

Proceedings of the Security Engineering and Intelligence Informatics, 2013

2012

Efficient Arithmetic in Successive Algebraic Extension Fields Using Symmetries.

Mathematics in Computer Science, 2012

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

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.

Mathematics in Computer Science, 2011

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

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

2010

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

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.

J. Symb. Comput., 2009

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

Proceedings of the Symbolic Numeric Computation, 2009

Computation schemes for splitting fields of polynomials.

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

Solution of algebraic riccati equations using the sum of roots.

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

2008

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

ACM Comm. Computer Algebra, 2008

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

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

Symbolic optimization of algebraic functions.

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

2007

On systems of algebraic equations with parametric exponents II.

Appl. Algebra Eng. Commun. Comput., 2007

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

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

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

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.

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

Stability of Parametric Decomposition.

Proceedings of the Mathematical Software, 2006

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

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

2005

Sum of roots with positive real parts.

Proceedings of the Symbolic and Algebraic Computation, 2005

Cylindrical Algebraic Decomposition via Numerical Computation with Validated Symbolic Reconstruction.

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

2004

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

J. Symb. Comput., 2004

On systems of algebraic equations with parametric exponents.

Proceedings of the Symbolic and Algebraic Computation, 2004

2003

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

ACM SIGSAM Bulletin, 2003

2002

Yet another practical implementation of polynomial factorization over finite fields.

Proceedings of the Symbolic and Algebraic Computation, 2002

2001

The Block Cipher SC2000.

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

2000

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

J. Symb. Comput., 2000

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

Proceedings of the Public Key Cryptography, 2000

1999

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

J. Symb. Comput., 1999

1998

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

Proceedings of the Public Key Cryptography, 1998

Efficient Implementation of Schoof's Algorithm.

Proceedings of the Advances in Cryptology, 1998

1996

Localization and Primary Decomposition of Polynomial Ideals.

J. Symb. Comput., 1996

1995

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

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

1994

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

J. Symb. Comput., 1994

1993

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

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.

J. Symb. Comput., 1992

On distance transitive graphs whose automorphism groups are affine.

J. Comb. Theory, Ser. B, 1992

1990

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

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

On Determining the Solvability of Polynomials.

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

1989

Computing Primitive Elements of Extension Fields.

J. Symb. Comput., 1989

1988

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

Eur. J. Comb., 1988