{"title":"基于因子分解和离散对数的基于id的密码方案","authors":"Pin-Chang Su, E. Lu, H. Chang","doi":"10.1109/CCST.2003.1297619","DOIUrl":null,"url":null,"abstract":"We present three identity-based cryptographic schemes based on two-known assumptions. The security of the proposed scheme follows from the difficulties in simultaneously solving the factoring (FAC) and discrete logarithms (DL) problems with arithmetic modulo of almost the same size. The proposed schemes support user identification, digital signature, and key distribution.","PeriodicalId":344868,"journal":{"name":"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"ID-based cryptographic schemes based on factoring and discrete logarithms\",\"authors\":\"Pin-Chang Su, E. Lu, H. Chang\",\"doi\":\"10.1109/CCST.2003.1297619\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present three identity-based cryptographic schemes based on two-known assumptions. The security of the proposed scheme follows from the difficulties in simultaneously solving the factoring (FAC) and discrete logarithms (DL) problems with arithmetic modulo of almost the same size. The proposed schemes support user identification, digital signature, and key distribution.\",\"PeriodicalId\":344868,\"journal\":{\"name\":\"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCST.2003.1297619\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCST.2003.1297619","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
ID-based cryptographic schemes based on factoring and discrete logarithms
We present three identity-based cryptographic schemes based on two-known assumptions. The security of the proposed scheme follows from the difficulties in simultaneously solving the factoring (FAC) and discrete logarithms (DL) problems with arithmetic modulo of almost the same size. The proposed schemes support user identification, digital signature, and key distribution.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
