An efficient formula for linear recurrences
SIAM Journal on Computing
A new signature scheme based on the DSA giving message recovery
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem
Designs, Codes and Cryptography - Special issue dedicated to Gustavus J. Simmons
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
A Message Recovery Signature Scheme Equivalent to DSA over Elliptic Curves
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
A Signature Scheme with Message Recovery as Secure as Discrete Logarithm
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
IFIP/Sec '93 Proceedings of the IFIP TC11, Ninth International Conference on Information Security: Computer Security
Generating Large Instances of the Gong-Harn Cryptosystem
Proceedings of the 8th IMA International Conference on Cryptography and Coding
The GH Public-Key Cryptosystem
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
A Key Recovery Attack on Discrete Log-based Schemes Using a Prime Order Subgroupp
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Compression in Finite Fields and Torus-Based Cryptography
SIAM Journal on Computing
A More Compact Representation of XTR Cryptosystem
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On reusing ephemeral keys in Diffie-Hellman key agreement protocols
International Journal of Applied Cryptography
New LFSR-based cryptosystems and the trace discrete log problem (Trace-DLP)
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Public-key cryptosystems based on cubic finite field extensions
IEEE Transactions on Information Theory
New directions in cryptography
IEEE Transactions on Information Theory
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
| Hi-index | 7.29 |
In this paper we propose an ElGamal type encryption scheme based on the concepts of public key cryptosystem over cubic finite field extension proposed by Gong and Harn (GH). The proposed encryption scheme is an ephemeral-static, which is useful in situations like email where the recipient may not be online. The security of the proposed encryption scheme depends on the difficulty of solving 3-LFSR-DLP, 3-LFSR-DHP and 3-LFSR-DDHP. It then provides secure message transmission by having also the property of semantic security. We also adapt an efficient double exponentiation algorithm for GH construction that helps us to propose the GH-Nyberg-Rueppel-type digital signature algorithm (GH-NR-DSA) with message recovery based on the proposed scheme. Moreover, we give some countermeasures for GH-NR-DSA to resist two well known forgery attacks, namely, congruence equation attack and homomorphism attack.