default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMitsuru Kawazoe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Alexander Kudzin
, Kentaroh Toyoda, Mitsuru Kawazoe, Satoshi Takayama, Atsushi Ishigame:
Scaling Ethereum 2.0's Cross-Shard Transactions With Efficient Verification and Aggregation of KZG Commitments. IEEE Internet Things J. 11(19): 31822-31835 (2024)- 2023
- [c8]Haruki Ueno, Mitsuru Kawazoe, Hiroshi Komatsugawa:
Analysis of Teachers' Tacit Knowledge-based Evaluation of Learner Competencies Using Machine Learning Approach. IIAI-AAI 2023: 713-714
2010 – 2019
- 2018
- [c7]Shizuka Shirai, Tetsuo Fukui, Kentaro Yoshitomi, Mitsuru Kawazoe, Takahiro Nakahara, Yasuyuki Nakamura, Katsuya Kato, Tetsuya Taniguchi:
Intelligent Editor for Authoring Educational Materials in Mathematics e-Learning Systems. ICMS 2018: 431-437 - 2010
- [j2]Aya Comuta, Mitsuru Kawazoe, Tetsuya Takahashi, Isamu Yoshizawa:
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. 93-A(6): 1132-1139 (2010)
2000 – 2009
- 2008
- [c6]Mitsuru Kawazoe, Tetsuya Takahashi:
Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y2=x5ax. Pairing 2008: 164-177 - [i6]Mitsuru Kawazoe, Tetsuya Takahashi:
Pairing-friendly Hyperelliptic Curves with Ordinary Jacobians of Type y2=x5+ax. IACR Cryptol. ePrint Arch. 2008: 26 (2008) - 2007
- [c5]Makoto Sugita, Mitsuru Kawazoe, Ludovic Perret, Hideki Imai:
Algebraic Cryptanalysis of 58-Round SHA-1. FSE 2007: 349-365 - [c4]Aya Comuta, Mitsuru Kawazoe, Tetsuya Takahashi:
Pairing-Friendly Elliptic Curves with Small Security Loss by Cheon's Algorithm. ICISC 2007: 297-308 - 2006
- [j1]Makoto Sugita, Mitsuru Kawazoe, Hideki Imai:
Relation between the XL Algorithm and Gröbner Basis Algorithms. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(1): 11-18 (2006) - [i5]Makoto Sugita, Mitsuru Kawazoe, Hideki Imai:
Gröbner Basis Based Cryptanalysis of SHA-1. IACR Cryptol. ePrint Arch. 2006: 98 (2006) - [i4]Aya Comuta, Mitsuru Kawazoe, Tetsuya Takahashi:
Pairing-friendly elliptic curves with small security loss by Cheon's algorithm. IACR Cryptol. ePrint Arch. 2006: 427 (2006) - 2005
- [c3]Mitsuhiro Haneda, Mitsuru Kawazoe, Tetsuya Takahashi:
Suitable Curves for Genus-4 HCC over Prime Fields: Point Counting Formulae for Hyperelliptic Curves of Type y2=x2k+1+ax. ICALP 2005: 539-550 - 2004
- [c2]Gwénolé Ars, Jean-Charles Faugère, Hideki Imai, Mitsuru Kawazoe, Makoto Sugita:
Comparison Between XL and Gröbner Basis Algorithms. ASIACRYPT 2004: 338-353 - [i3]Makoto Sugita, Mitsuru Kawazoe, Hideki Imai:
Relation between XL algorithm and Gröbner Bases Algorithms. IACR Cryptol. ePrint Arch. 2004: 112 (2004) - [i2]Mitsuhiro Haneda, Mitsuru Kawazoe, Tetsuya Takahashi:
Suitable Curves for Genus-4 HCC over Prime Fields: Point Counting Formulae for Hyperelliptic Curves of type y2=x2k+1+ax. IACR Cryptol. ePrint Arch. 2004: 151 (2004) - 2003
- [c1]Eisaku Furukawa, Mitsuru Kawazoe, Tetsuya Takahashi:
Counting Points for Hyperelliptic Curves of Type y2= x5 + ax over Finite Prime Fields. Selected Areas in Cryptography 2003: 26-41 - 2002
- [i1]Eisaku Furukawa, Mitsuru Kawazoe, Tetsuya Takahashi:
Counting Points for Hyperelliptic Curves of type y2x5+ax over Finite Prime Fields. IACR Cryptol. ePrint Arch. 2002: 181 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 20:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
