Cluster analysis is one of the major data analysis methods widely used for many practical applications in emerging areas of data mining. A good clustering method will produce high quality clusters with high intra-clus...Cluster analysis is one of the major data analysis methods widely used for many practical applications in emerging areas of data mining. A good clustering method will produce high quality clusters with high intra-cluster similarity and low inter-cluster similarity. Clustering techniques are applied in different domains to predict future trends of available data and its uses for the real world. This research work is carried out to find the performance of two of the most delegated, partition based clustering algorithms namely k-Means and k-Medoids. A state of art analysis of these two algorithms is implemented and performance is analyzed based on their clustering result quality by means of its execution time and other components. Telecommunication data is the source data for this analysis. The connection oriented broadband data is given as input to find the clustering quality of the algorithms. Distance between the server locations and their connection is considered for clustering. Execution time for each algorithm is analyzed and the results are compared with one another. Results found in comparison study are satisfactory for the chosen application.展开更多
Many evidences have showed that some intelligence agencies(often called big brother)attempt to monitor citizens’communication by providing coerced citizens a lot of subverted cryptographic algorithms and coercing the...Many evidences have showed that some intelligence agencies(often called big brother)attempt to monitor citizens’communication by providing coerced citizens a lot of subverted cryptographic algorithms and coercing them to adopt these algorithms.Since legalized services on large number of various applications and system architectures depend on digital signature techniques,in the context some coerced users who use double authentication preventing signatures to design some novel digital signature techniques,have some convincing dissertations to defuse requests from authorities and big brothers creating some corresponding subverted signatures.As rapid progress in quantum computers,National Security Agency advisory memorandum and announcement of National Institute of Standards and Technology procedures from standardization focus on some cryptographic algorithms which are post quantum secure.Motivated by these issues,we design an algorithm substitution attack against Fiat-Shamir family based on lattices(e.g.,BLISS,BG,Ring-TESLA,PASSSign and GLP)that are proven post-quantum computational secure.We also show an efficient deterable way to eliminate big brother’s threat by leaking signing keys from signatures on two messages to be public.Security proof shows that our schemes satisfy key extraction,undetectability and deterability.Through parameters analysis and performance evaluation,we demonstrate that our deterring subverted Fiat-Shamir signature is practical,which means that it can be applied to privacy and protection in some system architectures.展开更多
Internet of Things is an ecosystem of interconnected devices that are accessible through the internet.The recent research focuses on adding more smartness and intelligence to these edge devices.This makes them suscept...Internet of Things is an ecosystem of interconnected devices that are accessible through the internet.The recent research focuses on adding more smartness and intelligence to these edge devices.This makes them susceptible to various kinds of security threats.These edge devices rely on cryptographic techniques to encrypt the pre-processed data collected from the sensors deployed in the field.In this regard,block cipher has been one of the most reliable options through which data security is accomplished.The strength of block encryption algorithms against different attacks is dependent on its nonlinear primitive which is called Substitution Boxes.For the design of S-boxes mainly algebraic and chaos-based techniques are used but researchers also found various weaknesses in these techniques.On the other side,literature endorse the true random numbers for information security due to the reason that,true random numbers are purely non-deterministic.In this paper firstly a natural dynamical phenomenon is utilized for the generation of true random numbers based S-boxes.Secondly,a systematic literature review was conducted to know which metaheuristic optimization technique is highly adopted in the current decade for the optimization of S-boxes.Based on the outcome of Systematic Literature Review(SLR),genetic algorithm is chosen for the optimization of s-boxes.The results of our method validate that the proposed dynamic S-boxes are effective for the block ciphers.Moreover,our results showed that the proposed substitution boxes achieve better cryptographic strength as compared with state-of-the-art techniques.展开更多
Substitution boxes(S-boxes)are key components of symmetrical cryptosystems,acting as nonlinear substitutionfunctions that hide the relationship between the encrypted text and input key.This confusion mechanism is vita...Substitution boxes(S-boxes)are key components of symmetrical cryptosystems,acting as nonlinear substitutionfunctions that hide the relationship between the encrypted text and input key.This confusion mechanism is vitalfor cryptographic security because it prevents attackers from intercepting the secret key by analyzing the encryptedtext.Therefore,the S-box design is essential for the robustness of cryptographic systems,especially for the dataencryption standard(DES)and advanced encryption standard(AES).This study focuses on the application of theffreffy algorithm(FA)and metaheuristic lion optimization algorithm(LOA),thereby proposing a hybrid approachcalled the metaheuristic lion ffreffy(ML-F)algorithm.FA,inspired by the blinking behavior of ffreffies,is a relativelynew calculation technique that is effective for various optimization problems.However,FA offen experiences earlyconvergence,limiting the ability to determine the global optimal solution in complex search areas.To address thisproblem,the ML-F algorithm was developed by combining the strengths of FA and LOA.This study identiffesa research gap in enhancing S-box nonlinearity and resistance to differential attacks,which the proposed ML-Faims to address.The main contributions of this paper are the enhanced cryptographic robustness of the S-boxesdeveloped with ML-F,consistently outperforming those generated by FA and other methodsregarding nonlinearityand overall cryptographic properties.The LOA,inspired by the social hunting behavior of lions,uses the collectiveintelligence of a pride of lions to explore and exploit the search space more effectively.The experimental analysis ofthisstudy focused on the main encryption criteria,namely,nonlinearity,the bit independence criterion(BIC),strictavalanche criterion(SAC),differential probability(DP),and maximum expected linear probability(MELP).Thesecriteria ensure that the S-boxes provide robust security against various cryptanalytic attacks.The ML-F algorithmconsistently surpassed the FA and other optimization algorithms in generating S-boxes with higher nonlinearityand better overall cryptographic properties.In case of ML-F-based S-boxes,the results indicated a better averagenonlinear score and more resistance against several cryptographic attacks for quite a number of criteria.Therefore,they were considered more reliable while dealing with secured encryption.The values generated by the ML-FS-boxes are near ideal in both SAC and BIC,indicating better diffusion properties and consequently,enhancedsecurity.The DP analysisfurthershowed that the ML-F-generated S-boxes are highly resistant to differential attacks,which is a crucial requirement for secure encryption systems.展开更多
We introduce a concept for the majorization order on monomials. With the help of this order, we derive a necessary condition on the positive termination of a general successive difference substitution algorithm （KSDS...We introduce a concept for the majorization order on monomials. With the help of this order, we derive a necessary condition on the positive termination of a general successive difference substitution algorithm （KSDS） for an input form f.展开更多
This paper presents state-of-art cryptanalysis studies on attacks of the substitution and transposition ciphers using various metaheuristic algorithms.Traditional cryptanalysis methods employ an exhaustive search,whic...This paper presents state-of-art cryptanalysis studies on attacks of the substitution and transposition ciphers using various metaheuristic algorithms.Traditional cryptanalysis methods employ an exhaustive search,which is computationally expensive.Therefore,metaheuristics have attracted the interest of researchers in the cryptanalysis field.Metaheuristic algorithms are known for improving the search for the optimum solution and include Genetic Algorithm,Simulated Annealing,Tabu Search,Particle Swarm Optimization,Differential Evolution,Ant Colony,the Artificial Bee Colony,Cuckoo Search,and Firefly algorithms.The most important part of these various applications is deciding the fitness function to guide the search.This review presents how these algorithms have been implemented for cryptanalysis purposes.The paper highlights the results and findings of the studies and determines the gaps in the literature.展开更多
Being as unique nonlinear components of block ciphers,substitution boxes（S-boxes） directly affect the security of the cryptographic systems.It is important and difficult to design cryptographically strong S-boxes th...Being as unique nonlinear components of block ciphers,substitution boxes（S-boxes） directly affect the security of the cryptographic systems.It is important and difficult to design cryptographically strong S-boxes that simultaneously meet with multiple cryptographic criteria such as bijection,non-linearity,strict avalanche criterion（SAC）,bits independence criterion（BIC）,differential probability（DP） and linear probability（LP）.To deal with this problem,a chaotic S-box based on the artificial bee colony algorithm（CSABC） is designed.It uses the S-boxes generated by the six-dimensional compound hyperchaotic map as the initial individuals and employs ABC to improve their performance.In addition,it considers the nonlinearity and differential uniformity as the fitness functions.A series of experiments have been conducted to compare multiple cryptographic criteria of this algorithm with other algorithms.Simulation results show that the new algorithm has cryptographically strong S-box while meeting multiple cryptographic criteria.展开更多
文摘Cluster analysis is one of the major data analysis methods widely used for many practical applications in emerging areas of data mining. A good clustering method will produce high quality clusters with high intra-cluster similarity and low inter-cluster similarity. Clustering techniques are applied in different domains to predict future trends of available data and its uses for the real world. This research work is carried out to find the performance of two of the most delegated, partition based clustering algorithms namely k-Means and k-Medoids. A state of art analysis of these two algorithms is implemented and performance is analyzed based on their clustering result quality by means of its execution time and other components. Telecommunication data is the source data for this analysis. The connection oriented broadband data is given as input to find the clustering quality of the algorithms. Distance between the server locations and their connection is considered for clustering. Execution time for each algorithm is analyzed and the results are compared with one another. Results found in comparison study are satisfactory for the chosen application.
基金Supported by the National Natural Science Foundation of China(61802239,61872229,62062019,62074131)Key Research and Development Program of Shaanxi Province(2020ZDLGY09-06,2021ZDLGY06-04,2021ZDLGY05-01)+1 种基金Natural Science Basic Research Plan in Shaanxi Province(2019JQ-667,2020JQ-422)Shenzhen Fundamental Research Program(20210317191843003)
文摘Many evidences have showed that some intelligence agencies(often called big brother)attempt to monitor citizens’communication by providing coerced citizens a lot of subverted cryptographic algorithms and coercing them to adopt these algorithms.Since legalized services on large number of various applications and system architectures depend on digital signature techniques,in the context some coerced users who use double authentication preventing signatures to design some novel digital signature techniques,have some convincing dissertations to defuse requests from authorities and big brothers creating some corresponding subverted signatures.As rapid progress in quantum computers,National Security Agency advisory memorandum and announcement of National Institute of Standards and Technology procedures from standardization focus on some cryptographic algorithms which are post quantum secure.Motivated by these issues,we design an algorithm substitution attack against Fiat-Shamir family based on lattices(e.g.,BLISS,BG,Ring-TESLA,PASSSign and GLP)that are proven post-quantum computational secure.We also show an efficient deterable way to eliminate big brother’s threat by leaking signing keys from signatures on two messages to be public.Security proof shows that our schemes satisfy key extraction,undetectability and deterability.Through parameters analysis and performance evaluation,we demonstrate that our deterring subverted Fiat-Shamir signature is practical,which means that it can be applied to privacy and protection in some system architectures.
文摘Internet of Things is an ecosystem of interconnected devices that are accessible through the internet.The recent research focuses on adding more smartness and intelligence to these edge devices.This makes them susceptible to various kinds of security threats.These edge devices rely on cryptographic techniques to encrypt the pre-processed data collected from the sensors deployed in the field.In this regard,block cipher has been one of the most reliable options through which data security is accomplished.The strength of block encryption algorithms against different attacks is dependent on its nonlinear primitive which is called Substitution Boxes.For the design of S-boxes mainly algebraic and chaos-based techniques are used but researchers also found various weaknesses in these techniques.On the other side,literature endorse the true random numbers for information security due to the reason that,true random numbers are purely non-deterministic.In this paper firstly a natural dynamical phenomenon is utilized for the generation of true random numbers based S-boxes.Secondly,a systematic literature review was conducted to know which metaheuristic optimization technique is highly adopted in the current decade for the optimization of S-boxes.Based on the outcome of Systematic Literature Review(SLR),genetic algorithm is chosen for the optimization of s-boxes.The results of our method validate that the proposed dynamic S-boxes are effective for the block ciphers.Moreover,our results showed that the proposed substitution boxes achieve better cryptographic strength as compared with state-of-the-art techniques.
文摘Substitution boxes(S-boxes)are key components of symmetrical cryptosystems,acting as nonlinear substitutionfunctions that hide the relationship between the encrypted text and input key.This confusion mechanism is vitalfor cryptographic security because it prevents attackers from intercepting the secret key by analyzing the encryptedtext.Therefore,the S-box design is essential for the robustness of cryptographic systems,especially for the dataencryption standard(DES)and advanced encryption standard(AES).This study focuses on the application of theffreffy algorithm(FA)and metaheuristic lion optimization algorithm(LOA),thereby proposing a hybrid approachcalled the metaheuristic lion ffreffy(ML-F)algorithm.FA,inspired by the blinking behavior of ffreffies,is a relativelynew calculation technique that is effective for various optimization problems.However,FA offen experiences earlyconvergence,limiting the ability to determine the global optimal solution in complex search areas.To address thisproblem,the ML-F algorithm was developed by combining the strengths of FA and LOA.This study identiffesa research gap in enhancing S-box nonlinearity and resistance to differential attacks,which the proposed ML-Faims to address.The main contributions of this paper are the enhanced cryptographic robustness of the S-boxesdeveloped with ML-F,consistently outperforming those generated by FA and other methodsregarding nonlinearityand overall cryptographic properties.The LOA,inspired by the social hunting behavior of lions,uses the collectiveintelligence of a pride of lions to explore and exploit the search space more effectively.The experimental analysis ofthisstudy focused on the main encryption criteria,namely,nonlinearity,the bit independence criterion(BIC),strictavalanche criterion(SAC),differential probability(DP),and maximum expected linear probability(MELP).Thesecriteria ensure that the S-boxes provide robust security against various cryptanalytic attacks.The ML-F algorithmconsistently surpassed the FA and other optimization algorithms in generating S-boxes with higher nonlinearityand better overall cryptographic properties.In case of ML-F-based S-boxes,the results indicated a better averagenonlinear score and more resistance against several cryptographic attacks for quite a number of criteria.Therefore,they were considered more reliable while dealing with secured encryption.The values generated by the ML-FS-boxes are near ideal in both SAC and BIC,indicating better diffusion properties and consequently,enhancedsecurity.The DP analysisfurthershowed that the ML-F-generated S-boxes are highly resistant to differential attacks,which is a crucial requirement for secure encryption systems.
基金Supported by the National Key Basic Research Project of China(Grant No.2011CB302402)the Fundamental Research Funds for the Central Universities,Southwest University for Nationalities(Grant No.12NZYTH04)
文摘We introduce a concept for the majorization order on monomials. With the help of this order, we derive a necessary condition on the positive termination of a general successive difference substitution algorithm （KSDS） for an input form f.
基金This study is supported by Erciyes University Research Projects Unit with grant number FDK-2016-7085the initials of authors who received the grant are A and B and the URL to sponsors’websites is http://bap.erciyes.edu.tr/。
文摘This paper presents state-of-art cryptanalysis studies on attacks of the substitution and transposition ciphers using various metaheuristic algorithms.Traditional cryptanalysis methods employ an exhaustive search,which is computationally expensive.Therefore,metaheuristics have attracted the interest of researchers in the cryptanalysis field.Metaheuristic algorithms are known for improving the search for the optimum solution and include Genetic Algorithm,Simulated Annealing,Tabu Search,Particle Swarm Optimization,Differential Evolution,Ant Colony,the Artificial Bee Colony,Cuckoo Search,and Firefly algorithms.The most important part of these various applications is deciding the fitness function to guide the search.This review presents how these algorithms have been implemented for cryptanalysis purposes.The paper highlights the results and findings of the studies and determines the gaps in the literature.
基金supported by the National Natural Science Foundation of China(6060309260975042)
文摘Being as unique nonlinear components of block ciphers,substitution boxes（S-boxes） directly affect the security of the cryptographic systems.It is important and difficult to design cryptographically strong S-boxes that simultaneously meet with multiple cryptographic criteria such as bijection,non-linearity,strict avalanche criterion（SAC）,bits independence criterion（BIC）,differential probability（DP） and linear probability（LP）.To deal with this problem,a chaotic S-box based on the artificial bee colony algorithm（CSABC） is designed.It uses the S-boxes generated by the six-dimensional compound hyperchaotic map as the initial individuals and employs ABC to improve their performance.In addition,it considers the nonlinearity and differential uniformity as the fitness functions.A series of experiments have been conducted to compare multiple cryptographic criteria of this algorithm with other algorithms.Simulation results show that the new algorithm has cryptographically strong S-box while meeting multiple cryptographic criteria.
