Generating cubic equations as a method for public encryption

MaRDI QIDQ2833433zbMATH OpenFDO

Authors A. A. Moldovyan, N. A. Moldovyan, V. A. Shcherbacov

Publication date 18 November 2016

Published in Buletinul Academiei de Științe a Republicii Moldova. Matematica (Search for Journal in Brave)

Full work available at URL http://www.math.md/publications/basm/issues/y2015-n3/12117/

zbMATH Keywords

cryptographycubic equationGalois fieldpublic keypublic encryptioncipheringdeniable encryptionfactoring problem

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomials (11S05)

Recommendations

• A cubic analogue of the RSA cryptosystem
• A public-key cryptosystem using purely cubic fields
• scientific article; zbMATH DE number 3991413
• The cubic public-key transformation
• A PUBLIC-KEY CRYPTOSYSTEM BASED UPON EQUATIONS OVER A FINITE FIELD

Cited in

(3)

• Post-quantum no-key protocol
• The cubic public-key transformation
• Deniability of symmetric encryption based on computational indistinguishability from probabilistic ciphering

This page was built for publication: Generating cubic equations as a method for public encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2833433)