Yasuyuki Murakami - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2024

High-Density Knapsack Cryptosystem Using Shifted-Odd and Super-Increasing SequenceMinami Sato, Sosuke Minamoto, Ryuichi Sakai, Yasuyuki Murakami. ieiceta, 107(3):519-522, 2024. [doi]

2023

k-Nearest Neighbor AlgorithmRyuto Omachi, Yasuyuki Murakami. ieiceta, 106(3):355-357, March 2023. [doi]

2020

Packer Identification Method for Multi-layer Executables with k-Nearest Neighbor of EntropiesRyuto Omachi, Yasuyuki Murakami. isita 2020: 504-508 [doi]

2018

Security of Knapsack Cryptosystem Using Subset-Sum Decision Problem against Alternative-Solution AttackYasuyuki Murakami, Ryuichi Sakai. isita 2018: 614-617 [doi]

Equivalent Secret Key Attack against Knapsack PKC based on Subset Sum Decision ProblemRyuichi Sakai, Yasuyuki Murakami. isita 2018: 610-613 [doi]

2016

An implementation of hybrid-type inter-organization cryptosystem using ElGamal PKCTatsuki Miyamoto, Yasuyuki Murakami. isita 2016: 221-225 [doi]

2015

An implementation of inter-organization cryptosystem based on RSA cryptosystemTatsuki Miyamoto, Yasuyuki Murakami. icce-tw 2015: 380-381 [doi]

Hybrid inter-organization cryptosystem using ElGamal cryptosystemYasuyuki Murakami, Masao Kasahara. icce-tw 2015: 378-379 [doi]

2014

A Note on Security of Public-Key Cryptosystem Provably as Secure as Subset Sum ProblemShinsuke Hamasho, Yasuyuki Murakami. ieicet, 97-A(1):298-299, 2014. [doi]

A knapsack public-key cryptosystem using two random sequencesYasuyuki Murakami, Shinsuke Hamasho, Masao Kasahara. isita 2014: 497-501 [doi]

2012

A public-key cryptosystem based on decision version of subset sum problemYasuyuki Murakami, Shinsuke Hamasho, Masao Kasahara. isita 2012: 735-739 [doi]

Security analysis of shifted odd knapsack public key encryption schemeRyuichi Sakai, Yasuyuki Murakami, Masao Kasahara. isita 2012: 731-734 [doi]

2010

A knapsack public-key cryptosystem with cyclic code over $GF(2)$Yasuyuki Murakami, Takeshi Nasako. jsiaml, 2:29-32, 2010. [doi]

An ID-based key sharing scheme based on discrete logarithm problem over a product of three primesYasuyuki Murakami, Masao Kasahara. jsiaml, 2:5-8, 2010. [doi]

A new construction method of knapsack PKC using linear transformation and Chinese remainder theoremYasuyuki Murakami. isita 2010: 433-436 [doi]

2009

A New Construction of Knapsack Pkc by Using a Random SequenceYasuyuki Murakami. globecom 2009: 1-6 [doi]

Relationship between weight of plaintext and successful attacks in knapsack cryptosystemsYasuyuki Murakami, Tatsuo Douzono, Takeshi Nasako. interaction 2009: 935-939 [doi]

2008

Security of a Class of Knapsack Public-Key Cryptosystems against Low-Density AttackTakeshi Nasako, Yasuyuki Murakami, Masao Kasahara. ieicet, 91-A(10):2889-2892, 2008. [doi]

2007

Knapsack Public-Key Cryptosystem Using Chinese Remainder TheoremYasuyuki Murakami, Takeshi Nasako. iacr, 2007:107, 2007. [doi]

2006

Consumer Network and Market DynamicsSatoshi Itoh, Yasuyuki Murakami, Takashi Iba. jcis 2006: [doi]

2005

Murakami-Kasahara ID-based Key Sharing Scheme Revisited - In Comparison with Maurer-Yacobi Schemes -Yasuyuki Murakami, Masao Kasahara. iacr, 2005:306, 2005. [doi]

2002

New Product-Sum Type Public-Key Cryptosystems with Selectable Encryption Key Based on Chinese Remainder TheoremKiyoko Katayanagi, Yasuyuki Murakami, Masao Kasahara. ieiceta, 85-A(2):472-480, 2002. [doi]

Sign in or sign up to see more results.

runs on WebDSL