• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.5
• /
• pp.1611-1633
• /
• 2022

At EUROCRYPT 2019, a new block cipher algorithm called BISON was proposed by Canteaut et al. which uses a novel structure named as Whitened Swap-Or-Not (WSN). Unlike the traditional wide trail strategy, the differential and linear properties of this algorithm can be easily determined. However, the encryption speed of the BISON algorithm is quite low due to a large number of iterative rounds needed to ensure certain security margins. Commonly, denoting by n is the data block length, this design requires 3n encryption rounds. Moreover, the block size n of BISON is always odd, which is not convenient for operations performed on a byte level. In order to overcome these issues, we propose a new block cipher, named DBISON, which more efficiently employs the ideas of double layers typical to the BISON-like construction. More precisely, DBISON divides the input into two parts of size n/2 bits and performs the round computations in parallel, which leads to an increased encryption speed. In particular, the data block length n of DBISON can be even, which gives certain additional implementation benefits over BISON. Furthermore, the resistance of DBISON against differential and linear attacks is also investigated. It is shown the maximal differential probability (MDP) is 1/2^n-1 for n encryption rounds and that the maximal linear probability (MLP) is strictly less than 1/2^n-1 when (n/2+3) iterative encryption rounds are used. These estimates are very close to the ideal values when n is close to 256.

• The Journal of the Acoustical Society of Korea
• /
• v.41 no.2
• /
• pp.218-226
• /
• 2022

The main characteristics of the underwater acoustic channel have varying multipath and fast fading. Especially, Frequency Shift Keying (FSK) signals with multiple frequency bands caused loss of information bits allocated on the specific frequencies due to selective fading phenomenon. Therefore, this paper proposes frequency gain control algorithm based on preamble error rates. The proposed algorithm estimates optimal gain value in the range of preamble error rate with less than 10 % for specific faded frequency. By employing turbo equalized FSK signals with rate of 1/3, the experiment was conducted on a lake in Munkyeong city with distance of 300 m to 500 m. The result confirms that packets are decoded successfully by applying proposed algorithm as increasing number of iterations.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.6 no.9
• /
• pp.81-90
• /
• 2016

Recently drones have become popular enough to be one of the hobby. The drone refers to an unmanned aerial vehicle which can fly and be steered by a radio wave without a pilot and it has a airplane or helicopter shape. The drone was first started to be used from military purpose, but its usage has been expanded to the private such as construction site, crop-dusting, field discovery, freight shipping and drones to prevent cheating. However the drone that we can see often in the market is expansive, hard to be repaired when it broken down and has a discomfort of the short flight time. In this paper, to solve an uncomfortable talk on the cheap 8-bits microcontrollers ATmega128 Using drone for implementation. Axes gyroscope and accelerometers mcu between posture an attitude control, communications through drone control, pid. Receiver input them into transmitter signals of movements to control drone c the programming was implemented in on the basis of language. drone using ATmega128 microcontroller is possible hovering, By utilizing a pin that are not required for control it can be used as a drone for a variety of uses.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.1
• /
• pp.170-191
• /
• 2024

The transmission of confidential data using cover media is called steganography. The three requirements of any effective steganography system are high embedding capacity, security, and imperceptibility. The text file's structure, which makes syntax and grammar more visually obvious than in other media, contributes to its poor imperceptibility. Text steganography is regarded as the most challenging carrier to hide secret data because of its insufficient redundant data compared to other digital objects. Unicode characters, especially non-printing or invisible, are employed for hiding data by mapping a specific amount of secret data bits in each character and inserting the character into cover text spaces. These characters are known with limited spaces to embed secret data. Current studies that used Unicode characters in text steganography focused on increasing the data hiding capacity with insufficient redundant data in a text file. A sequential embedding pattern is often selected and included in all available positions in the cover text. This embedding pattern negatively affects the text steganography system's imperceptibility and security. Thus, this study attempts to solve these limitations using the Part-of-speech (POS) tagging technique combined with the randomization concept in data hiding. Combining these two techniques allows inserting the Unicode characters in randomized patterns with specific positions in the cover text to increase data hiding capacity with minimum effects on imperceptibility and security. Format-preserving encryption (FPE) is also used to encrypt a secret message without changing its size before the embedding processes. By comparing the proposed technique to already existing ones, the results demonstrate that it fulfils the cover file's capacity, imperceptibility, and security requirements.

