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...
Kaydedildi:
| Asıl Yazarlar: | Boon, Chian Tea, Kamel Ariffin, Muhammad Rezal, Abd Ghafar, Amir Hamzah, Sapar, Siti Hasana, Mohamat Johari, Mohamat Aidil |
|---|---|
| Materyal Türü: | Makale |
| Baskı/Yayın Bilgisi: |
Multidisciplinary Digital Publishing Institute
2022
|
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|
Benzer Materyaller
-
An identification scheme based on bivariate function hard problem
Yazar:: Tea, Boon Chian, ve diğerleri
Baskı/Yayın Bilgisi: (2014) -
Efficient identification scheme in standard model based on bivariate function hard problem
Yazar:: Tea, Boon Chian
Baskı/Yayın Bilgisi: (2014) -
Efficient identification scheme in standard model based on bivariate function hard problem
Yazar:: Tea, Boon Chian
Baskı/Yayın Bilgisi: (2014) -
Efficient identification schmene in standard model based on bivariate function hard problem /
Yazar:: Tea, Boon Chia -
An efficient identification scheme in standard model based on the diophantine equation hard problem
Yazar:: Tea, Boon Chian, ve diğerleri
Baskı/Yayın Bilgisi: (2013)
