An efficient identification scheme based on Bivariate function hard problem
Symmetric cryptography allows faster and more secure communication between two entities using the identical pre-established secret key. However, identifying the honest entity with the same secret key before initiating symmetric encryption is vital since the communication may be impersonated. Tea and...
محفوظ في:
| المؤلفون الرئيسيون: | Boon, Chian Tea, Kamel Ariffin, Muhammad Rezal, Abd Ghafar, Amir Hamzah, Sapar, Siti Hasana, Mohamat Johari, Mohamat Aidil |
|---|---|
| التنسيق: | مقال |
| منشور في: |
Multidisciplinary Digital Publishing Institute
2022
|
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
An identification scheme based on bivariate function hard problem
بواسطة: Tea, Boon Chian, وآخرون
منشور في: (2014) -
Efficient identification scheme in standard model based on bivariate function hard problem
بواسطة: Tea, Boon Chian
منشور في: (2014) -
Efficient identification scheme in standard model based on bivariate function hard problem
بواسطة: Tea, Boon Chian
منشور في: (2014) -
Efficient identification schmene in standard model based on bivariate function hard problem /
بواسطة: Tea, Boon Chia -
An efficient identification scheme in standard model based on the diophantine equation hard problem
بواسطة: Tea, Boon Chian, وآخرون
منشور في: (2013)
