Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Public key encryption and digital signatures based on permutation polynomials

Public key encryption and digital signatures based on permutation polynomials

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© IEE
Published

Permutation polynomials over Zn form the basis of the RSA and Dickson public key schemes. Previously, however, only those permutation polynomials whose inverse permutation polynomial was easy to evaluate have been used in cryptography. The authors propose a way to avoid this restriction in public key cryptography by implementing secret key decryption and signature generation by computation of the gcd of two polynomials. This allows the implementation of new classes of public key scheme.

Inspec keywords: polynomials; public key cryptography

Other keywords: public key encryption; permutation polynomials; cryptography; signature generation; digital signatures; secret key decryption

Subjects: Data security; Codes

References

    1. 1)
      • R. Nöbauer . Cryptanalysis of a public-key cryptosystem based on Dickson polynomials. Math. Slovaca , 309 - 323
    2. 2)
      • R.L. Rivest , A. Shamir , L. Adleman . A method for obtaining digital signatures and public-key cryptosystems. Comm. ACM , 2 , 120 - 126
    3. 3)
      • P. Smith . LUC public-key encryption. Dr. Dobbs J. , 44 - 49
    4. 4)
      • G.R. Blakley , I. Borosh . Rivest-Shamir-Adleman public key cryptosystems do not always concealmessages. Comput. Math. Appl. , 169 - 178
    5. 5)
      • G.J. Simmons , M.J. Norris . Preliminary comments on the MIT public-key cryptosystem. Cryptologia , 4 , 406 - 414
    6. 6)
      • I. Schur . (1973) Über einen Zusammenhang zwischen einem Problem der Zahlentheorieund einem Satz über algebraische Funktionen, Gesammelte Abhandlungen Band II.
    7. 7)
      • Müller, W.B., Nöbauer, R.: `Cryptanalysis of the Dickson-scheme', Proc. EUROCRYPT '85, 1986, Springer-Verlag, p. 50–61.
    8. 8)
      • R. Lidl , H. Niederreiter . (1983) Finite fields, Encyclo. Math. and Appl..
    9. 9)
      • R. Lidl , G.L. Mullen , G. Turnwald . (1993) Dickson polynomials.
    10. 10)
      • G.H. Hardy , E.M. Wright . (1990) An introduction to the theory of numbers.
    11. 11)
      • Fried . On a conjecture of Schur. Michigan Math. J. , 41 - 55
    12. 12)
      • G.J. Simmons . Proofs of soundness (integrity) of cryptographic protocols. J. Cryptol. , 2 , 69 - 77
    13. 13)
      • R.L. Rivest . Remarks on a proposed cryptoanalytic attack on the MIT public-key cryptosystem. Cryptologia , 1 , 62 - 65
    14. 14)
      • D.E. Denning . Digital signatures with RSA and other public-key cryptosystems. Commun. ACM , 4 , 55 - 62
    15. 15)
      • J.H. Moore , G.J. Simmons . (1992) Protocol failures in cryptosystems, Contemporary cryptography.
    16. 16)
      • J. von zur Gathen . Tests for permutation polynomials. SIAM J. Comput. , 591 - 602
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19980569
Loading

Related content

content/journals/10.1049/el_19980569
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address