On Distance Transitive Graphs in Which the Stabilizer of a Point Contains an Alternating Group. - Kazuhiro Yokoyama (Eur. J. Comb., 1988)

Computing Primitive Elements of Extension Fields. - Kazuhiro Yokoyama; Masayuki Noro; Taku Takeshima (J. Symb. Comput., 1989)

On Determining the Solvability of Polynomials. - Kazuhiro Yokoyama; Masayuki Noro; Taku Takeshima (ISSAC, 1990)

On Factoring Multi-Variate Polynomials over Algebraically Closed Fields (abstract). - Kazuhiro Yokoyama; Masayuki Noro; Taku Takeshima (ISSAC, 1990)

On distance transitive graphs whose automorphism groups are affine. - Kazuhiro Yokoyama (J. Comb. Theory B, 1992)

Solutions of Systems of Algebraic Equations and Linear Maps on Residue Class Rings. - Kazuhiro Yokoyama; Masayuki Noro; Taku Takeshima (J. Symb. Comput., 1992)

On Hensel Construction of Eigenvalues and Eigenvectors of Matrices with Polynomial Entries. - Kazuhiro Yokoyama; Taku Takeshima (ISSAC, 1993)

Multi-Modular Approach to Polynomial-Time Factorization of Bivariate Integral Polynomials. - Kazuhiro Yokoyama; Masayuki Noro; Taku Takeshima (J. Symb. Comput., 1994)

Finding Roots of Unity Among Quotients of the Roots of an Integral Polynomial. - Kazuhiro Yokoyama; Ziming Li 002; István Nemes (ISSAC, 1995)

Localization and Primary Decomposition of Polynomial Ideals. - Takeshi Shimoyama; Kazuhiro Yokoyama (J. Symb. Comput., 1996)

Efficient Implementation of Schoof's Algorithm. - Tetsuya Izu; Jun Kogure; Masayuki Noro; Kazuhiro Yokoyama (ASIACRYPT, 1998)

Parameters for Secure Elliptic Curve Cryptosystem - Improvements on Schoof's Algorithm. - Tetsuya Izu; Jun Kogure; Masayuki Noro; Kazuhiro Yokoyama (Public Key Cryptography, 1998)

A Modular Method to Compute the Rational Univariate Representation of Zero-dimensional Ideals. - Masayuki Noro; Kazuhiro Yokoyama (J. Symb. Comput., 1999)

Efficient Implementation of Schoof's Algorithm in Case of Characteristic 2. - Tetsuya Izu; Jun Kogure; Kazuhiro Yokoyama (Public Key Cryptography, 2000)

Special Issue on Algorithmic Methods in Galois Theory - Foreword of the Guest Editors. - B. Heinrich Matzat; John McKay 001; Kazuhiro Yokoyama (J. Symb. Comput., 2000)

The Block Cipher SC2000. - Takeshi Shimoyama; Hitoshi Yanami; Kazuhiro Yokoyama; Masahiko Takenaka; Kouichi Itoh; Jun Yajima; Naoya Torii; Hidema Tanaka (FSE, 2001)

Yet another practical implementation of polynomial factorization over finite fields. - Masayuki Noro; Kazuhiro Yokoyama (ISSAC, 2002)

Implementation of prime decomposition of polynomial ideals over small finite fields. - Masayuki Noro; Kazuhiro Yokoyama (SIGSAM Bull., 2003)

On systems of algebraic equations with parametric exponents. - Kazuhiro Yokoyama (ISSAC, 2004)

Cylindrical Algebraic Decomposition via Numerical Computation with Validated Symbolic Reconstruction. - Hirokazu Anai; Kazuhiro Yokoyama (Algorithmic Algebra and Logic, 2005)

Sum of roots with positive real parts. - Hirokazu Anai; Shinji Hara; Kazuhiro Yokoyama (ISSAC, 2005)

A Modular Method for Computing the Splitting Field of a Polynomial. - Guénaël Renault; Kazuhiro Yokoyama (ANTS, 2006)

Stability of Parametric Decomposition. - Kazuhiro Yokoyama (ICMS, 2006)

On the Relationship Between the Sum of Roots with Positive Real Parts and Polynomial Spectral Factorization. - Masaaki Kanno; Hirokazu Anai; Kazuhiro Yokoyama (Numerical Methods and Applications, 2006)

