{"title":"基于矩阵置乱方法的椭圆曲线密码","authors":"Fatima Amounas, E. Kinani","doi":"10.1109/JNS2.2012.6249236","DOIUrl":null,"url":null,"abstract":"A new method on matrix scrambling based on the elliptic curve will be proposed in this paper. The proposed algorithm is based on random function and shifting technique of circular queue. In particular, we first transform the message into points on the elliptic curve as is the embedding system M→PM and then apply the encryption/decryption technique based on matrix scrambling. Our scheme is secure against most of the current attacking mechanisms.","PeriodicalId":224410,"journal":{"name":"2012 National Days of Network Security and Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"An elliptic curve cryptography based on matrix scrambling method\",\"authors\":\"Fatima Amounas, E. Kinani\",\"doi\":\"10.1109/JNS2.2012.6249236\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new method on matrix scrambling based on the elliptic curve will be proposed in this paper. The proposed algorithm is based on random function and shifting technique of circular queue. In particular, we first transform the message into points on the elliptic curve as is the embedding system M→PM and then apply the encryption/decryption technique based on matrix scrambling. Our scheme is secure against most of the current attacking mechanisms.\",\"PeriodicalId\":224410,\"journal\":{\"name\":\"2012 National Days of Network Security and Systems\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-04-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 National Days of Network Security and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JNS2.2012.6249236\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 National Days of Network Security and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JNS2.2012.6249236","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An elliptic curve cryptography based on matrix scrambling method
A new method on matrix scrambling based on the elliptic curve will be proposed in this paper. The proposed algorithm is based on random function and shifting technique of circular queue. In particular, we first transform the message into points on the elliptic curve as is the embedding system M→PM and then apply the encryption/decryption technique based on matrix scrambling. Our scheme is secure against most of the current attacking mechanisms.