Kohtaro Watanabe

14 papers Journal 14
YearRankTypeTitle / Venue / Authors
2025 J jnl
Efficient Reconstruction in Key Recovery Attack on the QC-MDPC McEliece Cryptosystems.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Motonari Ohtsuka, Takahiro Ishimaru, Yuta Tsukie, Shingo Kukita, Kohtaro Watanabe
2025 J jnl
Key reconstruction for QC-MDPC McEliece from imperfect distance spectrum.
IACR Cryptol. ePrint Arch.
Motonari Ohtsuka, Takahiro Ishimaru, Rei Iseki, Shingo Kukita, Kohtaro Watanabe
2024 J jnl
ADMM and Reproducing Sum-Product Decoding Algorithm Applied to QC-MDPC Code-Based McEliece Cryptosystems.
IEEE Trans. Inf. Theory
Kohtaro Watanabe, Motonari Ohtsuka, Yuta Tsukie
2022 J jnl
ADMM and Reproducing Sum-Product Decoding Algorithm Applied to QC-MDPC Code-based McEliece Cryptosystems.
IACR Cryptol. ePrint Arch.
Kohtaro Watanabe, Motonari Ohtsuka, Yuta Tsukie
2022 J jnl
Improved scheme and evaluation method for progressive visual cryptography.
EURASIP J. Inf. Secur.
Binh Le Thanh Thai, Hidema Tanaka, Kohtaro Watanabe
2021 J jnl
Shortened LDPC codes accelerate OSD decoding performance.
EURASIP J. Wirel. Commun. Netw.
Kohtaro Watanabe, Ryusei Kaguchi, Toshiya Shinoda
2020 J jnl
The best constant of discrete Sobolev inequality on 1812 C60 fullerene isomers.
JSIAM Lett.
Yoshinori Kametaka, Kohtaro Watanabe, Atsushi Nagai, Kazuo Takemura, Hiroyuki Yamagishi, Hiroto Sekido
2013 J jnl
Complete low-cut filter and the best constant of Sobolev inequality.
JSIAM Lett.
Hiroyuki Yamagishi, Yoshinori Kametaka, Atsushi Nagai, Kohtaro Watanabe, Kazuo Takemura
2013 J jnl
The best estimation corresponding to continuous model of Thomson cable.
JSIAM Lett.
Hiroyuki Yamagishi, Yoshinori Kametaka, Atsushi Nagai, Kohtaro Watanabe, Kazuo Takemura
2012 J jnl
Elliptic theta function and the best constants of Sobolev-type inequalities.
JSIAM Lett.
Hiroyuki Yamagishi, Yoshinori Kametaka, Atsushi Nagai, Kohtaro Watanabe, Kazuo Takemura
2011 J jnl
Riemann zeta function and Lyapunov-type inequalities for certain higher order differential equations.
Appl. Math. Comput.
Kohtaro Watanabe, Hiroyuki Yamagishi, Yoshinori Kametaka
2010 J jnl
Listing all the minimum spanning trees in an undirected graph.
Int. J. Comput. Math.
Takeo Yamada, Seiji Kataoka, Kohtaro Watanabe
2005 J jnl
Algorithms to solve the knapsack constrained maximum spanning tree problem.
Int. J. Comput. Math.
Takeo Yamada, Kohtaro Watanabe, Seiji Kataoka
2005 J jnl
Heuristic and exact algorithms for the spanning tree detection problem.
Comput. Oper. Res.
Takeo Yamada, Seiji Kataoka, Kohtaro Watanabe