Mitsuru Kawazoe

Orcid: 0000-0002-9377-9409

According to our database1, Mitsuru Kawazoe authored at least 14 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Scaling Ethereum 2.0's Cross-Shard Transactions With Efficient Verification and Aggregation of KZG Commitments.
IEEE Internet Things J., October, 2024

2023
Analysis of Teachers' Tacit Knowledge-based Evaluation of Learner Competencies Using Machine Learning Approach.
Proceedings of the 14th IIAI International Congress on Advanced Applied Informatics, 2023

2018
Intelligent Editor for Authoring Educational Materials in Mathematics e-Learning Systems.
Proceedings of the Mathematical Software - ICMS 2018, 2018

2010
Construction of Pairing-Friendly Hyperelliptic Curves Based on the Closed Formulae of the Order of the Jacobian Group.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

2008
Pairing-friendly Hyperelliptic Curves with Ordinary Jacobians of Type y<sup>2</sup>=x<sup>5</sup>+ax.
IACR Cryptol. ePrint Arch., 2008

2007
Algebraic Cryptanalysis of 58-Round SHA-1.
Proceedings of the Fast Software Encryption, 14th International Workshop, 2007

2006
Relation between the XL Algorithm and Gröbner Basis Algorithms.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Gröbner Basis Based Cryptanalysis of SHA-1.
IACR Cryptol. ePrint Arch., 2006

Pairing-friendly elliptic curves with small security loss by Cheon's algorithm.
IACR Cryptol. ePrint Arch., 2006

2005
Suitable Curves for Genus-4 HCC over Prime Fields: Point Counting Formulae for Hyperelliptic Curves of Type <i>y</i><sup>2</sup>=<i>x</i><sup>2<i>k</i>+1</sup>+<i>ax</i>.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004
Relation between XL algorithm and Gröbner Bases Algorithms.
IACR Cryptol. ePrint Arch., 2004

Suitable Curves for Genus-4 HCC over Prime Fields: Point Counting Formulae for Hyperelliptic Curves of type y<sup>2</sup>=x<sup>2k+1</sup>+ax.
IACR Cryptol. ePrint Arch., 2004

Comparison Between XL and Gröbner Basis Algorithms.
Proceedings of the Advances in Cryptology, 2004

2002
Counting Points for Hyperelliptic Curves of type y<sup>2</sup>x<sup>5</sup>+ax over Finite Prime Fields.
IACR Cryptol. ePrint Arch., 2002


  Loading...