• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.2235-2253
• /
• 2011

Digital document file such as Adobe Acrobat or MS-Office is encrypted by its own ciphering algorithm with a user password. When this password is not known to a user or a forensic inspector, it is necessary to recover the password to open the encrypted file. Password cracking by brute-force search is a perfect approach to discover the password but a time consuming process. This paper presents a new method of speeding up password recovery on Graphic Processing Unit (GPU) using a Compute Unified Device Architecture (CUDA). PDF files are chosen as a password cracking target, and the Abode Acrobat password recovery algorithm is examined. Experimental results show that the proposed method gives high performance at low cost, with a cluster of GPU nodes significantly speeding up the password recovery by exploiting a number of computing nodes. Password cracking performance is increased linearly in proportion to the number of computing nodes and GPUs.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.105-108
• /
• 2003

In the next generation backbone networks based on dense-wavelength division multiplexing (DWDM), the routing and wavelength assignment with quality-of-service (QoS) recovery is essentially needed to support a wide range of communication-intensive and real-time multimedia services. This paper proposes a new dpmic routing method called as MW-MIPR (MultiWavelength-Minimum Interference Path Routing), which chooses a route that does not interfere too much with many potential future connection requests. This paper also proposes a differentiated RWA mechanisms combined with MW-MIPR algorithm to provide QoS recovery for various multimedia applications in the next generation backbone networks based on DWDM.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12C
• /
• pp.1029-1034
• /
• 2010

For All Digital QPSK receivers, a phase recovery scheme is required to fix the arbitrarily rotated I/Q quadrature signals due to the transmission path and clock mismatch between the transmitter and the receiver. The conventional Costas phase recovery loop scheme requires a separate AGC(Automatic Gain Control) to obtain the performance independent of input signal power. This paper proposes a simple scheme which separates the phase and amplitude of the input signal via CORDIC algorithm and performs the phase recovery and amplitude compensation simultaneously. The proposed scheme can considerably reduce the logic resources in hardware implementation, has been verified by C++ and Model Sim simulations.

• Proceedings of the Korea Electromagnetic Engineering Society Conference
• /
• 2003.11a
• /
• pp.403-406
• /
• 2003

In this paper, we have proposed a carrier recovery algorithm of OFDM/QPSK-DMR(Orthogonal Frequency Division Multiplexing/Quadrature Phase Shift Keying Modulation-Digital Microwave Radio)system using BL-PSF(Band Limited-Pulse Shaping Filter) and have analyzed the carrier phase MSE(Mean Square Error) performance of OFDM/QPSK and single carrier DMR systems. The existing OFDM/QPSK-DMR system using windowing requires training sequence or CP(Cyclic prefix) to synchronize a receive. carrier frequency. Because in the OFDM/QPSK-DMR system using BL-PSF there is no training sequence or CP(Cyclic Prefix), we also propose a carrier recovery useful to the system. The simulation results confirm that the proposed carrier recovery algorithm has the same carrier phase MSE(Mean Square Error) performance for the single carrier DMR system under AWGN(Additive White Gaussian Noise) environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4287-4306
• /
• 2016

Network resilience provides an effective way to overcome the problem of network failure and is crucial to Internet protocol (IP) network management. As one of the main challenges in network resilience, recovering from link failure is important to maintain the constancy of packets being transmitted. However, existing failure recovery approaches do not handle the traffic engineering problem (e.g., tuning the routing-protocol parameters to optimize the rerouting traffic flow), which may cause serious congestions. Moreover, as the lack of QoS (quality of service) restrictions may lead to invalid rerouting traffic, the QoS requirements (e.g., bandwidth and delay) should also be taken into account when recovering the failed links. In this paper, we first develop a probabilistically correlated failure model that can accurately reflect the correlation between link failures, with which we can choose reliable backup paths (BPs). Then we construct a mathematical model for the failure recovery problem, which takes maximum rerouting traffic as the optimizing objective and the QoS requirements as the constraints. Moreover, we propose a heuristic algorithm for link failure recovery, which adopts the improved k shortest path algorithm to splice the single BP and supplies more protection resources for the links with higher priority. We also prove the correctness of the proposed algorithm. Moreover, the time and space complexity are also analyzed. Simulation results under NS2 show that the proposed algorithm improves the link failure recovery rate and increases the QoS satisfaction rate significantly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.7
• /
• pp.424-430
• /
• 2014

