Public key encryption and signature schemes based on polynomials over Z_n

MaRDI QIDQ2876887zbMATH OpenFDO

Authors Jörg Schwenk, J. Eisfeld

Publication date 20 August 2014

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• New signature scheme based on difficulty of finding roots
• A fast signature scheme based on congruential polynomial operations
• SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION
• scientific article; zbMATH DE number 3912273
• scientific article; zbMATH DE number 3991413

Cited in

(8)

• Signature scheme using the root extraction problem on quaternions
• A digital signature scheme based on the root extraction problem on a matrix ring
• A fast signature scheme based on congruential polynomial operations
• The polynomial composition problem in \((\mathbb Z/n\mathbb Z)[X]\)
• scientific article; zbMATH DE number 3912273 (Why is no real title available?)
• scientific article; zbMATH DE number 4070803 (Why is no real title available?)
• New signature scheme based on difficulty of finding roots
• On the Security of Public-Key Algorithms Based on Chebyshev Polynomials over the Finite Field Z_N

This page was built for publication: Public key encryption and signature schemes based on polynomials over \(\mathbb{Z}_n\)

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