2011 11th International Conference on ITS Telecommunications 2011
DOI: 10.1109/itst.2011.6060135
|View full text |Cite
|
Sign up to set email alerts
|

Implementation of NTRU PKCS using array for polynomials upto degree 147 with private key protection algorithm using XOR function only

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…[4]The main characteristic is that the polynomial multiplication is the most complex operation that is much faster than other asymmetric cryptosystems such as RSA, ElGamal and Elliptic curve cryptography. [5] In this paper we introduce a new transposition (scrambling) method with the assistance of NTRU algorithm. In our method sound files will pass through more than one stage of scrambling.…”
Section: Introductionmentioning
confidence: 99%
“…[4]The main characteristic is that the polynomial multiplication is the most complex operation that is much faster than other asymmetric cryptosystems such as RSA, ElGamal and Elliptic curve cryptography. [5] In this paper we introduce a new transposition (scrambling) method with the assistance of NTRU algorithm. In our method sound files will pass through more than one stage of scrambling.…”
Section: Introductionmentioning
confidence: 99%