Masao Kasahara

According to our database1, Masao Kasahara authored at least 69 papers between 1974 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Awards

IEEE Fellow

IEEE Fellow 1995, "For contributions to coding theory and to efficient decoding.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Exponential Error Bounds and Decoding Complexity for Block Codes Constructed by Unit Memory Trellis Codes of Branch Length Two.
Proceedings of the 53rd Annual Conference on Information Sciences and Systems, 2019

2015
A Simple Scheme, for Strengthening Product-sum Type PKC.
IACR Cryptol. ePrint Arch., 2015

New classes of public key cryptosystem K(XVI)SE(1)PKC constructed based on Reed-Solomon code over extension field of m=8 and K(XVI)SE(2)PKC, based on binary cyclic code.
IACR Cryptol. ePrint Arch., 2015

Hybrid inter-organization cryptosystem using ElGamal cryptosystem.
Proceedings of the IEEE International Conference on Consumer Electronics - Taiwan, 2015

2014
New Class of Multivariate Public Key Cryptosystem, K(XI)RSE(2)PKC, Constructed based on Reed-Solomon Code Along with K(X)RSE(2)PKC over 픽<sub>2</sub>.
IACR Cryptol. ePrint Arch., 2014

New Classes of Public Key Cryptosystems over F<sub>2</sub><sup>8</sup> Constructed Based on Reed-Solomon Codes, K(XVII)SE(1)PKC and K(XVII)ΣΠPKC.
IACR Cryptol. ePrint Arch., 2014

A new class of system oriented PKC, K(I)SOPKC.
IACR Cryptol. ePrint Arch., 2014

Constructions of A Large Class of Optimum Constant Weight Codes over F_2.
CoRR, 2014

New method for factoring two RSA moduli with implicit hint.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

A knapsack public-key cryptosystem using two random sequences.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

2013
Presentation of a new class of public key cryptosystems K(XIII)SE(1)PKC along with Kp(XIII)SE(1)PKC that realizes the coding rate of exactly 1.0, constructed by modifying K(XII)SE(1)PKC.
IACR Cryptol. ePrint Arch., 2013

A New Class of Public Key Cryptosystems Constructed Based on Reed-Solomon Codes, K(XII)SE(1)PKC.- Along with a presentation of K(XII)SE(1)PKC over the extension field extensively used for present day various storage and transmission systems -.
IACR Cryptol. ePrint Arch., 2013

A New Class of Product-sum Type Public Key Cryptosystem, K(V)ΣΠPKC, Constructed Based on Maximum Length Code.
IACR Cryptol. ePrint Arch., 2013

2012
Construction of New Classes of Knapsack Type Public Key Cryptosystem Using Uniform Secret Sequence, K(II)ΣΠPKC, Constructed Based on Maximum Length Code.
IACR Cryptol. ePrint Arch., 2012

Public Key Cryptosystems Constructed Based on Reed-Solomon Codes, K(XV)SE(2)PKC, Realizing Coding Rate of Exactly 1.0.
IACR Cryptol. ePrint Arch., 2012

Security analysis of shifted odd knapsack public key encryption scheme.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

A public-key cryptosystem based on decision version of subset sum problem.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

2011
A New Class of Multivariate Public Key Cryptosystem Constructed on the Basis of Message-Dependent Transformation.
IACR Cryptol. ePrint Arch., 2011

A New Class of Multivariate Public Key Cryptosystems Constructed Based on Random Pseudo Cyclic Codes, K(XIII)SE(2)PKC, Realizing Coding Rate of Exactly 1.0.
IACR Cryptol. ePrint Arch., 2011

Public Key Cryptosystems Constructed Based on Random Pseudo Cyclic Codes, K(IX)SE(1)PKC, Realizing Coding Rate of Exactly 1.0.
IACR Cryptol. ePrint Arch., 2011

A Construction of A New Class of Knapsack-Type Public Key Cryptosystem, K(III)Sigma PKC.
IACR Cryptol. ePrint Arch., 2011

A New Class of Biometrics on the Basis of Forgotten Secret Recovering Scheme, KSS(I).
IACR Cryptol. ePrint Arch., 2011

2010
An ID-based key sharing scheme based on discrete logarithm problem over a product of three primes.
JSIAM Lett., 2010

A New Class of Public Key Cryptosystems Constructed Based on Error-Correcting Codes, Using K(III) Scheme.
IACR Cryptol. ePrint Arch., 2010

A New Class of Public Key Cryptosystems Constructed Based on Perfect Error-Correcting Codes Realizing Coding Rate of Exactly 1.0.
IACR Cryptol. ePrint Arch., 2010

A knapsack cryptosystem based on multiple knapsacks.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

2009
Proposal of PPS Multivariate Public Key Cryptosystems.
IACR Cryptol. ePrint Arch., 2009

Construction of A New Class of Linear Multivariate Public Key Cryptosystem, K(I)SE(1)PKC.
IACR Cryptol. ePrint Arch., 2009

