Zero-knowledge identification scheme with companion matrices of primitive polynomials
by Huawei Huang; Lunzhi Deng; Yunyun Qu; Chunhua Li
International Journal of Embedded Systems (IJES), Vol. 12, No. 2, 2020

Abstract: This paper proposes the matrix power problem, that is, to find x given C^xD^x, where C and D are the companion matrices of primitive polynomials over finite field. And a new zero-knowledge identification scheme based on matrix power problem is proposed. It is perfect zero-knowledge for honest verifiers. Due to its simplicity, and low-memory and low-computation costs, the proposed scheme is suitable for using in computationally limited devices for identification such as smart cards.

Online publication date: Thu, 19-Mar-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com