Group Signature System Using Multivariate Asymmetric Cryptography

Group Signature System Using Multivariate Asymmetric Cryptography

Sattar J. Aboud (Department of Computer Science and Technology, University of Bedfordshire, UK)
Copyright: © 2018 |Pages: 11
DOI: 10.4018/978-1-5225-2255-3.ch424
OnDemand PDF Download:
$30.00
List Price: $37.50

Chapter Preview

Top

Quantun Computing Threatens

Quantum computing threatens definite techniques and does not threaten others. Public key encryption, is being used considerably for securing the internet payments, banking transactions, and also emails and webs. The majority of today cryptography schemes are using public-key cryptography, that is in fact secure anti-attacks from contemporary computers.

Suppose that quantum cryptography can easily break many schemes by inverse the computing private-keys and quicker than the classical computer. While quantum cryptography are still in their early stages and non- equipped, with publicly known new quantum computers, small to attack traditional cryptography algorithms, many public authorities have begun to know the risk included if this technology becomes the practical applications. Since quantum computers is to process huge amounts of information in the quite short of time.

Key Terms in this Chapter

Quantum Computers: Is the direct use of quantum-mechanical phenomena, to perform operations on data. Quantum computers are different from digital computers based on transistors. Whereas digital computers require data to be encoded into binary digits (bits), quantum computation uses quantum bits which can be in super positions of states.

NP-Hard Problems: Is a class of problems that are, at least as hard as the hardest problems in NP. More precisely, a problem H is NP-hard when every problem L in NP can be reduced in polynomial time.

Isomorphism of Polynomials Problem: Is a well-known problem studied in multivariate cryptography. It is related to the hardness of the key recovery of some cryptosystems.

Group Signature Scheme: Is a method for allowing a member of a group to anonymously sign a message on behalf of the group.

Multivariate Cryptography: Is the generic term for asymmetric cryptography based on multivariate polynomials over finite fields. Solving systems of multivariate polynomial equations is proven to be NP-hard. Today multivariate quadratics can be used only to build signatures.

Hacker: Is a term used by some to mean a clever programmer and by other, especially those in popular media to mean someone who tries to break into computer systems.

Cryptography: Is the science and study of secret writing.

Complete Chapter List

Search this Book:
Reset