The Cubic Public-Key Transformation
| dc.creator | Kak, Subhash | |
| dc.date | 2006-02-28 | |
| dc.date | 2006-06-09 | |
| dc.date.accessioned | 2026-07-07T08:17:58Z | |
| dc.date.available | 2026-07-07T08:17:58Z | |
| dc.description | We propose the use of the cubic transformation for public-key applications and digital signatures. Transformations modulo a prime p or a composite n=pq, where p and q are primes, are used in such a fashion that each transformed value has only 3 roots that makes it a more efficient transformation than the squaring transformation of Rabin, which has 4 roots. Such a transformation, together with additional tag information, makes it possible to uniquely invert each transformed value. The method may be used for other exponents as well. | |
| dc.description | 9 pages; typographical errors corrected | |
| dc.identifier | https://arxiv.org/abs/cs/0602097 | |
| dc.identifier | http://arxiv.org/abs/cs/0602097 | |
| dc.identifier | Circuits Systems and Signal Processing, vol 26, pp. 353-359, 2007 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/134271 | |
| dc.subject | Cryptography and Security | |
| dc.title | The Cubic Public-Key Transformation | |
| dc.type | text |