Chuo University

Displaying 1-7 of 7 results

  • White Papers // Mar 2013

    On the Security of Quantum Key Distribution Ping-Pong Protocol

    Computational based cryptography might not guarantee long term security if computational algorithms, computers, and so on are made remarkable progress. Therefore, quantum cryptography with unconditionally security attracts attention. In this paper, the authors consider security of a two-way quantum key distribution protocol, so called ping-pong protocol. As a result, they...

    Provided By Chuo University

  • White Papers // Mar 2012

    Construction of the Tsujii-Shamir-Kasahara (TSK) Type Multivariate Public Key Cryptosystem, Which Relies on the Difficulty of Prime Factorization

    A new Multivariate Public-Key Cryptosystem (MPKC) with the security based on the difficulty of the prime factoring is proposed. Unlike conventional cryptosystems such as RSA, most MPKCs are expected secure against quantum computers, and their operation of encryption and decryption is expected quick, because they do not need exponential operation....

    Provided By Chuo University

  • White Papers // Jul 2011

    Hidden Pair of Bijection Signature Scheme

    A new signature system of multivariate public key cryptosystem is proposed. The new system, Hidden Pair of Bijection (HPB), is the advanced version of the Complementary STS system. This system realized both high security and quick signing. Experiments showed that the cryptanalysis of HPB by Grobner bases has no less...

    Provided By Chuo University

  • White Papers // May 2011

    On Applications of Graph/network Theory to Problems in Communication Systems

    Graph/network theory results are applicable to problems in communications. As a representative example, the node coloring problem in graph theory is applicable to the channel assignment problem in cellular mobile communication systems. The node coloring problem is NP-complete, meaning that optimally solving it is very difficult. Therefore, the authors use...

    Provided By Chuo University

  • White Papers // Sep 2010

    Enhanced STS Using Check Equation - Extended Version of the Signature Scheme Proposed in the PQCrypt2010 -

    The authors propose solutions to the problems which have been left in the Enhanced STS, which was proposed in the PQCrypto 2010. Enhanced STS signature scheme is defined as the public key with the Complementary STS structure, in which two STS public keys are symmetrically joined together. Or, the complementary...

    Provided By Chuo University

  • White Papers // Aug 2010

    Quantum Quasi-Cyclic LDPC Codes

    In this paper, a construction of a pair of "Regular" quasi-cyclic LDPC codes to construct a quantum error-correcting code is proposed. In other words, the authors find quantum regular LDPC codes with various weight distributions. Their construction method is based on algebraic combinatorics and achieves a lower bound of the...

    Provided By Chuo University

  • White Papers // Apr 2009

    Theoretical Framework for Constructing Matching Algorithms in Biometric Authentication Systems

    In this paper, the authors propose a theoretical framework to construct matching algorithms for any biometric authentication systems. Conventional matching algorithms are not necessarily secure against strong intentional impersonation attacks such as wolf attacks. The wolf attack is an attempt to impersonate a genuine user by presenting a "Wolf" to...

    Provided By Chuo University

  • White Papers // Aug 2010

    Quantum Quasi-Cyclic LDPC Codes

    In this paper, a construction of a pair of "Regular" quasi-cyclic LDPC codes to construct a quantum error-correcting code is proposed. In other words, the authors find quantum regular LDPC codes with various weight distributions. Their construction method is based on algebraic combinatorics and achieves a lower bound of the...

    Provided By Chuo University

  • White Papers // Apr 2009

    Theoretical Framework for Constructing Matching Algorithms in Biometric Authentication Systems

    In this paper, the authors propose a theoretical framework to construct matching algorithms for any biometric authentication systems. Conventional matching algorithms are not necessarily secure against strong intentional impersonation attacks such as wolf attacks. The wolf attack is an attempt to impersonate a genuine user by presenting a "Wolf" to...

    Provided By Chuo University

  • White Papers // Sep 2010

    Enhanced STS Using Check Equation - Extended Version of the Signature Scheme Proposed in the PQCrypt2010 -

    The authors propose solutions to the problems which have been left in the Enhanced STS, which was proposed in the PQCrypto 2010. Enhanced STS signature scheme is defined as the public key with the Complementary STS structure, in which two STS public keys are symmetrically joined together. Or, the complementary...

    Provided By Chuo University

  • White Papers // Jul 2011

    Hidden Pair of Bijection Signature Scheme

    A new signature system of multivariate public key cryptosystem is proposed. The new system, Hidden Pair of Bijection (HPB), is the advanced version of the Complementary STS system. This system realized both high security and quick signing. Experiments showed that the cryptanalysis of HPB by Grobner bases has no less...

    Provided By Chuo University

  • White Papers // Mar 2012

    Construction of the Tsujii-Shamir-Kasahara (TSK) Type Multivariate Public Key Cryptosystem, Which Relies on the Difficulty of Prime Factorization

    A new Multivariate Public-Key Cryptosystem (MPKC) with the security based on the difficulty of the prime factoring is proposed. Unlike conventional cryptosystems such as RSA, most MPKCs are expected secure against quantum computers, and their operation of encryption and decryption is expected quick, because they do not need exponential operation....

    Provided By Chuo University

  • White Papers // May 2011

    On Applications of Graph/network Theory to Problems in Communication Systems

    Graph/network theory results are applicable to problems in communications. As a representative example, the node coloring problem in graph theory is applicable to the channel assignment problem in cellular mobile communication systems. The node coloring problem is NP-complete, meaning that optimally solving it is very difficult. Therefore, the authors use...

    Provided By Chuo University

  • White Papers // Mar 2013

    On the Security of Quantum Key Distribution Ping-Pong Protocol

    Computational based cryptography might not guarantee long term security if computational algorithms, computers, and so on are made remarkable progress. Therefore, quantum cryptography with unconditionally security attracts attention. In this paper, the authors consider security of a two-way quantum key distribution protocol, so called ping-pong protocol. As a result, they...

    Provided By Chuo University