Showing papers by "Sedat Akleylek published in 2017"

The trend of business intelligence adoption and maturity

Abstract: In this paper, the trend of Business Intelligence (BI) adoption and maturity has been evaluated. Special emphasis was given to the small-to-medium enterprises (SME) business adoption and intensive review of BI maturity model in for the contemporary business world. Therefore, this study surveyed research works that reveal most determinants for BI efficiency. The survey has extract what lead organization to a better understanding of development and testing of BI framework. The study has found out that BI adoption has been highly related to Information and Communication Technology (ICT) tool utilization. Moreover, the success of BI to business are observed when users are able to leverage the best use of their data, by summarizing and aggregating information for business goals. Thus, understanding the fact, an investigation has been approached to identify BI adoption trends towards companies using BI. Results revealed that technology company, as well as a Production company, took the highest in BI adoption.

An Artificial Bee Colony Algorithm for Solving the Weapon Target Assignment Problem

Abstract: In this paper, we deal with the static weapon target assignment (WTA) problem which is a hard combinatorial optimization problem having some industrial applications. The aim of the WTA problem is to find an assignment of weapons to targets with the minimum total survival value of the targets. The WTA problem is known to be NP-complete problem. In this paper, we propose a novel artificial bee algorithm to give an efficient solution to the WTA problem. We test the proposed algorithm with benchmark problem instances and compare it with some other meta-heuristics in the literature. Computational tests show that our algorithm is competitive.

A Modified Parallel Learning Vector Quantization Algorithm for Real-Time Hardware Applications

Abstract: In this study a modified learning vector quantization (LVQ) algorithm is proposed. For this purpose, relevance LVQ (RLVQ) algorithm is efficiently combined with a reinforcement mechanism. In this mechanism, it is shown that the proposed algorithm is not affected constantly by both relevance–irrelevance input dimensions and the winning of the same neuron. Hardware design of the proposed scheme is also given to illustrate the performance of the algorithm. The proposed algorithm is compared to the corresponding ones with regard to success rate and running time.

Efficient methods to generate cryptographically significant binary diffusion layers

Abstract: In this study, the authors propose new methods using a divide-and-conquer strategy to generate n × n binary matrices (for composite n) with a high/maximum branch number and the same Hamming weight in each row and column. They introduce new types of binary matrices: namely, ( BHwC ) t, m and ( BCwC ) q, m types, which are a combination of Hadamard and circulant matrices, and the recursive use of circulant matrices, respectively. With the help of these hybrid structures, the search space to generate a binary matrix with a high/maximum branch number is drastically reduced. By using the proposed methods, they focus on generating 12 × 12, 16 × 16 and 32 × 32 binary matrices with a maximum or maximum achievable branch number and the lowest implementation costs (to the best of their knowledge) to be used in block ciphers. Then, they discuss the implementation properties of binary matrices generated and present experimental results for binary matrices in these sizes. Finally, they apply the proposed methods to larger sizes, i.e. 48 × 48, 64 × 64 and 80 × 80 binary matrices having some applications in secure multi-party computation and fully homomorphic encryption.

A novel identicication scheme for post-quantum secure digital right management

Abstract: With the progress of technology and widespread use of internet, the data has become digital. It is getting easier day by day to copy, modify and transform digital data / applications into another form. The term of digital rights management (DRM) has been suggested to limit the use of data in digital media and to protect copyrights. Different architectures / technologies are used to provide DRM. In existing architectures, the user is unaware whether the license, which was purchased, is used by an unauthorized party. In this paper, a structure is given to resolve this problem and fairness property is added for DRM architectures. Moreover, a post-quantum reliable identification protocol based on multivariate quadratic systems, which can be used for access control in DRM architecture, is proposed.

On the design strategies of diffusion layers and key schedule in lightweight block ciphers

Abstract: In recent years, lightweight cryptography has become essential especially for the resource-constrained devices to ensure data protection and security. The selection of suitable cryptographic algorithm which is directly linked to requirements of the system will have dynamically effect on following such metrics like performance of the device, hardware resource cost, the area, speed, efficiency, computation latency, communication bandwidth. This paper aims to provide a comprehensive survey on the lightweight block ciphers that were given in the literature and throw a light on the future research directions. Then, the focus is given to the diffusion layers in view of construction methods and efficiency. A new metric based on the order of the matrix to measure the security of diffusion layer consisting MDS matrix over a finite field extension is proposed and related experimental results are given. Key schedule of the lightweight block ciphers is analyzed.

Üç teri̇mli̇ poli̇nomlar i̇çi̇n karatsuba benzeri̇ çarpma yöntemleri̇ni̇n araştirilmasi

Abstract: Bu calismada, katsayilari tamsayi olan iki polinomu aritmetik karmasiklik acisindan daha verimli carpan yontemlerin arastirilmasi hedeflenmektedir. Bu yuzden, Bol-ve-Fethet mantigini kullanan, Karatsuba-Ofman Algoritmasindan yola cikarak carpma islemlerini daha az maliyetli toplama/cikarma islemleriyle degistiren denklemler bulan bir yazilim gelistirilmistir. Gelistirilen uygulamada, uc terimli iki polinomun katsayilarinin olasi kombinasyonlari kullanilarak carpma isleminden sonra butun carpim katsayilarinin bulunup bulmadigini test edilmektedir. Uc terimli polinomlari carpmak icin 3 farkli yontem oldugu ve bu yontemlerin hepsinde 6 carpma, 13 toplama/cikarma islemine ihtiyac duyuldugu hesaplanmistir. Bunlara ek olarak, daha fazla terimli polinomlarin carpimi icin ne tur uygulamalara ihtiyac duyuldugu konusunda detaylara da yer verilmistir.