The cubic public-key transformation
From MaRDI portal
Publication:2644679
Abstract: 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.
Recommendations
- Public-key cryptography based on a cubic extension of the Lucas functions
- A public-key cryptosystem using purely cubic fields
- Public-key cryptosystems based on cubic finite field extensions
- The implementation of cubic public keys based on a new family of algebraic graphs
- scientific article; zbMATH DE number 3991413
- scientific article; zbMATH DE number 4213911
- Generating cubic equations as a method for public encryption
- Public-key identification schemes based on multivariate cubic polynomials
- scientific article; zbMATH DE number 5708377
- Public-key cryptography from new multivariate quadratic assumptions
Cited in
(6)- A cubic RSA code equivalent to factorization
- Generating cubic equations as a method for public encryption
- Public-key cryptography based on a cubic extension of the Lucas functions
- A distributed data storage scheme for sensor networks
- scientific article; zbMATH DE number 3991413 (Why is no real title available?)
- Online data storage using implicit security
This page was built for publication: The cubic public-key transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2644679)