• International Journal of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.17-28
• /
• 2024

As listed as one of the most important requirements for Post-Quantum Cryptography standardization process by National Institute of Standards and Technology, the resistance to various side-channel attacks is considered very critical in deploying cryptosystems in practice. In fact, cryptosystems can easily be broken by side-channel attacks, even though they are considered to be secure in the mathematical point of view. The timing attack(TA) and the simple power analysis attack(SPA) are such side-channel attack methods which can reveal sensitive information by analyzing the timing behavior or the power consumption pattern of cryptographic operations. Thus, appropriate measures against such attacks must carefully be considered in the early stage of cryptosystem's implementation process. The Montgomery multiplier is a commonly used and classical gadget in implementing big-number-based cryptosystems including RSA and ECC. And, as recently proposed as an alternative of building blocks for implementing post quantum cryptography such as lattice-based cryptography, the big-number multiplier including the Montgomery multiplier still plays a role in modern cryptography. However, in spite of its effectiveness and wide-adoption, the multiplier is known to be vulnerable to TA and SPA. And this paper proposes a new countermeasure for the Montgomery multiplier against TA and SPA. Briefly speaking, the new measure first represents a multiplication operand without 0 digits, so the resulting multiplication operation behaves in a very regular manner. Also, the new algorithm removes the extra final reduction (which is intrinsic to the modular multiplication) to make the resulting multiplier more timing-independent. Consequently, the resulting multiplier operates in constant time so that it totally removes any TA and SPA vulnerabilities. Since the proposed method can process multi bits at a time, implementers can also trade-off the performance with the resource usage to get desirable implementation characteristics.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.3
• /
• pp.102-108
• /
• 2007

A high-Performance scalable speech codec generally requires a very low-rate first layer and a fine granule second layer, and this codec can be implemented with the harmonic codec and the MDCT-based transform codec for each layer. In this structure, however. each codec requires independent frequency transform and the time delay of each codec is accumulated. resulting in long time delay for the overall codec. In this paper, new MDCT structure in the second layer is Proposed. where MDCT is forced to share the look-ahead region of the first layer in order to prevent the time delay accumulation and the resulting functional error of MDCT is analyzed and removed after IMDCT The Proposed delayless MDCT requires no additional bits and Provides the equivalent coding performance with the reduced time delay, yielding a meaningful enhancement of the overall codec.

• The Journal of the Acoustical Society of Korea
• /
• v.27 no.1
• /
• pp.18-25
• /
• 2008

In this paper, new lossless coding method of spectral coefficients for audio codec is proposed. Conventional lossless coder uses Huffman coding utilizing the statistical characteristics of spectral coefficients, but does not provide the high coding efficiency due to its simple structure. To solve this limitation, new lossless coding scheme with better performance is proposed that consists of bit-plane transform and run-length coding. In the proposed scheme, the spectral coefficients are first transformed by bit-plane into 1-D bit-stream with better correlative properties, which is then coded intorun-length and is finally Huffman coded. In addition, the coding performance is further increased by applying the proposed bit-plane coding selectively to each group, after the entire frequency is divided into 3 groups. The performance of proposed coding scheme is measured in terms of theoretical number of bits based on the entropy, and shows at most 6% enhancement compared to that of conventional lossless coder used in AAC audio codec.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.188-198
• /
• 2005

The Goldschmidt iterative algorithm for finding a floating point square root calculated it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's square root algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the square root of a floating point number F, the algorithm repeats the following operations: $R_i=\frac{3-e_r-X_i}{2},\;X_{i+1}=X_i{\times}R^2_i,\;Y_{i+1}=Y_i{\times}R_i,\;i{\in}\{{0,1,2,{\ldots},n-1} }}'$with the initial value is $'\;X_0=Y_0=T^2{\times}F,\;T=\frac{1}{\sqrt {F}}+e_t\;'$. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than $'e_r=2^{-p}'$. The value of p is 28 for the single precision floating point, and 58 for the doubel precision floating point. Let $'X_i=1{\pm}e_i'$, there is $'\;X_{i+1}=1-e_{i+1},\;where\;'\;e_{i+1}<\frac{3e^2_i}{4}{\mp}\frac{e^3_i}{4}+4e_{r}'$. If '|X_i-1|<2^{\frac{-p+2}{2}}\;'$ is true, $'\;e_{i+1}<8e_r\;'$ is less than the smallest number which is representable by floating point number. So, $\sqrt{F}$ is approximate to $'\;\frac{Y_{i+1}}{T}\;'$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal square root tables ($T=\frac{1}{\sqrt{F}}+e_i$) with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a square root unit. Also, it can be used to construct optimized approximate reciprocal square root tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.2
• /
• pp.380-389
• /
• 2005

