Cryptographic attack on Lucas based cryptosystems using chinese remainder theorem
Lenstra’s attack uses Chinese remainder theorem as a tool and requires a faulty signature to be successful. This paper reports on the security responses of fourth and sixth order Lucas based (LUC4,6) cryptosystem under the Lenstra’s attack as compared to the other two Lucas based cryptosystems such...
محفوظ في:
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | مقال |
| اللغة: | English |
| منشور في: |
World Academy of Science Engineering and Technology
2019
|
| الوصول للمادة أونلاين: | http://psasir.upm.edu.my/id/eprint/81055/1/LUCAS.pdf http://psasir.upm.edu.my/id/eprint/81055/ https://publications.waset.org/10010261/cryptographic-attack-on-lucas-based-cryptosystems-using-chinese-remainder-theorem |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|