基于lucas的单向函数的位安全性

2014 Ninth Asia Joint Conference on Information Security Pub Date : 2014-09-01 DOI:10.1109/AsiaJCIS.2014.9

Si-Wei Ren, Ke Lu

{"title":"基于lucas的单向函数的位安全性","authors":"Si-Wei Ren, Ke Lu","doi":"10.1109/AsiaJCIS.2014.9","DOIUrl":null,"url":null,"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.","PeriodicalId":354543,"journal":{"name":"2014 Ninth Asia Joint Conference on Information Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Bit Security for Lucas-Based One-Way Function\",\"authors\":\"Si-Wei Ren, Ke Lu\",\"doi\":\"10.1109/AsiaJCIS.2014.9\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":354543,\"journal\":{\"name\":\"2014 Ninth Asia Joint Conference on Information Security\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Ninth Asia Joint Conference on Information Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AsiaJCIS.2014.9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Ninth Asia Joint Conference on Information Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AsiaJCIS.2014.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

1993年，Smith和Lennon描述了一种新的基于Lucas序列的公钥密码系统，称为Lucas密码系统(LUC)。它的结构类似于RSA，但它的计算速度更快，使用更小的密钥大小，具有相同的安全强度。本文提出了一种新的LUC核心谓词，并利用Akavia等人开发的列表解码方法证明了其安全性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Bit Security for Lucas-Based One-Way Function

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2014 Ninth Asia Joint Conference on Information Security

自引率

0.00%

发文量