The Goldschmidt iterative algorithm for a floating point divide calculates it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's divide algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To calculate a floating point divide '$\frac{N}{F}$', multifly '$T=\frac{1}{F}+e_t$' to the denominator and the nominator, then it becomes ’$\frac{TN}{TF}=\frac{N_0}{F_0}$'. And the algorithm repeats the following operations: ’$R_i=(2-e_r-F_i),\;N_{i+1}=N_i{\ast}R_i,\;F_{i+1}=F_i{\ast}R_i$, i$\in${0,1,...n-1}'. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than ‘$e_r=2^{-p}$'. The value of p is 29 for the single precision floating point, and 59 for the double precision floating point. Let ’$F_i=1+e_i$', there is $F_{i+1}=1-e_{i+1},\;e_{i+1}',\;where\;e_{i+1}, If '$[F_i-1]<2^{\frac{-p+3}{2}}$ is true, ’$e_{i+1}<16e_r$' is less than the smallest number which is representable by floating point number. So, ‘$N_{i+1}$ is approximate to ‘$\frac{N}{F}$'. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal tables ($T=\frac{1}{F}+e_t$) with varying sizes. 1'he superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a divider. Also, it can be used to construct optimized approximate reciprocal tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc

• The Sea:JOURNAL OF THE KOREAN SOCIETY OF OCEANOGRAPHY
• /
• v.16 no.4
• /
• pp.180-195
• /
• 2011

A balanced trophic model for Sinjido marine ecosystem was constructed using ECOPATH model and data obtained 1994 in the region. The model integrates available information on biomass and food spectrum, and analyses ecosystem properties, dynamics of the main species populations and the key trophic pathways of the system, and then compares these results with those of other marine environments. The model comprises 17 groups of benthic algae, phytoplankton, zooplankton, gastropoda, polychaeta, bivalvia, echinodermata, crustacean, cephalopoda, goby, flatfish, rays and skates, croaker, blenny, conger, flatheads, and detritus. The model shows trophic levels of 1.0~4.0 from primary producers and detritus to top predator as flathead group. The model estimates total biomass(B) of 0.1 $kgWW/m^2$, total net primary production(PP) of 1.6 $kgWW/m^2/yr$, total system throughput(TST) of 3.4 $kgWW/m^2/yr$ and TST's components of consumption 7%, exports 43%, respiratory flows 4% and flows into detritus 46%. The model also calculates PP/TR of 0.012, PP/B of 0.015, omnivory index(OI) of 0.12, Fin's cycling index(FCI) of 0.7%, Fin's mean path length(MPL) of2.11, ascendancy(A) of 4.1 $kgWW/m^2/yr$ bits, development capacity(C) of 8.2 $kgWW/m^2/yr$ bits and A/C of 51%. In particular this study focuses the analysis of mixed trophic impacts and describes the indirect impact of a groupb upon another through mediating one based on 4 types. A large proportion of total export in TST means higher exchange rate in the study region than in semi enclosed basins, which seems by strong tidal currents along the channels between islands, called Sinjido, Choyakdo and Saengildo. Among ecosystem theory and cycling indices, B, TST, PP/TR, FCI, MPL and OI are shown low, indicating the system is not fully mature according to Odum's theory. Additionally, high A/C reveals the maximum capacity of the region is small. To sum up, the study region has high exports of trophic flow and low capacity to develop, and reaches a development stage in the moment. This is a pilot research applied to the Sinjido in terms of trophic flow and food web system such that it may be helpful for comparison and management of the ecosystem in the future.