On Classification of Quantum Channels. - Satoshi Iriyama; Noboru Watanabe (Open Syst. Inf. Dyn., 2001)

Rigorous Estimation of Computational Complexity for OMV SAT Algorithm. - Satoshi Iriyama; Masanori Ohya (Open Syst. Inf. Dyn., 2008)

Language Classes Defined by Generalized Quantum Turing Machine. - Satoshi Iriyama; Masanori Ohya (Open Syst. Inf. Dyn., 2008)

On Generalized Quantum Turing Machine and Its Applications. - Satoshi Iriyama; Masanori Ohya (Open Syst. Inf. Dyn., 2009)

Computational complexity and applications of quantum algorithm. - Satoshi Iriyama; Masanori Ohya (Appl. Math. Comput., 2012)

Polynomial Time Quantum Algorithm for Search Problem and Its Application. - Satoshi Iriyama; Masanori Ohya (QI, 2013)

On efficien quantum algorithm using classical amplificatio process. - Satoshi Iriyama; Masanori Ohya (ICCI*CC, 2014)

On Quantum Algorithm for Binary Search and Its Computational Complexity. - Satoshi Iriyama; Masanori Ohya; Igor V. Volovich (Open Syst. Inf. Dyn., 2015)

Chaos Amplification Process Can Be Described by the GKSL Master Equation. - K. Furusho; Satoshi Iriyama; Masanori Ohya (Open Syst. Inf. Dyn., 2017)

A New Class of Strongly Asymmetric PKA Algorithms: SAA-5. - Luigi Accardi; Satoshi Iriyama; Koki Jimbo; Massimo Regoli (Cryptogr., 2019)

New Authentication Algorithm Based on Verifiable Encryption with Digital Identity. - Maki Kihara; Satoshi Iriyama (Cryptogr., 2019)

Implementation of a New Strongly-Asymmetric Algorithm and Its Optimization. - Koki Jimbo; Satoshi Iriyama; Massimo Regoli (Cryptogr., 2020)

Security and Performance of Single Sign-on Based on One-Time Pad Algorithm. - Maki Kihara; Satoshi Iriyama (Cryptogr., 2020)

Security Verification of an Authentication Algorithm Based on Verifiable Encryption. - Maki Kihara; Satoshi Iriyama (Inf., 2023)