Sum of roots, polynomial spectral factorization, and control performance limitations. - Masaaki Kanno; Shinji Hara; Hirokazu Anai; Kazuhiro Yokoyama (CDC, 2007)

Parametric optimization in control using the sum of roots for parametric polynomial spectral factorization. - Masaaki Kanno; Kazuhiro Yokoyama; Hirokazu Anai; Shinji Hara (ISSAC, 2007)

On systems of algebraic equations with parametric exponents II. - Kazuhiro Yokoyama (Appl. Algebra Eng. Commun. Comput., 2007)

Symbolic optimization of algebraic functions. - Masaaki Kanno; Kazuhiro Yokoyama; Hirokazu Anai; Shinji Hara (ISSAC, 2008)

Multi-modular algorithm for computing the splitting field of a polynomial. - Guénaël Renault; Kazuhiro Yokoyama (ISSAC, 2008)

Solution of the algebraic riccati equation using the sum of roots. - Masaaki Kanno; Kazuhiro Yokoyama; Hirokazu Anai (ACM Commun. Comput. Algebra, 2008)

Solution of algebraic riccati equations using the sum of roots. - Masaaki Kanno; Kazuhiro Yokoyama; Hirokazu Anai; Shinji Hara (ISSAC, 2009)

Computation schemes for splitting fields of polynomials. - Sébastien Orange; Guénaël Renault; Kazuhiro Yokoyama (ISSAC, 2009)

Parametric polynomial spectral factorization using the sum of roots and its application to a control design problem. - Hirokazu Anai; Shinji Hara; Masaaki Kanno; Kazuhiro Yokoyama (J. Symb. Comput., 2009)

Gröbner Basis Technique for Algebraic Formulas in Electron Correlation Theories. - Takeshi Osoekawa; Naoyuki Shinohara; Yuji Mochizuki; Kazuhiro Yokoyama (ICCSA Workshops, 2010)

Development of QC2AS - A Computer Algebra System for Symbolic Quantum Chemical Computations. - Takeshi Osoekawa; Yuji Mochizuki; Kazuhiro Yokoyama (ICCSA Workshops, 2011)

Optimizing a Particular Real Root of a Polynomial by a Special Cylindrical Algebraic Decomposition. - Silvia Gandy; Masaaki Kanno; Hirokazu Anai; Kazuhiro Yokoyama (Math. Comput. Sci., 2011)

Usage of Modular Techniques for Efficient Computation of Ideal Operations - (Invited Talk). - Kazuhiro Yokoyama (CASC, 2012)

Efficient Arithmetic in Successive Algebraic Extension Fields Using Symmetries. - Sébastien Orange; Guénaël Renault; Kazuhiro Yokoyama (Math. Comput. Sci., 2012)

Packed Homomorphic Encryption Based on Ideal Lattices and Its Application to Biometrics. - Masaya Yasuda; Takeshi Shimoyama; Jun Kogure; Kazuhiro Yokoyama; Takeshi Koshiba (CD-ARES Workshops, 2013)

Secure pattern matching using somewhat homomorphic encryption. - Masaya Yasuda; Takeshi Shimoyama; Jun Kogure; Kazuhiro Yokoyama; Takeshi Koshiba (CCSW, 2013)

Practical Packing Method in Somewhat Homomorphic Encryption. - Masaya Yasuda; Takeshi Shimoyama; Jun Kogure; Kazuhiro Yokoyama; Takeshi Koshiba (DPM/SETOP, 2013)

An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination. - Hidenao Iwane; Hitoshi Yanami; Hirokazu Anai; Kazuhiro Yokoyama (Theor. Comput. Sci., 2013)

Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption. - Masaya Yasuda; Takeshi Shimoyama; Jun Kogure; Kazuhiro Yokoyama; Takeshi Koshiba (ACISP, 2014)

Verification of Gröbner Basis Candidates. - Masayuki Noro; Kazuhiro Yokoyama (ICMS, 2014)

On the exact decryption range for Gentry-Halevi's implementation of fully homomorphic encryption. - Masaya Yasuda; Kazuhiro Yokoyama; Takeshi Shimoyama; Jun Kogure; Takeshi Koshiba (J. Math. Cryptol., 2014)

Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption. - Masaya Yasuda; Takeshi Shimoyama; Jun Kogure; Kazuhiro Yokoyama; Takeshi Koshiba (ACISP, 2015)

