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...
Saved in:
| Main Authors: | Boon, Chian Tea, Kamel Ariffin, Muhammad Rezal, Abd Ghafar, Amir Hamzah, Sapar, Siti Hasana, Mohamat Johari, Mohamat Aidil |
|---|---|
| 格式: | Article |
| 出版: |
Multidisciplinary Digital Publishing Institute
2022
|
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
An identification scheme based on bivariate function hard problem
由: Tea, Boon Chian, et al.
出版: (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, et al.
出版: (2013)
