• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.49-60
• /
• 2023

The amount of data generated by electronic systems through e-commerce, social networks, and data computation has risen. However, the security of data has always been a challenge. The problem is not with the quantity of data but how to secure the data by ensuring its confidentiality and privacy. Though there are several research on cloud data security, this study proposes a security scheme with the lowest execution time. The approach employs a non-linear time complexity to achieve data confidentiality and privacy. A symmetric algorithm dubbed the Non-Deterministic Cryptographic Scheme (NCS) is proposed to address the increased execution time of existing cryptographic schemes. NCS has linear time complexity with a low and unpredicted trend of execution times. It achieves confidentiality and privacy of data on the cloud by converting the plaintext into Ciphertext with a small number of iterations thereby decreasing the execution time but with high security. The algorithm is based on Good Prime Numbers, Linear Congruential Generator (LGC), Sliding Window Algorithm (SWA), and XOR gate. For the implementation in C, thirty different execution times were performed and their average was taken. A comparative analysis of the NCS was performed against AES, DES, and RSA algorithms based on key sizes of 128kb, 256kb, and 512kb using the dataset from Kaggle. The results showed the proposed NCS execution times were lower in comparison to AES, which had better execution time than DES with RSA having the longest. Contrary, to existing knowledge that execution time is relative to data size, the results obtained from the experiment indicated otherwise for the proposed NCS algorithm. With data sizes of 128kb, 256kb, and 512kb, the execution times in milliseconds were 38, 711, and 378 respectively. This validates the NCS as a Non-Deterministic Cryptographic Algorithm. The study findings hence are in support of the argument that data size does not determine the execution.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.281-289
• /
• 2006

Even though software developing environment has been changing to Web basis very fast, there are just few studies of quality metric or estimation model for Web software. In this study after analyzing the correlation between the risk level and property of objects using linear regression, six middle sized industrial system has been used to propose the correlation model of size and Number of Classes(NOC), size and Number of Methods(NOM), complexity and NOC, and complexity and NOM. Among of six systems 5 systems(except S06) have high correlation between size(LOC) and NOM, and four systems(except S04 & S06) have high correlation between complexity and NOC / NOM. As Web software architecture with three sides of Server, Client and HTML, complexity of each sides has been compared, two system(S04, S06) has big differences of each sides compleity values and one system(S06) has very higher complexity value of HTML, So the risk level could be estimated through NOM to improve maintenance in case of that the system has no big differences of each sides complexity.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1183-1194
• /
• 2004

Network partitioning problem is to partition a network into multiple blocks such that the size of cutset is minimized while keeping the block sizes balanced. Among these, iterative algorithms are regarded as simple and efficient which are based on cell move of Fiduccia and Mattheyses algorithm, Sanchis algorithm, or Kernighan and Lin algorithm. All these algorithms stipulate balanced block size as a constraint that should be satisfied, which makes a cell movement be inefficient. Park and Park introduced a balancing coefficient R by which the block size balance is considered as a part of partitioning cost, not as a constraint. However, Park and Park's algorithm has a square time complexity with respect to the number of cells. In this paper, we proposed Bucket algorithm that has a linear time complexity with respect to the number of cells, while taking advantage of the balancing coefficient. Reducing time complexity is made possible by a simple observation that balancing cost does not vary so much when a cell moves. Bucket data structure is used to maintain partitioning cost efficiently. Experimental results for MCNC test sets show that cutset size of proposed algorithm is 63.33% 92.38% of that of Sanchis algorithm while our algorithm satisfies predefined balancing constraints and acceptable execution time.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.6
• /
• pp.700-705
• /
• 2012

This paper suggests the detecting method in which it uses the candidate symbol obtained through PI-SDR, the little computational complexity is required. By using the candidate symbol matrices obtained through PI-SDR, ZF and MMSE method was applied and the received signal was detected. The linear detecting method using PI-SDR candidate symbol is out of the performance than ML detecting method but the complexity is low. Because of using the symbol come close to the solution of ML, the proposed method's performance is better than the existing ZF and MMSE method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6A
• /
• pp.488-496
• /
• 2012

