The Cubic Public-Key Transformation

This note proposes the use of the cubic transformation for public-key applications and random event and number generation, in a manner akin to the Rabin cipher. Transformations modulo a prime p or a composite n = pq, where p and q are primes, are so used that each transformed value has only three ro...

Full description

Saved in:
Bibliographic Details
Published inCircuits, systems, and signal processing Vol. 26; no. 3; pp. 353 - 359
Main Author Kak, Subhash
Format Journal Article
LanguageEnglish
Published Cambridge Springer Nature B.V 01.06.2007
Subjects
Cryptography
Data encryption
Engineering
Mathematics
Online AccessGet full text

Cover

More Information
Summary:This note proposes the use of the cubic transformation for public-key applications and random event and number generation, in a manner akin to the Rabin cipher. Transformations modulo a prime p or a composite n = pq, where p and q are primes, are so used that each transformed value has only three roots. Such a transformation, together with additional tag information, makes it possible to uniquely invert each transformed value. The effectiveness of the method as a random number generator (used in a variant with nine roots) comes from the fact that the cryptanalyst must contend with a ninefold branching at each step. [PUBLICATION ABSTRACT]
ISSN:0278-081X
1531-5878
DOI:10.1007/s00034-006-0309-x