Forgotten Secret Recovering Scheme and Fuzzy Vault Scheme Constructed Based on Systematic Error-Correcting Codes.
IACR Cryptol. ePrint Arch., 2009

2008
Security of a Class of Knapsack Public-Key Cryptosystems against Low-Density Attack.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

On biometric encryption using fingerprint and it's security evaluation.
Proceedings of the 10th International Conference on Control, 2008

2007
A generalization of Secret Sharing Scheme on the Basis of Recovering Algorithm, K-RA.
IACR Cryptol. ePrint Arch., 2007

2006
A Construction of Public-Key Cryptosystem Using Algebraic Coding on the Basis of Superimposition and Randomness.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Safety of templates in biometric person authentication using error-correcting code.
Proceedings of the Security, Steganography, and Watermarking of Multimedia Contents VIII, 2006

2005
A Construction of Public-Key Cryptosystem Based on Singular Simultaneous Equations.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Meta Ring Signature.
IACR Cryptol. ePrint Arch., 2005

Murakami-Kasahara ID-based Key Sharing Scheme Revisited - In Comparison with Maurer-Yacobi Schemes -.
IACR Cryptol. ePrint Arch., 2005

2004
A Construction of Public Key Cryptosystem for Realizing Ciphertext of Size 100 Bit and Digital Signature Scheme.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2004

2003
ID based Cryptosystems with Pairing on Elliptic Curve.
IACR Cryptol. ePrint Arch., 2003

A Construction of 100 bit Public-Key Cryptosystem and Digital Signature Scheme.
IACR Cryptol. ePrint Arch., 2003

2002
A Construction Method for Picture Information Having a Recovery Function.
Syst. Comput. Jpn., 2002

A New Traitor Tracing.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

New Product-Sum Type Public-Key Cryptosystems with Selectable Encryption Key Based on Chinese Remainder Theorem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

2001
Upper and Lower Bounds on Maximum Nonlinearity of n-input m-output Boolean Function.
Des. Codes Cryptogr., 2001

1996
On the minimum distance of a q-ary image of a q<sup>m</sup>-ary cyclic code.
IEEE Trans. Inf. Theory, 1996

1995
A multicast hybrid ARQ scheme using MDS codes and GMD decoding.
IEEE Trans. Commun., 1995

1992
Generalized key-equation of remainder decoding algorithm for Reed-Solomon codes.
IEEE Trans. Inf. Theory, 1992

Perfect Staircase Profile of Linear Complexity for Finite Sequences.
Inf. Process. Lett., 1992

1989
Efficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fields.
IEEE Trans. Inf. Theory, 1989

1988
Separate codes on type-II hybrid ARQ systems.
IEEE Trans. Commun., 1988

1984
Variance mismatch of vector quantizers.
IEEE Trans. Inf. Theory, 1984

Modified product codes.
IEEE Trans. Inf. Theory, 1984

1982
New decoding algorithm for Reed-Muller codes.
IEEE Trans. Inf. Theory, 1982

1981
An improvement of error exponents at low rates for the generalized version of concatenated codes.
IEEE Trans. Inf. Theory, 1981

1980
Superimposed concatenated codes (Corresp.).
IEEE Trans. Inf. Theory, 1980

Block codes capable of correcting both additive and timing errors.
IEEE Trans. Inf. Theory, 1980

Certain generalizations of concatenated codes-Exponential error bounds and decoding complexity.
IEEE Trans. Inf. Theory, 1980

1978
Error statistics and construction of error correcting codes for differentially encoded CPSK channels (Corresp.).
IEEE Trans. Inf. Theory, 1978

A new class of asymptotically good codes beyond the Zyablov bound.
IEEE Trans. Inf. Theory, 1978

Evaluations of Error Control Techniques in Both Independent-Error and Dependent-Error Channels.
IEEE Trans. Commun., 1978

1977
Analysis of the fundamental error statistics in DPSK systems using a Markov chain model (Corresp.).
IEEE Trans. Inf. Theory, 1977

1976
Correction to 'An Erasures-and-Errors Decoding Algorithm for Goppa Codes'.
IEEE Trans. Inf. Theory, 1976

Further results on Goppa codes and their applications to constructing efficient binary codes.
IEEE Trans. Inf. Theory, 1976

An erasures-and-errors decoding algorithm for Goppa codes (Corresp.).
IEEE Trans. Inf. Theory, 1976

New classes of binary codes constructed on the basis of concatenated codes and product codes.
IEEE Trans. Inf. Theory, 1976

1975
A Method for Solving Key Equation for Decoding Goppa Codes
Inf. Control., January, 1975

Some efficient binary codes constructed using Srivastava codes (Corresp.).
IEEE Trans. Inf. Theory, 1975

A new class of binary codes constructed on the basis of BCH codes (Corresp.).
IEEE Trans. Inf. Theory, 1975

1974
A Modification of the Constructive Asymptotically Good Codes of Justesen for Low Rates
Inf. Control., August, 1974


  Loading...