Secure Data Devolution: Practical Re-encryption with Auxiliary Data in LWE-based Somewhat Homomorphic Encryption. - Masaya Yasuda; Takeshi Koshiba; Takeshi Shimoyama; Jun Kogure; Kazuhiro Yokoyama (SCC@ASIACCS, 2015)

New packing method in somewhat homomorphic encryption and its applications. - Masaya Yasuda; Takeshi Shimoyama; Jun Kogure; Kazuhiro Yokoyama; Takeshi Koshiba (Secur. Commun. Networks, 2015)

A Tropical F5 Algorithm. - Tristan Vaccon; Kazuhiro Yokoyama (ISSAC, 2017)

Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors. - Masaya Yasuda; Kazuhiro Yokoyama; Takeshi Shimoyama; Jun Kogure; Takeshi Koshiba (J. Math. Cryptol., 2017)

Special issue on the conference ISSAC 2015: Symbolic computation and computer algebra. - Kazuhiro Yokoyama (J. Symb. Comput., 2017)

Effective Localization Using Double Ideal Quotient and Its Implementation. - Yuki Ishihara; Kazuhiro Yokoyama (CASC, 2018)

Usage of Modular Techniques for Efficient Computation of Ideal Operations. - Masayuki Noro; Kazuhiro Yokoyama (Math. Comput. Sci., 2018)

Hybrid Meet-in-the-Middle Attacks for the Isogeny Path-Finding Problem. - Yasuhiko Ikematsu; Ryoya Fukasaku; Momonari Kudo; Masaya Yasuda; Katsuyuki Takashima; Kazuhiro Yokoyama (APKC@AsiaCCS, 2020)

On FGLM algorithms with tropical Gröbner bases. - Yuki Ishihara; Tristan Vaccon; Kazuhiro Yokoyama (ISSAC, 2020)

Complexity bounds on Semaev's naive index calculus method for ECDLP. - Kazuhiro Yokoyama; Masaya Yasuda; Yasushi Takahashi; Jun Kogure (J. Math. Cryptol., 2020)

Implementation Report of the Kohel-Lauter-Petit-Tignol Algorithm for the Constructive Deuring Correspondence. - Yuta Kambe; Yusuke Aikawa; Momonari Kudo; Masaya Yasuda; Katsuyuki Takashima; Kazuhiro Yokoyama (ICMC, 2021)

Algebraic approaches for solving isogeny problems of prime power degrees. - Yasushi Takahashi; Momonari Kudo; Ryoya Fukasaku; Yasuhiko Ikematsu; Masaya Yasuda; Kazuhiro Yokoyama (J. Math. Cryptol., 2021)

On affine tropical F5 algorithms. - Tristan Vaccon; Thibaut Verron; Kazuhiro Yokoyama (J. Symb. Comput., 2021)

Learning to compute Gröbner bases. - Hiroshi Kera; Yuki Ishihara; Yuta Kambe; Tristan Vaccon; Kazuhiro Yokoyama (NeurIPS, 2024)

Gröbner basis computation via learning. - Hiroshi Kera; Yuki Ishihara; Tristan Vaccon; Kazuhiro Yokoyama (SCSS (Work in Progress), 2024)

Comprehensive Systems for Primary Decompositions of Parametric Ideals. - Yuki Ishihara; Kazuhiro Yokoyama (CoRR, 2024)

Generalized cryptographic semi-regular sequences: A variant of Fröberg conjecture and a simple complexity estimation for Gröbner basis computation. - Momonari Kudo; Kazuhiro Yokoyama (CoRR, 2024)

On Hilbert-Poincaré series of affine semi-regular polynomial sequences and related Gröbner bases. - Momonari Kudo; Kazuhiro Yokoyama (IACR Cryptol. ePrint Arch., 2024)

The solving degrees for computing Gröbner bases of affine semi-regular polynomial sequences. - Momonari Kudo; Kazuhiro Yokoyama (IACR Cryptol. ePrint Arch., 2024)

Generalization of semi-regular sequences: Maximal Gröbner basis degree, variants of genericness, and related conjectures. - Momonari Kudo; Kazuhiro Yokoyama (IACR Cryptol. ePrint Arch., 2025)