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...
Bewaard in:
| Hoofdauteurs: | Boon, Chian Tea, Kamel Ariffin, Muhammad Rezal, Abd Ghafar, Amir Hamzah, Sapar, Siti Hasana, Mohamat Johari, Mohamat Aidil |
|---|---|
| Formaat: | Artikel |
| Gepubliceerd in: |
Multidisciplinary Digital Publishing Institute
2022
|
| Tags: |
Voeg label toe
Geen labels, Wees de eerste die dit record labelt!
|
Gelijkaardige items
-
An identification scheme based on bivariate function hard problem
door: Tea, Boon Chian, et al.
Gepubliceerd in: (2014) -
Efficient identification scheme in standard model based on bivariate function hard problem
door: Tea, Boon Chian
Gepubliceerd in: (2014) -
Efficient identification scheme in standard model based on bivariate function hard problem
door: Tea, Boon Chian
Gepubliceerd in: (2014) -
Efficient identification schmene in standard model based on bivariate function hard problem /
door: Tea, Boon Chia -
An efficient identification scheme in standard model based on the diophantine equation hard problem
door: Tea, Boon Chian, et al.
Gepubliceerd in: (2013)