In this paper, the scheme for designing optimal beamforming matrix for interference control is proposed. The optimal beamforming matrix is found though linear combination of interference alignment conditions and renewal of linear combination coefficient. The proposed scheme has advantages that the complexity is reduced and there is no multiplying operation in matrix calculations even if proposed scheme has the form similar to that of existing least square based scheme. The simulation results show that proposed scheme has about 4bps/Hz higher gain than existing least square scheme. Also there is no additional multiplying calculation and increase of matrix size when the number of transmit and receive antennas is increased.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6C
• /
• pp.577-584
• /
• 2005

Optimal methods for designing multiplierless minimal complexity FIR filters with cascaded prefilter-equalizer structures are proposed for narrowband communication systems. Assuming that an FIR filter consists of a cyclotomic polynomial(CP) prefilter and an interpolated second order polynomial(ISOP) equalizer, in the proposed method the prefilter and equalizer are simultaneously designed using mixed integer linear programming(MILP). The resulting filter is a cascaded filter with minimal complexity. Design examples demonstrate that the proposed methods produce a more computationally efficient cascaded prefilter-equalizer than other existing filters.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.4 s.304
• /
• pp.143-152
• /
• 2005

Optimal methods for designing multiplierless IIR filters with cascaded prefilter-equalizer structures are proposed for narrowband applications. Assuming that an U filter consists of a cyclotomic Polynomial (CP) prefilter and an all-Pole equalizer based on interpolated first order polynomial (IFOP), in the proposed method the prefilter and equalizer are simultaneously designed using mixed integer linear programming (MILP). The resulting filter is a cascaded filter with minimal complexity. In addition, MtP tries to minimize both computational complexity and phase response non-linearity. Design examples demonstrate that the proposed methods produce a more efficient cascaded prefilter-equalizer than existing methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.1
• /
• pp.105-113
• /
• 2000

This paper proposes the optimal design method of PSF(pulse shaping filter) with fixed-point coefficients, often used in digital communication system. Though RCF (Raised Cosine Filter) and Root-Squared RCF have less attenuation in stopband and are designed with floating point coefficients, those are selected by the reason that the design is simple. In this paper, 1 introduce the optimal design method for fixed point PSF including Root Squared type by using mixed integer linear programming. Through some design examples, it is shown that the proposed method better performs in ISI and requires less complexity. The complexity of the proposed filter is reduced to 20% as compared to conventional RCF and Root Squared RCF. For IS-95, that is the standard of CDMA system, the proposed filter reduces ISI up to 75% compared to the standard transmission filter.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.4
• /
• pp.385-391
• /
• 2008

To effectively cope with a complexity of kinematic metrology due to workspace enlargement of the planar stage, the linear induction motor is suggested as its new driving source. Especially, the linear induction motor under uniform plate type of secondary doesn't inherently have a periodical force ripple which is generally shown in the brushless DC motor. But, it presents a poor transient characteristic at zero or low speed zone owing to time delay of flux settling, resulting in slow response. To improve the servo property of linear induction motor and apply successfully it to the precision stage, this paper discusses a modified vector control methodology. The controller has a novel input form, fixed d-axis current, q-axis current and forward-fed DC current, to control thrust force and normal force of the linear induction motor independently. Influence of the newly introduced input and the feasibility of controller are validated experimentally.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.3
• /
• pp.658-665
• /
• 2013

While the chirp signal is extensively used in radar and sonar systems for target decision in wireless communication systems, it has not been widely used for positioning in indoor environments. Recently, the IEEE 802.15.4a standard has adopted the chirp spread spectrum (CSS) as an underlying technique for low-power and low-complexity precise localization. Chirp signal based ranging solutions have been established and deployed but their ranging performance has not been analyzed in multipath environments. This paper presents a ranging performance analysis of a chirp signal and suggests a method to suppress multipath error by using a type of non-linear chirp signal. Multipath ranging performance is evaluated using a conventional linear chirp signal and the proposed non-linear chirp signal. We verify the feasibility of both methods using two-ray multipath model simulation. Our results demonstrate that the proposed non-linear chirp signal can successfully suppress the multipath error.