2014
DOI: 10.1016/j.cam.2013.10.022
|View full text |Cite
|
Sign up to set email alerts
|

An overview of trace based public key cryptography over finite fields

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2015
2015
2017
2017

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 2 publications
0
5
0
Order By: Relevance
“…To achieve the encryption process in the proposed schemes, computation of trace is needed. The arithmetic complexity of computing T r ( α ) is O ( c log m ) with c < 6 (the required number of multiplications) . The arithmetic complexity of encryption process for the scheme given in is O (9 log m ) by .…”
Section: New Public Key Encryption Schemes Based On Xtrmentioning
confidence: 99%
See 3 more Smart Citations
“…To achieve the encryption process in the proposed schemes, computation of trace is needed. The arithmetic complexity of computing T r ( α ) is O ( c log m ) with c < 6 (the required number of multiplications) . The arithmetic complexity of encryption process for the scheme given in is O (9 log m ) by .…”
Section: New Public Key Encryption Schemes Based On Xtrmentioning
confidence: 99%
“…Remark The encryption process only needs the computation of trace. Algorithms to compute T r ( α m ) are surveyed in . In this paper, we use the benefits of the efficient computation of trace function.…”
Section: New Public Key Encryption Schemes Based On Xtrmentioning
confidence: 99%
See 2 more Smart Citations
“…PKI also used for several cryptography applications such as encryption, key agreement, digital signature etc. [17]. The main advantage of PKI is to provide authentication users in distributed systems like as cloud computing, mobile cloud computing and wireless sensor network.…”
Section: E Public Key Infrastructure(pki)mentioning
confidence: 99%