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)
