![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Satoshi Iriyama
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
- [j12]Maki Kihara
, Satoshi Iriyama
:
Security Verification of an Authentication Algorithm Based on Verifiable Encryption. Inf. 14(2): 126 (2023) - 2020
- [j11]Maki Kihara
, Satoshi Iriyama:
Security and Performance of Single Sign-on Based on One-Time Pad Algorithm. Cryptogr. 4(2): 16 (2020) - [j10]Koki Jimbo
, Satoshi Iriyama, Massimo Regoli
:
Implementation of a New Strongly-Asymmetric Algorithm and Its Optimization. Cryptogr. 4(3): 21 (2020) - 2019
- [j9]Luigi Accardi, Satoshi Iriyama
, Koki Jimbo, Massimo Regoli
:
A New Class of Strongly Asymmetric PKA Algorithms: SAA-5. Cryptogr. 3(1): 9 (2019) - [j8]Maki Kihara
, Satoshi Iriyama:
New Authentication Algorithm Based on Verifiable Encryption with Digital Identity. Cryptogr. 3(3): 19 (2019) - 2017
- [j7]K. Furusho, Satoshi Iriyama, Masanori Ohya:
Chaos Amplification Process Can Be Described by the GKSL Master Equation. Open Syst. Inf. Dyn. 24(2): 1750008:1-1750008:14 (2017) - 2015
- [j6]Satoshi Iriyama, Masanori Ohya, Igor V. Volovich
:
On Quantum Algorithm for Binary Search and Its Computational Complexity. Open Syst. Inf. Dyn. 22(3): 1550019:1-1550019:9 (2015) - 2012
- [j5]Satoshi Iriyama, Masanori Ohya:
Computational complexity and applications of quantum algorithm. Appl. Math. Comput. 218(16): 8019-8028 (2012) - 2009
- [j4]Satoshi Iriyama, Masanori Ohya:
On Generalized Quantum Turing Machine and Its Applications. Open Syst. Inf. Dyn. 16(2-3): 195-204 (2009) - 2008
- [j3]Satoshi Iriyama, Masanori Ohya:
Rigorous Estimation of Computational Complexity for OMV SAT Algorithm. Open Syst. Inf. Dyn. 15(2): 173-188 (2008) - [j2]Satoshi Iriyama, Masanori Ohya:
Language Classes Defined by Generalized Quantum Turing Machine. Open Syst. Inf. Dyn. 15(4): 383-396 (2008) - 2001
- [j1]Satoshi Iriyama, Noboru Watanabe:
On Classification of Quantum Channels. Open Syst. Inf. Dyn. 8(1): 73-88 (2001)
Conference and Workshop Papers
- 2014
- [c2]Satoshi Iriyama, Masanori Ohya:
On efficien quantum algorithm using classical amplificatio process. ICCI*CC 2014: 88-93 - 2013
- [c1]Satoshi Iriyama, Masanori Ohya:
Polynomial Time Quantum Algorithm for Search Problem and Its Application. QI 2013: 172-183
Informal and Other Publications
- 2013
- [i1]Satoshi Iriyama, Masanori Ohya, Igor V. Volovich:
On Quantum Algorithm for Binary Search and Its Computational Complexity. CoRR abs/1306.5039 (2013)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint