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...
        Enregistré dans:
      
    
                  | Auteurs principaux: | Boon, Chian Tea, Kamel Ariffin, Muhammad Rezal, Abd Ghafar, Amir Hamzah, Sapar, Siti Hasana, Mohamat Johari, Mohamat Aidil | 
|---|---|
| Format: | Article | 
| Publié: | 
        Multidisciplinary Digital Publishing Institute
    
      2022
     | 
| Tags: | 
       Ajouter un tag    
     
      Pas de tags, Soyez le premier à ajouter un tag!
    | 
Documents similaires
- 
                
        
          An identification scheme based on bivariate function hard problem        
                  
par: Tea, Boon Chian, et autres
Publié: (2014) - 
                
        
          Efficient identification scheme in standard model based on bivariate function hard problem        
                  
par: Tea, Boon Chian
Publié: (2014) - 
                
        
          Efficient identification scheme in standard model based on bivariate function hard problem        
                  
par: Tea, Boon Chian
Publié: (2014) - 
                
        
          Efficient identification schmene in standard model based on bivariate function hard problem /        
                  
par: Tea, Boon Chia - 
                
        
          An efficient identification scheme in standard model based on the diophantine equation hard problem        
                  
par: Tea, Boon Chian, et autres
Publié: (2013) 