In this paper, we propose a compressed sensing-based signal recovery technique for an uplink multi-user spatial modulation (MU-SM) system. In the MU-SM system, only one antenna among $N_t$ antennas of each user becomes active by nature. Thus, this characteristics is exploited for signal recovery at a base station. We modify the conventional orthogonal matching pursuit (OMP) algorithm which has been widely used for sparse signal recovery in literature for the MU-SM system, which is called MU-OMP. We also propose a parallel OMP algorithm for the MU-SM system, which is called MU-POMP. Specifically, in the proposed algorithms, antenna indices of a specific user who was selected in the previous iteration are excluded in the next iteration of the OMP algorithm. Simulation results show that the proposed algorithms outperform the conventional OMP algorithm in the MU-SM system.

• Journal of Digital Contents Society
• /
• v.12 no.1
• /
• pp.133-139
• /
• 2011

Structured P2P (peer-to-peer) networks have received much attention in research communities and the industry. The data stored in structured P2P networks can be located in a log-scale time without using central severs. The link-structure of structured P2P networks should be maintained for keeping log-scale search performance of it. When nodes join or leave structured P2P networks frequently, some links become unavailable and search performance is degraded by these links. To sustain search performance of structured P2P networks, periodic link recovery scheme is generally used. However, when the link recovery period is short or long compared with node join and leave rates, it is possible that sufficient number of links are not restored or excessive messages are used after the link-structure is restored. We propose the adaptive link recovery determination algorithm to maintain the link-structure of structured P2P networks when the rates of node joining and leaving are changed dynamically. The simulation results show that the proposed algorithm can maintain similar QoS under various node leaving rates.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.251-259
• /
• 2007

A Bluetooth ad hoc network can be formed by interconnecting piconets into scatternet. Many algorithms of scatternet formation have been proposed so far. However, these have a problem that takes a long time to reform scatternet, especially for the case of master moving out. In this paper we propose a Fast-Recovery algorithm. which aims at reducing the time of scatternet reformation owing to master moving out. In the algorithm, we select a slave with the weigh similar to its master as Sub-Master from a piconet device table created by the master When a master leaves its piconet is detected by its slaves, the Sub-Master becomes the new master of the piconet instead of the old and directly connect to other slaves and bridge(s) through piconet device table in page state.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1864-1871
• /
• 2001

In this paper, new symbol timing recovery algorithm is proposed, which is suitable for the digital communication system with Multi-level PAM signals. In the newly proposed symbol timing recovery algorithm, the timing error function is derived by compensating the several difference values between sampled symbol and neighboring symbol every symbol period with mid samples and decided symbol values. Conventional symbol timing recovery methods did not work well in Multi-level PAM signals, but the newly proposed method can be applied to Multi-level PAM signals as well as QPSK. For the performance analysis, the derived variance of the timing error function and the timing error characteristics of S-curve show that the proposed method has better performance than Gardner method and the modified Gardner method.

• Journal of Digital Contents Society
• /
• v.6 no.1
• /
• pp.41-48
• /
• 2005

In this paper, we propose and evaluate symbol timing recovery algorithm for S-DMT cable modern, which supports more channels and better quality symmetric mutimedia service over HFC network. We adopt timing recovery algorithm of PN sequence insertion in time domain and evaluate the performance of it in various noise channel such as AWGN, ISI, impulse. We verified that performance of this algorithm is depends on the channel noise environment and sampling clock offset and that over 10 dB degradation of Eb/No is occurred at the timing failure probability of $10^3$ in the composite noise channel of AWGN, ISI, and impulse in comparison with impulse noise-alone channel. finally, we verified that this algorithm showed good timing failure probability in case of sampling clock optimization was performed in advance.