DocumentCode
244770
Title
Bit Security for Lucas-Based One-Way Function
Author
Si-Wei Ren ; Ke-Wei Lu
Author_Institution
Inst. of Inf. Eng., Beijing, China
fYear
2014
fDate
3-5 Sept. 2014
Firstpage
111
Lastpage
118
Abstract
In 1993, Smith and Lennon described a new public key cryptosystem based on a Lucas sequences, called Lucas cryptosystem (LUC). Its construction is similar to RSA, but its computing faster and using smaller key size than RSA with the same security strength. In this paper, we presented a new hardcore predicate of LUC and proved its security by the list decoding method developed by Akavia et al.
Keywords
decoding; public key cryptography; sequences; LUC hardcore predicate; Lucas cryptosystem; Lucas sequences; Lucas-based one-way function; RSA similarity; bit security; key size; list decoding method; public key cryptosystem; security strength; Decoding; Elliptic curve cryptography; Encryption; Prediction algorithms; Hardcore predicate; LUC; List-decoding; One-way function;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Security (ASIA JCIS), 2014 Ninth Asia Joint Conference on
Conference_Location
Wuhan
Type
conf
DOI
10.1109/AsiaJCIS.2014.9
Filename
7023248
Link To Document