default search action
Naoyuki Shinohara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j13]Takashi Kurokawa
, Takuma Ito, Naoyuki Shinohara, Akihiro Yamamura
Selection Strategy of F4-Style Algorithm to Solve MQ Problems Related to MPKC. Cryptogr. 7(1): 10 (2023) - [j12]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
- [j11]Takuma Ito, Yuta Hoshi, Naoyuki Shinohara, Shigenori Uchiyama:
Polynomial selection of F4 for solving the MQ problem. JSIAM Lett. 14: 135-138 (2022) - 2021
- [j10]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) - [j9]Takuma Ito, Atsushi Nitta, Yuta Hoshi, Naoyuki Shinohara, Shigenori Uchiyama:
Polynomial selection for computing Gröbner bases. JSIAM Lett. 13: 72-75 (2021) - [i7]Yoshinori Aono, Sitong Liu, Tomoki Tanaka, Shumpei Uno, Rodney Van Meter, Naoyuki Shinohara, Ryo Nojima:
The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers. CoRR abs/2111.06102 (2021) - 2020
- [j8]Yusuke Takemura, Keisuke Hakuta, Naoyuki Shinohara:
ECC Atomic Block with NAF against Strong Side-Channel Attacks on Binary Curves. Int. J. Netw. Comput. 10(2): 277-292 (2020)
2010 – 2019
- 2019
- [j7]Saki Nagashima, Naoyuki Shinohara, Shigenori Uchiyama:
Quadratic Frobenius pseudoprimes with respect to $x^{2}+5x+5$. JSIAM Lett. 11: 53-55 (2019) - [c9]Yusuke Takemura, Keisuke Hakuta, Naoyuki Shinohara:
ECC Atomic Block against Strong Side-Channel Attacks Using Binary Curves. CANDAR Workshops 2019: 387-393 - [c8]Takuma Ito, Naoyuki Shinohara, Shigenori Uchiyama:
An Efficient F_4 -style Based Algorithm to Solve MQ Problems. IWSEC 2019: 37-52 - 2015
- [i6]Yun-Ju Huang, Christophe Petit, Naoyuki Shinohara, Tsuyoshi Takagi:
On Generalized First Fall Degree Assumptions. IACR Cryptol. ePrint Arch. 2015: 358 (2015) - 2014
- [j6]Naoyuki Shinohara, Takeshi Shimoyama, Takuya Hayashi
Key Length Estimation of Pairing-Based Cryptosystems Using ηT Pairing over GF(3n). IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(1): 236-244 (2014) - [j5]Noboru Kunihiro
Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1273-1284 (2014) - [j4]Noboru Kunihiro
A Unified Framework for Small Secret Exponent Attack on RSA. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1285-1295 (2014) - 2013
- [c7]Yun-Ju Huang, Christophe Petit
Improvement of Faugère et al.'s Method to Solve ECDLP. IWSEC 2013: 115-132 - [c6]Noboru Kunihiro
Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors. Public Key Cryptography 2013: 180-197 - 2012
- [j3]Takuya Hayashi
Solving a 676-Bit Discrete Logarithm Problem in GF(36n). IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(1): 204-212 (2012) - [c5]Takuya Hayashi
Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397). ASIACRYPT 2012: 43-60 - [c4]Naoyuki Shinohara, Takeshi Shimoyama, Takuya Hayashi
Key Length Estimation of Pairing-Based Cryptosystems Using η T Pairing. ISPEC 2012: 228-244 - [i5]Naoyuki Shinohara, Takeshi Shimoyama, Takuya Hayashi, Tsuyoshi Takagi:
Key Length Estimation of Pairing-based Cryptosystems using ηT Pairing. IACR Cryptol. ePrint Arch. 2012: 42 (2012) - [i4]Takuya Hayashi, Takeshi Shimoyama, Naoyuki Shinohara, Tsuyoshi Takagi:
Breaking pairing-based cryptosystems using ηT pairing over GF(397). IACR Cryptol. ePrint Arch. 2012: 345 (2012) - [i3]Noboru Kunihiro, Naoyuki Shinohara, Tetsuya Izu:
Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors. IACR Cryptol. ePrint Arch. 2012: 701 (2012) - 2011
- [j2]Naoyuki Shinohara, Tetsuya Izu, Noboru Kunihiro
Small Secret CRT-Exponent Attacks on Takagi's RSA. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(1): 19-27 (2011) - [c3]Noboru Kunihiro
A Unified Framework for Small Secret Exponent Attack on RSA. Selected Areas in Cryptography 2011: 260-277 - [i2]Noboru Kunihiro, Naoyuki Shinohara, Tetsuya Izu:
A Unified Framework for Small Secret Exponent Attack on RSA. IACR Cryptol. ePrint Arch. 2011: 591 (2011) - 2010
- [c2]Takeshi Osoekawa, Naoyuki Shinohara, Yuji Mochizuki, Kazuhiro Yokoyama:
Gröbner Basis Technique for Algebraic Formulas in Electron Correlation Theories. ICCSA Workshops 2010: 17-23 - [c1]Takuya Hayashi
Solving a 676-Bit Discrete Logarithm Problem in GF(36n). Public Key Cryptography 2010: 351-367 - [i1]Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shin'ichiro Matsuo, Masaaki Shirase, Tsuyoshi Takagi:
Solving a 676-bit Discrete Logarithm Problem in GF(36n). IACR Cryptol. ePrint Arch. 2010: 90 (2010)
2000 – 2009
- 2008
- [j1]Naoyuki Shinohara:
Inefficacious Conditions of the Frobenius Primality Test and Grantham's Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(11): 3325-3334 (2008)
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-04-25 05:48 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: