scholarly journals Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation

2011 ◽  
Vol 60 (4) ◽  
pp. 602-607 ◽  
Author(s):  
Anwar Hasan ◽  
Christophe Negre
Keyword(s):  
Space Complexity ◽  
Polynomial Representation ◽  
Dickson Polynomial ◽  
Binary Fields

scholarly journals Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation

2010 ◽  
Vol 59 (12) ◽  
pp. 1585-1597 ◽  
Author(s):  
Jean-Claude Bajard ◽  
Christophe Negre ◽  
Thomas Plantard
Keyword(s):  
Space Complexity ◽  
Polynomial Representation ◽  
Binary Field

Research on Asset Recognition Algorithm of Information Security Product Based on Decision Tree Algorithm

2013 ◽  
Vol 397-400 ◽  
pp. 2296-2300 ◽  
Author(s):  
Fei Shuai ◽  
Jun Quan Li
Keyword(s):  
Computational Complexity ◽  
Information Security ◽  
Decision Tree ◽  
Recognition Algorithm ◽  
Space Complexity ◽  
Complex Relationship ◽  
Decision Tree Algorithm ◽  
Tree Algorithm ◽  
C4.5 Algorithm ◽  
C4.5 Decision Tree

In current, there are complex relationship between the assets of information security product. According to this characteristic, we propose a new asset recognition algorithm (ART) on the improvement of the C4.5 decision tree algorithm, and analyze the computational complexity and space complexity of the proposed algorithm. Finally, we demonstrate that our algorithm is more precise than C4.5 algorithm in asset recognition by an application example whose result verifies the availability of our algorithm.Keywordsdecision tree, information security product, asset recognition, C4.5

Sign in / Sign up

Export Citation Format

Share Document