default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShigenori Uchiyama
2020 – today
- 2023
[j27]Takashi Kurokawa
, Takuma Ito, Naoyuki Shinohara, Akihiro Yamamura, Shigenori Uchiyama:
Selection Strategy of F4-Style Algorithm to Solve MQ Problems Related to MPKC. Cryptogr. 7(1): 10 (2023)- [j26]Takuma Ito, Koutaro Kobayashi, Takashi Kurokawa, Naoyuki Shinohara, Shigenori Uchiyama:
A technique to reduce memory usage of M4GB algorithm. JSIAM Lett. 15: 125-128 (2023) - 2022
- [j25]Takuma Ito, Yuta Hoshi, Naoyuki Shinohara, Shigenori Uchiyama:
Polynomial selection of F4 for solving the MQ problem. JSIAM Lett. 14: 135-138 (2022) - 2021
- [j24]Takuma Ito, Naoyuki Shinohara, Shigenori Uchiyama:
Solving the MQ Problem Using Gröbner Basis Techniques. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(1): 135-142 (2021) - [j23]Takuma Ito, Atsushi Nitta, Yuta Hoshi, Naoyuki Shinohara, Shigenori Uchiyama:
Polynomial selection for computing Gröbner bases. JSIAM Lett. 13: 72-75 (2021)
2010 – 2019
- 2019
- [j22]Osamu Kikuchi, Shigenori Uchiyama:
A note on the prime factorization method by Nemec et al. JSIAM Lett. 11: 41-44 (2019) - [j21]Saki Nagashima, Naoyuki Shinohara, Shigenori Uchiyama:
Quadratic Frobenius pseudoprimes with respect to $x^{2}+5x+5$. JSIAM Lett. 11: 53-55 (2019) - [c12]Takuma Ito, Naoyuki Shinohara, Shigenori Uchiyama:
An Efficient F_4 -style Based Algorithm to Solve MQ Problems. IWSEC 2019: 37-52 - 2016
- [j20]Hiroshi Onuki, Tadanori Teruya, Naoki Kanayama, Shigenori Uchiyama:
The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets. JSIAM Lett. 8: 9-12 (2016) - [c11]Hiroshi Onuki, Tadanori Teruya, Naoki Kanayama, Shigenori Uchiyama:
Faster Explicit Formulae for Computing Pairings via Elliptic Nets and Their Parallel Computation. IWSEC 2016: 319-334 - 2015
- [j19]Akihiko Onishi, Yukihiro Uchida, Shigenori Uchiyama:
A small secret exponent attack on cryptosystems using Dickson polynomials. JSIAM Lett. 7: 41-43 (2015) - 2014
- [j18]Naoki Kanayama, Yang Liu, Eiji Okamoto, Kazutaka Saito, Tadanori Teruya, Shigenori Uchiyama:
Implementation of an Elliptic Curve Scalar Multiplication Method Using Division Polynomials. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(1): 300-302 (2014) - [j17]Kazuki Azami, Shigenori Uchiyama:
Primality testing of Woodall numbers. JSIAM Lett. 6: 1-4 (2014) - [j16]Junichi Yarimizu, Yukihiro Uchida, Shigenori Uchiyama:
The elliptic curve Diffie-Hellman problem and an equivalent hard problem for elliptic divisibility sequences. JSIAM Lett. 6: 5-7 (2014) - [j15]Yasunori Mineo, Shigenori Uchiyama:
Scalar multiplication for twisted Edwards curves using the extended double-base number system. JSIAM Lett. 6: 37-39 (2014) - [j14]Yang Liu, Naoki Kanayama, Kazutaka Saito, Tadanori Teruya, Shigenori Uchiyama, Eiji Okamoto:
Computing fixed argument pairings with the elliptic net algorithm. JSIAM Lett. 6: 69-72 (2014) - 2012
- [j13]Naoki Ogura, Shigenori Uchiyama, Naoki Kanayama, Eiji Okamoto:
A Note on the Pairing Computation Using Normalized Miller Functions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(1): 196-203 (2012) - [j12]Naotoshi Sakurada, Junichi Yarimizu, Naoki Ogura, Shigenori Uchiyama:
An integer factoring algorithm based on elliptic divisibility sequences. JSIAM Lett. 4: 21-23 (2012) - [c10]Yukihiro Uchida, Shigenori Uchiyama:
The Tate-Lichtenbaum Pairing on a Hyperelliptic Curve via Hyperelliptic Nets. Pairing 2012: 218-233 - 2011
- [j11]Satoshi Harada, Yuichi Wada, Shigenori Uchiyama, Hiro-o Tokunaga:
On the reduction attack against the algebraic surface public-key cryptosystem(ASC04). JSIAM Lett. 3: 53-56 (2011) - [c9]Naoki Ogura, Naoki Kanayama, Shigenori Uchiyama, Eiji Okamoto:
Cryptographic Pairings Based on Elliptic Nets. IWSEC 2011: 65-78 - 2010
- [j10]Naoki Ogura, Shigenori Uchiyama:
On Patarin's Attack against the lIC Scheme. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(1): 34-41 (2010) - [j9]Naoki Ogura, Shigenori Uchiyama:
Cryptanalysis of the birational permutation signature scheme over a non-commutative ring. JSIAM Lett. 2: 85-88 (2010) - [j8]Naoki Ogura, Shigenori Uchiyama:
Erratum to "Cryptanalysis of the birational permutation signature scheme over a non-commutative ring" [JSIAM Letters, 2 (2010), 85-88]. JSIAM Lett. 2: 89 (2010) - [c8]Satoru Tanaka, Naoki Ogura, Ken Nakamula, Tetsushi Matsui, Shigenori Uchiyama:
NZMATH 1.0. ICMS 2010: 260-269 - [c7]Naoki Ogura, Go Yamamoto, Tetsutaro Kobayashi, Shigenori Uchiyama:
An Improvement of Key Generation Algorithm for Gentry's Homomorphic Encryption Scheme. IWSEC 2010: 70-83 - [i3]Naoki Ogura, Naoki Kanayama, Shigenori Uchiyama, Eiji Okamoto:
Cryptographic Pairings Based on Elliptic Nets. IACR Cryptol. ePrint Arch. 2010: 353 (2010)
2000 – 2009
- 2009
- [j7]Shigenori Uchiyama:
Simple Remarks on Carmichael Numbers. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(1): 326-328 (2009) - [i2]Naoki Ogura, Shigenori Uchiyama:
Cryptanalysis of the Birational Permutation Signature Scheme over a Non-commutative Ring. IACR Cryptol. ePrint Arch. 2009: 245 (2009) - 2008
- [c6]Naoki Ogura, Shigenori Uchiyama:
Remarks on the Attack of Fouque et al. against the lIC Scheme. IWSEC 2008: 34-48 - [i1]Naoki Ogura, Shigenori Uchiyama:
Remarks on the Attack of Fouque et al. against the lIC Scheme. IACR Cryptol. ePrint Arch. 2008: 208 (2008) - 2007
- [j6]Koji Chida, Go Yamamoto, Koutarou Suzuki, Shigenori Uchiyama, Noburou Taniguchi, Osamu Shionoiri, Atsushi Kanai:
Non-optimistic Secure Circuit Evaluation Based on ElGamal Encryption and Its Applications. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(1): 128-138 (2007) - [j5]Naoki Kanayama, Shigenori Uchiyama:
The Vanstone-Zuccherato Schemes Revisited. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(12): 2903-2907 (2007) - 2006
- [j4]Taiichi Saito, Fumitaka Hoshino, Shigenori Uchiyama, Tetsutaro Kobayashi:
Candidate One-Way Functions on Non-Supersingular Elliptic Curves. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(1): 144-150 (2006) - 2005
- [c5]Go Yamamoto, Koji Chida, Anderson C. A. Nascimento, Koutarou Suzuki, Shigenori Uchiyama:
Efficient, Non-optimistic Secure Circuit Evaluation Based on the ElGamal Encryption. WISA 2005: 328-342 - 2004
- [j3]Koh-ichi Nagao, Shigenori Uchiyama, Naoki Kanayama, Kazuto Matsuo:
Analysis of Baby-Step Giant-Step Algorithms for Non-uniform Distributions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 87-A(1): 10-17 (2004) - 2003
- [j2]Naoki Kanayama, Koh-ichi Nagao, Shigenori Uchiyama:
Generating Secure Genus Two Hyperelliptic Curves Using Elkies' Point Counting Algorithm. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(4): 919-927 (2003) - 2002
- [j1]Koji Chida, Shigenori Uchiyama, Taiichi Saito:
A New Factoring Method of Integers N=pr ✕ q for Large r. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(5): 1050-1053 (2002) - [c4]Qi Cheng, Shigenori Uchiyama:
Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture. CT-RSA 2002: 290-299 - 2000
- [c3]Tatsuaki Okamoto, Keisuke Tanaka, Shigenori Uchiyama:
Quantum Public-Key Cryptosystems. CRYPTO 2000: 147-165
1990 – 1999
- 1998
- [c2]Tatsuaki Okamoto, Shigenori Uchiyama:
A New Public-Key Cryptosystem as Secure as Factoring. EUROCRYPT 1998: 308-318 - [c1]Tatsuaki Okamoto, Shigenori Uchiyama:
Security of an Identity-Based Cryptosystem and the Related Reductions. EUROCRYPT 1998: 546-560
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.
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.
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.
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 2025-03-04 21:10 CET 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:
