RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems

DOI10.1007/s00200-012-0181-9zbMath1277.94015OpenAlexW1997188223MaRDI QIDQ1938506

Günther Brandner

Publication date: 21 February 2013

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-012-0181-9

zbMATH Keywords

RSAimplementationpublic-key cryptosystemsasymmetric cryptosystemDicksonciphertext-dependent decryption parametersdecryption functionsLUCreduction of computational effortsWilliams

Mathematics Subject Classification ID

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

Related Items (1)

AN EFFICIENT METHOD FOR IMPROVING THE COMPUTATIONAL PERFORMANCE OF THE CUBIC LUCAS CRYPTOSYSTEM

Uses Software

• gmp

Cites Work

• Some remarks on strong Fibonacci pseudoprimes
• Recent advances in RSA cryptography
• Modular Multiplication Without Trial Division
• A method for obtaining digital signatures and public-key cryptosystems
• Breaking RSA may not be equivalent to factoring
• Euclid's Algorithm for Large Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems