A new cryptosystem analogous to LUCELG and Cramer-Shoup

A special group based on a linear recurrence equation plays an important role in modern cryptography. Its relation appeared differently in various cryptosystem. Some cryptosystems that use this linear recurrence property are LUC, LUCDIF, and LUCELG but the first practical Lucas function in a crypto...

Full description

Saved in:
Bibliographic Details
Main Authors: Muslim, Norliana, Md. Said, Mohamad Rushdan
Format: Article
Language:English
Published: Malaysian Society for Cryptology Research 2009
Online Access:http://psasir.upm.edu.my/id/eprint/12742/1/A%20new%20cryptosystem%20analogous%20to%20LUCELG%20and%20Cramer.pdf
http://psasir.upm.edu.my/id/eprint/12742/
http://www.mscr.org.my/V1(2)/PP%20191-204.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.upm.eprints.12742
record_format eprints
spelling my.upm.eprints.127422015-10-23T02:35:28Z http://psasir.upm.edu.my/id/eprint/12742/ A new cryptosystem analogous to LUCELG and Cramer-Shoup Muslim, Norliana Md. Said, Mohamad Rushdan A special group based on a linear recurrence equation plays an important role in modern cryptography. Its relation appeared differently in various cryptosystem. Some cryptosystems that use this linear recurrence property are LUC, LUCDIF, and LUCELG but the first practical Lucas function in a cryptosystem is LUC, presented by Peter Smith and Michael Lennon in 1993. Cramer-Shoup is a practical public key cryptosystem provably secure against adaptive chosen ciphertext attack that requires a universal one-way hash function. Based on LUCELG and Cramer-Shoup cryptosystems, a new public key cryptosystem is developed by generating the key generation, encryption and decryption algorithm. There are two types of security for the new cryptosystem that we are concerned which are the security of Lucas function and its security against an adaptive chosen ciphertext attack. Since the encryption and decryption algorithm of a new cryptosystem is based on the defined Lucas function, it is believed that the security of Lucas function is polynomial-time equivalent to the generalized discrete logarithm problems. Moreover, the new cryptosystem is secure against adaptive chosen ciphertext attack by assuming that the hash function is chosen from a universal one-way family and the Diffie-Hellm an decision problem is hard in the finite field. Malaysian Society for Cryptology Research 2009 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/12742/1/A%20new%20cryptosystem%20analogous%20to%20LUCELG%20and%20Cramer.pdf Muslim, Norliana and Md. Said, Mohamad Rushdan (2009) A new cryptosystem analogous to LUCELG and Cramer-Shoup. International Journal of Cryptology Research, 1 (2). pp. 191-204. ISSN 1985-5753 http://www.mscr.org.my/V1(2)/PP%20191-204.pdf
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
language English
description A special group based on a linear recurrence equation plays an important role in modern cryptography. Its relation appeared differently in various cryptosystem. Some cryptosystems that use this linear recurrence property are LUC, LUCDIF, and LUCELG but the first practical Lucas function in a cryptosystem is LUC, presented by Peter Smith and Michael Lennon in 1993. Cramer-Shoup is a practical public key cryptosystem provably secure against adaptive chosen ciphertext attack that requires a universal one-way hash function. Based on LUCELG and Cramer-Shoup cryptosystems, a new public key cryptosystem is developed by generating the key generation, encryption and decryption algorithm. There are two types of security for the new cryptosystem that we are concerned which are the security of Lucas function and its security against an adaptive chosen ciphertext attack. Since the encryption and decryption algorithm of a new cryptosystem is based on the defined Lucas function, it is believed that the security of Lucas function is polynomial-time equivalent to the generalized discrete logarithm problems. Moreover, the new cryptosystem is secure against adaptive chosen ciphertext attack by assuming that the hash function is chosen from a universal one-way family and the Diffie-Hellm an decision problem is hard in the finite field.
format Article
author Muslim, Norliana
Md. Said, Mohamad Rushdan
spellingShingle Muslim, Norliana
Md. Said, Mohamad Rushdan
A new cryptosystem analogous to LUCELG and Cramer-Shoup
author_facet Muslim, Norliana
Md. Said, Mohamad Rushdan
author_sort Muslim, Norliana
title A new cryptosystem analogous to LUCELG and Cramer-Shoup
title_short A new cryptosystem analogous to LUCELG and Cramer-Shoup
title_full A new cryptosystem analogous to LUCELG and Cramer-Shoup
title_fullStr A new cryptosystem analogous to LUCELG and Cramer-Shoup
title_full_unstemmed A new cryptosystem analogous to LUCELG and Cramer-Shoup
title_sort new cryptosystem analogous to lucelg and cramer-shoup
publisher Malaysian Society for Cryptology Research
publishDate 2009
url http://psasir.upm.edu.my/id/eprint/12742/1/A%20new%20cryptosystem%20analogous%20to%20LUCELG%20and%20Cramer.pdf
http://psasir.upm.edu.my/id/eprint/12742/
http://www.mscr.org.my/V1(2)/PP%20191-204.pdf
_version_ 1643825121154039808
score 13.211869