[기술해설]암호법(Cryptography)

University of Maryland at College Park의 곤충학과 소개

The security of classical cryptography based on computational complexity assumptions has been severely challenged with the rapid development of quantum computers and quantum algorithms. Quantum cryptography, which offers unconditional security based on some principles of quantum mechanics, has become a significant branch and hotspot in the field of modern cryptography research. In this paper, we review the research and development of several important and well-studied branches of quantum cryptography in terms of theory and experiment, including quantum key distribution, quantum secret sharing, quantum secure direct communication, quantum signature, and quantum private query. We also briefly review the research and development of some other branches which are currently in the stage of theoretical research but receive widespread concern from academia, including quantum private comparison, quantum anonymous voting, quantum secure multi-party summation, quantum sealed-bid auction, quantum public key cryptosystem, quantum key agreement, quantum dialogue, and quantum identity authentication. In addition, we discuss some open issues and future research directions for the branches referred to above.

Survey on quantum information security

Millions of devices are becoming part of Internet of Things/5G. Securing these devices against all potential threats is a huge challenge. The 5G specification goals require rigid and robust security protocol against such threats. Quantum cryptography is a recently emerged term in which we test the robustness of security protocols against quantum computers. Therefore, in this article, we propose a security protocol called quantum key GRID for authentication and key agreement (QKG-AKA) scheme for the dynamic security association. This scheme is efficiently deployed in long term evolution architecture without any significant modifications in the underlying base system. The proposed QKG-AKA mechanism is analyzed for robustness and proven safe against quantum computers. The simulation results and performance analysis show drastic improvement regarding security and key management over existing schemes.

/pdf/a-quantum-safe-key-hierarchy-and-dynamic-security-2rjvzmzjlc.pdf

A Quantum-Safe Key Hierarchy and Dynamic Security Association for LTE/SAE in 5G Scenario

We describe the development of a Quantum Interactive Learning Tutorial (QuILT) on quantum key distribution, a context which involves a practical application of quantum mechanics. The QuILT helps upper-level undergraduate students learn quantum mechanics using a simple two state system and was developed based upon the findings of cognitive research and physics education research. One protocol used in the QuILT involves generating a random shared key over a public channel for encrypting and decrypting information using single photons with non-orthogonal polarization states, and another protocol makes use of two entangled spin-1/2 particles. The QuILT uses a guided approach and focuses on helping students build links between the formalism and conceptual aspects of quantum physics without compromising the technical content. We also discuss findings from a preliminary in-class evaluation.

/pdf/development-of-an-interactive-tutorial-on-quantum-key-51do5yr0xi.pdf

Development of an interactive tutorial on quantum key distribution

Low powered devices, such as smart phones, tablets and sensors, present a particular challenge for advanced encryption systems. In this paper, we present a new quasigroup block encryption system that has low memory and computational requirements and hence suitable for low powered devices. We compare its performance against Advanced Encryption Standard-256 (AES-256) bit algorithm using the NIST statistical test suite (NIST-STS). Since it is well known that a good encryption algorithm must destroy any statistical properties of the input sequence and produce output close to a true random sequence, the NIST-STS suite results provide us a good test bench. In almost all tests from the suite, the proposed algorithm performs better than AES-256.

An Efficient Quasigroup Block Cipher

Communication between nodes in a sensor network is often secured by the use of symmetric keys installed on them before deployment. A more efficient method is to install sensors with a small amount of secret information that can be used to generate a pairwise common key when required. We propose new key agreement algorithms based on matrix factorization that requires a maximum of μ multiplications to generate a key, where M ≥ N is a system parameter and N is the total number of nodes in the network.

Matrix based key agreement algorithms for sensor networks

Quantum key distribution (QKD) protocols form a natural choice for encryption in optical networks All the QKD protocols use errors caused due to random measurements by Eve to detect her presence In this paper, we present a fundamental limitation of using such bases to detect an eavesdropper in two QKD protocols — the BB84 and the new quantum Diffie-Hellman key exchange protocol It is shown that the eavesdropper will go undetected in each exchange in both the protocols at least half the time

Limits on detecting eavesdropper in QKD protocols

Qubits traveling through a quantum channel often interact with the environment which causes errors at the receiving end. These errors are often indistinguishable from errors caused by an eavesdropper and therefore must be corrected before a quantum key exchange protocol proceeds forward. Logical qubits are often used in order to make error correction possible. In this paper, we apply logical qubits to detect collective rotational errors and discuss how they can be corrected in the context of three-stage quantum key distribution protocol.

Correcting rotational errors in three stage QKD

Integrating of subject matter onto serious games is an important problem that has been shown to impact the learning potential of serious games. A novel approach, inspired by peer-to-peer (P2P) networks, towards designing and deploying a series of problems in game scenarios is described. Given a set of problems involving a set of concepts the proposed approach automatically generates a problem network graph akin to P2P network that can then traversed by a player to collect all the concepts that are necessary to learn a topic of interest. A network traversal algorithm is described, which identifies the relevant problems and produces an efficient route through the network for learning the topic. We also describe an algorithm for mapping the problem network graph onto a game scenario by identifying groups of problems that can be placed in a single location of the game like the level of a building, arcade, or a room, physical barriers that separate, and the conditions for passing through these barriers. The proposed approach has been validated through a quantum cryptography game QuaSim and has been played by over 100 students to learn quantum cryptography basics and cryptography protocols.

Abhishek Parakh

Papers

An Efficient Quasigroup Block Cipher

Matrix based key agreement algorithms for sensor networks

Limits on detecting eavesdropper in QKD protocols

Correcting rotational errors in three stage QKD

An Approach Towards Designing Problem Networks in Serious Games