default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShuhei Nakamura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i8]Shuhei Nakamura, Yusuke Tani, Hiroki Furue:
Lifting approach against the SNOVA scheme. IACR Cryptol. ePrint Arch. 2024: 1374 (2024)- 2023
- [j3]Shuhei Nakamura, Yacheng Wang, Yasuhiko Ikematsu:
A New Analysis of the Kipnis-Shamir Method Solving the MinRank Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(3): 203-211 (2023) - [j2]Yasuhiko Ikematsu
, Shuhei Nakamura, Tsuyoshi Takagi:
Recent progress in the security evaluation of multivariate public-key cryptography. IET Inf. Secur. 17(2): 210-226 (2023) - [i7]Shuhei Nakamura:
Admissible Parameter Sets and Complexity Estimation of Crossbred Algorithm. IACR Cryptol. ePrint Arch. 2023: 1687 (2023) - 2022
- [c5]Bagus Santoso, Yasuhiko Ikematsu, Shuhei Nakamura, Takanori Yasuda:
Three-Pass Identification Scheme Based on MinRank Problem with Half Cheating Probability. ISITA 2022: 59-63 - [i6]Bagus Santoso, Yasuhiko Ikematsu, Shuhei Nakamura, Takanori Yasuda:
Three-Pass Identification Scheme Based on MinRank Problem with Half Cheating Probability. CoRR abs/2205.03255 (2022) - 2021
- [j1]Shuhei Nakamura, Yasuhiko Ikematsu, Yacheng Wang, Jintai Ding, Tsuyoshi Takagi:
New complexity estimation on the Rainbow-Band-Separation attack. Theor. Comput. Sci. 896: 1-18 (2021) - [c4]Yasuhiko Ikematsu, Shuhei Nakamura, Bagus Santoso, Takanori Yasuda:
Security Analysis on an ElGamal-Like Multivariate Encryption Scheme Based on Isomorphism of Polynomials. Inscrypt 2021: 235-250 - [c3]Yasuhiko Ikematsu, Shuhei Nakamura:
Security Analysis via Algebraic Attack Against "A New Encryption Scheme for Multivariate Quadratic System". ICMC 2021: 9-21 - [c2]Hiroki Furue, Shuhei Nakamura, Tsuyoshi Takagi:
Improving Thomae-Wolf Algorithm for Solving Underdetermined Multivariate Quadratic Polynomial Problem. PQCrypto 2021: 65-78 - [i5]Yasuhiko Ikematsu, Shuhei Nakamura, Bagus Santoso, Takanori Yasuda:
Security Analysis on an El-Gamal-like Multivariate Encryption Scheme Based on Isomorphism of Polynomials. IACR Cryptol. ePrint Arch. 2021: 169 (2021) - 2020
- [c1]Yacheng Wang, Yasuhiko Ikematsu, Shuhei Nakamura, Tsuyoshi Takagi:
Revisiting the Minrank Problem on Multivariate Cryptography. WISA 2020: 291-307 - [i4]Shuhei Nakamura:
Formal Power Series on Algebraic Cryptanalysis. CoRR abs/2007.14729 (2020) - [i3]Yasuhiko Ikematsu, Shuhei Nakamura:
Security Analysis Against "A New Encryption Scheme for Multivariate Quadratic Systems". IACR Cryptol. ePrint Arch. 2020: 53 (2020) - [i2]Shuhei Nakamura, Yasuhiko Ikematsu, Yacheng Wang, Jintai Ding, Tsuyoshi Takagi:
New Complexity Estimation on the Rainbow-Band-Separation Attack. IACR Cryptol. ePrint Arch. 2020: 703 (2020) - [i1]Shuhei Nakamura, Yacheng Wang, Yasuhiko Ikematsu:
Analysis on the MinRank Attack using Kipnis-Shamir Method Against Rainbow. IACR Cryptol. ePrint Arch. 2020: 908 (2020)
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 2025-01-09 13:00 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:
