• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.4
• /
• pp.57-66
• /
• 2004

This paper proposes the design of a 2,048-bit RSA based on RNS(residue number systems) Montgomery modular multiplier As the systems that RNS processes a fast parallel modular multiplication for a large word partitioned into small words, we introduce Montgomery reduction method(MRM)［1］based on Wallace tree modular multiplier and 33 RNS bases with 64-bit size for RNS Montgomery modular multiplication in this paper. Also, for fast RNS modular multiplication, a modified method based on Chinese remainder theorem(CRT)［2］ is presented. We have verified 2,048-bit RSA based on RNS using Samsung 0.35${\mu}{\textrm}{m}$ technology and the 2,048-bit RSA is performed in 2.54㎳ at 100MHz.

• ETRI Journal
• /
• v.38 no.2
• /
• pp.326-336
• /
• 2016

We propose and describe new error control algorithms for redundant residue number systems (RRNSs) and residue number system product codes. These algorithms employ search techniques for obtaining error values from within a set of values (that contains all possible error values). For a given RRNS, the error control algorithms have a computational complexity of $t{\cdot}O(log_2\;n+log_2\;{\bar{m}})$ comparison operations, where t denotes the error correcting capability, n denotes the number of moduli, and ${\bar{m}}$ denotes the geometric average of moduli. These algorithms avoid most modular operations. We describe a refinement to the proposed algorithms that further avoids the modular operation required in their respective first steps, with an increase of ${\lceil}log_2\;n{\rceil}$ to their computational complexity. The new algorithms provide significant computational advantages over existing methods.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.9
• /
• pp.454-460
• /
• 2003

In this paper, we present a novel method of parallelization of the modular multiplication algorithm to improve time and space complexity on RNS (Residue Number System). The parallel algorithm executes modular reduction using new table lookup based reduction method. MRS (Mixed Radix number System) is used because algebraic comparison is difficult in RNS which has a non-weighted number representation. Conversion from residue number system to certain MRS is relatively fast in residue computer. Therefore magnitude comparison is easily Performed on MRS. By the analysis of the algorithm, it is known that it requires only 1/2 table size than previous approach. And it requires 0(ι) arithmetic operations using 2ㅣ processors.

• Journal for History of Mathematics
• /
• v.12 no.2
• /
• pp.47-54
• /
• 1999

We introduce some historical facts on number theory, especially prime numbers and modular arithmetic. And then, with the viewpoint of computer arithmetic, residue number systems are considered as an alternate to positional number systems so that high performance and high speed computation can be achieved in a specified domain such as cryptography and digital signal processing.

• Fisheries and Aquatic Sciences
• /
• v.22 no.12
• /
• pp.29.1-29.7
• /
• 2019

Veterinary drugs are widely used to protect production-related diseases and promote the growth of farmed fish. The use of large amounts of veterinary drugs may have potential risk and cause adverse effects on both humans and the environment. In this study, we developed risk-based ranking based on a scoring system to be applied in the national residue program. In this approach, the following three factors of veterinary drugs that may occur as residues in fishery products were considered: potency (acceptable daily intake), usage (number of dose and withdrawal period), and residue occurrence. The overall ranking score was calculated using the following equation: potency × usage (sum of the number of sales and withdrawal period) × residue occurrence. The veterinary drugs that were assigned high score by applying this approach were enrofloxacin, amoxicillin, oxolinic acid, erythromycin, and trimethoprim. The risk-based approach for monitoring veterinary drugs can provide a reliable inspection priority in fishery products. The developed ranking system can be applied in web-based systems and residuemonitoring programs and to ensure safe management of fishery products in Korea.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1185-1187
• /
• 1987

Digital systems are increasingly being used in the ranges of many control engineering. The residue number system offers the possibility of high speed operation and error correction. The compact self-checking pulse-train residue arithmetic circuit is proposed. A fault tolerant digital filter is practically implemented using these proposed circuits.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.3
• /
• pp.345-350
• /
• 1986

This paper deseribes the design of a vector-coordinate rotation processor and the apporoximate evaluations of sine and consine based upon the use of residue number systems. The proposed algorithm results in a considerable improvement of computational speed as compared to the CORDIC algorithm. According to the results of computer simulation, the mean error of sine and cosine is 0.0025, and the mean error of coorcinate rotation arithmatic is 0.65. The proposed processor has the efficiency for the design and fabrication of integrated circuits, because it consists of an array of identical lookup tables.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.2
• /
• pp.224-229
• /
• 2005

Generally, genetic algorithm (GA) has too much time and space complexity when it is running in the typical processor. Therefore, we are forced to use the high-performance and expensive processor by this reason. It also works as a barrier to implement real device, such a small mobile robot, which is required only simple rules. To solve this problem, this paper presents and proposes enhanced processor-architecture for the faster GA processing. A typical processor architecture can be enhanced and specialized by two approaches: one is a sorting network, the other is a residue number system (RNS). A sorting network can improve the time complexity of which needs to compare the populations' fitness. An RNS can reduce the magnitude of the largest bit that dictates the speed of arithmetic operation. Consequently, it can make the total logic size smaller and innovate arithmetic operation speed faster.

• ETRI Journal
• /
• v.32 no.1
• /
• pp.93-101
• /
• 2010

A true random number generator (TRNG) is widely used to generate secure random numbers for encryption, digital signatures, authentication, and so on in crypto-systems. Since TRNG is vulnerable to environmental changes, a deterministic function is normally used to reduce bias and improve the statistical properties of the TRNG output. In this paper, we propose a linear corrector for secure TRNG. The performance of a linear corrector is bounded by the minimum distance of the corresponding linear error correcting code. However, we show that it is possible to construct a linear corrector overcoming the minimum distance limitation. The proposed linear corrector shows better performance in terms of removing bias in that it can enlarge the acceptable bias range of the raw TRNG output. Moreover, it is possible to efficiently implement this linear corrector using only XOR gates, which must have a suitable hardware size for embedded security systems.

• Animal cells and systems
• /
• v.1 no.4
• /
• pp.647-651
• /
• 1997

We have used a transient expression assay employing Drosophila S2 cells to study the transcriptional repression activity of a 27 amino acid residue-long repression domain FS1 which was generated by a frame-shift in a pair-rule gene, even-skipped of Drosophila melanogaster. In an attempt to define a minimal requirement for the repression activity, we constructed a series of truncation mutant forms of the FS1, fused to a heterologous GAL4 DNA-binding domain, and measured their activities. All of the mutant forms, including the GAL4-FS1 (5-23) which retains the smallest number (19) of amino acid residues of FS1, were found to repress an initiator, a minimal TATA-lacking promoter, in a GAL4-binding-site-dependent manner. These findings suggest that a 19 amino acid residue-long region, rich in proline and leucine residues, is a transcriptional repression domain and may interact with the general transcription machinery.