Efficient Realization for A Class of Clock-Controlled Sequence Generators
|
|
- Rodney Lang
- 5 years ago
- Views:
Transcription
1 Efficient Realization for A lass of lock-ontrolled Sequence Generators Huapeng Wu and M. A. Hasan epartment of Electrical and omputer Engineering, University of Waterloo Waterloo, Ontario, anada Abstract In this article, hardware implementation of the - sequence generator is discussed. A novel architecture for the - generator using an extended linear feedback shift register (XLFSR) is presented. ompared to the conventional LFSR based schemes, the proposed scheme is advantageous in the sense that it yields generators of high and constant throughput. When this scheme is used to implement generators in VLSI technologies, low area and power consumption are also expected. Moreover, it has been shown that the proposed 1-2 generators are very suitable for building long Gollmann s cascaded generators. Key Words: Sequence generator, LFSR, -sequence, nonuniform decimation, Gollmann s cascaded generator.
2 I. Introduction The stream cipher [9] is used in many cryptographic applications because it can operate at a very high data rate. The key component in a stream cipher system is the pseudorandom sequence generator. How to easily generate sequences which are good in the sense of cryptography has long been an interesting research area [9]. Linear Feedback Shift Register (LFSR) based sequence generators are attractive because of their conceptual simplicity and low implementation complexity. This type of generators include clock-controlled generators of which stop-and-go generator [2] and 1-2 generator (or step-1/step-2 generator) [1] are most common. The stop-and-go generator uses two LFSR s where the output of the first one is used to control the clock of the second LFSR. Therefore, an output bit 1 of the a first LFSR causes the second one to shift its state, while implies that the state of the second LFSR remains unchanged. The output of this second LFSR is then the output of the stop-andgo generator. It has been shown that the repeated bits in the output sequence of a stop-and-go - generator can lead an attacker to have better chances to succeed [6]. The generator tries to solve this problem by shifting the second LFSR once when the output bit of the first LFSR is 0, and shifting twice when the output bit of the first LFSR is 1. For a 1-2 generator, suppose that the original sequence and the control sequence are and,,, respectively, then the generated sequence is! # $&% " '(*),+.- (0/ #32 $&% 1 '(*),+ (0/ where 6 is the decimation sequence [1]. If is an -sequence of period and has period: with;<>=@?6 $&% BA'),+ E, then the 1-2 generator yields the 1
3 sequence! of maximal period6 :. Moreover, if every prime factor of: divides6 then the linear complexity of! is no less than F: [1, 5]. Such generators can also be cascaded to obtain sequences with increasingly long period and high linear complexity [1]: The clock input of thegth register,gihj?egk9, is the sum (modulo 2) of the clock input of the th?eg.9 register and the output of the th register. Likewise the output of the cascaded generator is the sum of the clock input of the last register and the output of the last register. Assuming that there arel stages and the control sequence to the first stage is an -sequence of period6, then such a cascaded generator has a period of?m 8 9 ONQP % and linear complexity of R?M 8 9 onventional LFSR based implementations of 1-2 generators are to use an extra output buffer, or require two clocks or two LFSRs. As we shall show later, these schemes are not quite suitable for implementing long Gollmann s cascaded generators in applications where area is of prime concern. In this work, we propose a novel implementation of 1-2 generator. It has a low space complexity and a high and constant throughput. When it is implemented with VLSI technologies, it can potentially reduce the power consumption. It is also shown that the proposed scheme is especially suitable for building long Gollmann s cascaded generators. ON. The organization of this article is as follows. In Section II, a brief account of previous schemes for implementing 1-2 generators is given. Then we propose a new structure of the 1-2 generator in Section III. oncluding remarks are given in Section IV. II. onventional LFSR based Schemes From the definition of the 1-2 generator, if both the clock input and the control sequence have the same rate, the generator will have an irregular output bit rate which depends on the appearance of 1 s in the control sequence. That is, the generator outputs one bit per clock cycle when the control bit is 0 and one bit every two clock cycles when the control bit is 1. onsequently, it has two shortcomings: One is the irregularity of the output rate and the other is the reduced 2
4 throughput relative to the system clock input to the LFSR. To overcome these drawbacks, the following schemes can be used. A. Two clock scheme One method to overcome the problem of irregular throughput is to use two clocks where one clock has a rate half of the other s. When the control bit is 0 the slower clock is used as the input clock to the LFSR, and when the control bit is 1 the faster clock is used. A one-bit buffer is required for temporarily storing the output bit of the LFSR, and then the output of the generator can be clocked out from the buffer at the rate equal to the rate of the slower clock. Suppose that the slower clock signal is obtained from the system clock source using frequency-division method, the generator implemented in this way will suffer a low throughput which is only half of the system clock rate on the average. In this case, to match the generator throughput, the rate of the control sequence should also be sustained as half of the system clock rate. B. Output buffer scheme Another method to overcome the irregularity of the output rate and maintain a comparatively high throughput requires a multi-bit buffer at the output end of the LFSR. First the LFSR works with the controlled clock input to yield the required sequence which enters the buffer with an irregular rate. Then output bits of the generator are clocked out from the buffer at a slower rate after an initial delay. Here the output buffer functions as a filter for the output of the LFSR to yield the required sequence with a slower output rate. Obviously both the buffer size and generator throughput depend on the number of 1 s in one period of the control sequence, as well as the distribution and - length of 1-runs of the control sequence. If the generator is controlled by a periodic sequence with equal numbers of S s and s in one period, then it has an output rate which is of the system 3
5 clock rate. 1 In this case if the buffer s output clock rate is faster than S of the system clock rate, the buffer will eventually run out of the data; on the other hand, if the output clock is slower than this rate, the backlog in the buffer will be getting larger and larger and will eventually overflow. Our simulation results (see Figure 1) indicate that the buffer size increases rapidly when TH if the control sequence is an -sequence generated with an LFSR of the same length Figure 1: LFSR length vs the minimal buffer lengthu (output buffer scheme).. Two LFSR scheme - The generator implemented with the above two schemes yields a constant but lower throughput. One way to avoid this problem is to use two LFSRs [3]. We know that 2-decimation of an - sequence is still the same -sequence but with a different initial phase [10]. Then a 1-2 generator can be built with two identical LFSRs,V andw, both working at the input clock rate. LFSRW has a different initial state from LFSRV in that LFSRW yields the 2-decimation of the -sequence generated by LFSRV. The output sequence of the generator consists of the bits from both LFSRs. When the control bit is 0 the output bit of LFSRV is chosen as the output bit of the generator, otherwise the output bit of LFSRW is the output bit of the generator. Obviously, the generator has an output rate equal to the input clock rate. One disadvantage of this scheme is its relatively higher complexity which is more apparent when a cascaded generator is to be used. b -sequence is used as the control sequence, then the buffer must work at a clock rate preciously the input clock rate. arexzy\[^] andxzy@[]`_a 1 Note that there 1 s 0 s in one period of anb withcedfx>yg_ha -sequence XYkjlXZY@[]m_ia X Y. If such an of 4
6 P P % % P n p III. New 1-2 Generator Architecture A. XLFSR Given an LFSR with primitive characteristic polynomialno?0p initial state, the output is an -sequence and is given by [10] wheres is a root ofno?ep " Tr?rqs andq GF?M 8 From the above identity we have. 8 '),+ $&% n Tr?rqts $ 8 %u Tr?vqts 8 '),+ $&% P P n Tr?vqts $ 8 n 8 $&% Tr?vqts 2 8 ') $&% P % n $&% Tr?vqts $ 8 8 '),+xwn $&% } + 8 $&%yn 2? 9{z $&%Q~ Tr?rqs $ 8 Jp '),+ $&% n P P and its nonzero } (3.1) wherez ifg is the Kronecker function which is 1 and 0 otherwise. It is little tricky to see that if a device can be built using (3.1) to produce %, then it will in effect generate a sequence decimating -sequence by 2. Such a device can be realized by an LFSR- style structure which is shown in Figure 2. We combine this structure and the original LFSR together and it yields a new LFSR as shown in Figure 3. This extended LFSR which is referred to as XLFSR can achieve two operations: ( ) generation of an -sequence and (! ) decimation of the -sequence by 2, depending on the positions of switchesƒ. A little more complicated version of the XLFSR has been proposed in [7] for finite field exponentiation where the register can be shifted in both directions. When the switches are at upper positions (dotted lines), the upper portion of the circuit is disconnected and the circuit is just a conventional LFSR generating the output bit. When the 5
7 P n^% n n n 8 $&% n% n n n 8 $&% ^ Figure 2: An LFSR to generate 2-decimation of an -sequence. n^% n n n 8 $&% K K K K n^% n n n 8 $&% Output Figure 3: XLFSR: to generate both 1-decimation and 2-decimation of an -sequence. switchesƒ are at lower positions (solid lines), the circuits are configured to perform decimationby-2 operations and yield the current output. The switchesƒ are controlled by the current bit % bit whenh7 in the control sequence: They are at upper position, and at the lower position whenˆ. The switch control circuitry is very simple and omitted from the figure. Obviously, if we use the bits of the control sequence to control the switches, the XLFSR will work exactly in the same way as a - generator does. 6
8 P B. omplexities of XLFSR Let f?rn denote the Hamming weight of the characteristic polynomialno?0p. Then the size complexity of the conventional LFSR with characteristic polynomialno?0p is f?mn 9Š XOR gates and -bit registers, while the corresponding XLFSR can be built with w f?mn 9 ~ XOR gates and 1-bit registers. The switches are very simple (three-state drivers) and we do not take them f?rn into consideration. Obviously, when is not very large the XLFSR does not significantly whennœ?ep increase complexity compared to the conventional LFSR. For instance, is a primitive pentanomial, the construction of the corresponding XLFSR requiress more XOR gates compared to that of the conventional LFSR. is w f?mn When the switches?vƒ are at the upper positions (dash lines), the time delay for generating 9 ~Ž: 2 :, where:m is the time delay of one XOR gate and:` denotes the time delay ( of a 1-bit register flip-flop). When the switches are at the lower positions (solid lines), the upper XOR gate network is connected and the total time delay for generating % is w {?Mn 9 ~*: 2 :. 3 only : 2 : ifno?0p Ifno?0p learly, the time complexity is is a primitive trinomial. is not a or f?rn trinomial, both the upper and lower XOR gate feedback networks can be implemented in full parallel form and the total time complexity becomes? 0š} ;?r f?rn the size complexity remains the same. 9œ O 2ž : 2 : while. High speed XLFSR For each Fibonacci type LFSR, there is a corresponding high speed Galois type LFSR that can produce the same output sequence [8]. A Galois type XLFSR can be derived from a Galois type LFSR in a similar way the XLFSR has been derived from the Fibonacci type LFSR. This Galois type XLFSR is shown in Figure 4. When used as a sequence generator, it can produce the same output sequence as a (Fibonacci type) XLFSR does. 7
9 n^% n n 8 $&% K K K K n^% n n 8 $&% Output Figure 4: High speed XLFSR. S Two clock Output buffer Two LFSR Proposed scheme scheme scheme scheme # of LFSRs a (XLFSR) Throughput rate 1 1 Extra buffer bit yes none none # clock sources omplexity of overall control small moderate small very small Initial delay very small yes none none Precomputation none yes small none a The LFSR generating the control sequence is not included here. Table 1: omparisons of the new scheme to three other schemes. An advantage of the Galois type XLFSR over Fibonacci type XLFSR is that the former does not cascade the XOR gates yielding a higher speed of operation, especially when no?ep is not a trinomial. The size complexity of the Galois type XLFSR is the same as the Fibonacci type XLFSR for anyno?ep.. omparisons omparisons between the proposed scheme and those discussed in Section II are shown in Table 1. In the table, the throughput is denoted by the average number of output bits per input clock cycle. 8
10 For example, means the throughput is 1 bit every two input clock cycles. In the two-clock scheme, one clock can be simply derived from the other by halving the frequency of the latter. While in the output-buffer scheme, the generation of the slower clock can be a little more complex. The precomputation required in the output buffer scheme includes the effort to decide the buffer size and the initial delay. Also note that the LFSR used in the proposed scheme is actually XLFSR which is a little more complex than the conventional LFSR. From Table 1 it is clear that the new scheme has advantages over the others in terms of space complexity, throughput, and simplicity of the overall control. E. ascaded XLFSR s The use of XLFSR to build Gollmann s cascaded generator is straightforward. OnlyL 2Ÿ XLFSR s are needed for anl -stage cascaded generator and the overall control is very simple. The system is clocked by a single clock source and the throughput of the generator is equal to the clock rate. A cascaded generator of two stages implemented using three XLFSRs is shown in Fig 5. The first XLFSR (far left) is used as an -sequence generator producing the control sequence for the first stage of the cascade. A delay block is used at each stage for aligning the input to the XLFSR of this stage with its immediate output and then both the input and output bits are added (mod 2) together to give the final output bit for this stage [1]. In this way we can build a cascade ofl stages where the binary input to theg th stage is used to control the XLFSR of this stage and is also added to the immediate output of the XLFSR to give the final output from this stage to be passed on as the NQP the?vg 2 N input to th stage. The period and linear complexity ofl -stage cascaded generators are?m 8{9 % and R?r 8{9, respectively [1]. A simple comparison ofl -stage cascaded generators built with different schemes is shown in Table 2. Note that in both two-clock and output-buffer schemes extra buffer is required between any two stages of LFSR and consequently extra delay occurs at every stage. 9
11 XLFSR XLFSR XLFSR Figure 5: Gollmann s cascaded generator built with XLFSR. Two clock Output buffer Two LFSR Proposed scheme scheme L 2ž scheme L 2ž scheme L 21 L 21 # of LFSRs a (XLFSR) S Throughput rate L 1 1 Extra buffer bits yes none none # clock sources L Initial delay clock cycles yes none none Precomputation none yes small none a The LFSR generating the control sequence is included. Table 2: omparisons of schemes to build anl -stage cascaded generator. IV. oncluding Remarks - In this article, we have presented a novel LFSR style structure for the generator. ompared to other conventional LFSR based schemes, the proposed scheme has the merits of high and constant throughput, no initial delay, no precomputation and simple overall control. It has been shown that the proposed scheme is very suitable for building long Gollmann s cascaded generators. The idea of XLFSR can be easily generalized to a class of LFSR style structures that can achieve both step- and step- - forward decimation. Practical implementation of such generator using this idea, however, may require complicated circuitry when S. Another direction of generalization of XLFSR is to construct a - % - Q generator where two control bits are required for generating the output bit. 10
12 Acknowledgments This work was supported in parts by ITR, NSER, and Micronet. References [1]. Gollmann and W. G. hambers, lock-controlled shift registers: a review, IEEE J. SA., vol. 7, no. 4, pp , May [2] T. Beth and F. Piper, The stop-and-go generator, in Eurocrypt 84, (LNS 209), Berlin: Springer-Verlag, 1985, pp [3]. G. Günther, Alternating step generators controlled by de Bruijn sequences, in EURO- RYPT 87, (LNS 304), Berlin: Springer-Verlag, 1988, pp [4]. oppersmith, H. Krawczyk, and Y.Mansour, The shrinking generator, in RYPTO 93, (LNS 773), Berlin: Springer-Verlag, 1994, pp [5] J. J. Golić and M. V. Zivković, On the linear complexity of nonuniformly decimated PNsequences, IEEE Trans IT, vol. 34, no. 5, pp , Sept [6] J. J. Golić, Linear cryptanalysis of stream ciphers, in Proc. 2 - Int. Workshop on Fast Software Encryption, pp , Leuven, Belgium, ec GF?M 8 [7] H. Wu and M. A. Hasan, Efficient exponentiation in using dual basis, in Proc of th Biennial anadian ommunication Symposium, Kingston, anada, 1996, pp [8] R. E. Ziemer and R. L. Peterson, igital ommunications and Spread Spectrum Systems, MacMillan Publishing company, New York, [9] R. A. Rueppel, Stream iphers, Springer-Verlag, Berlin,
13 [10] R. J. McEliece, Finite Fields for omputer Scientists and Engineers, Kluwer Academic Publishers,
LFSR Counter Implementation in CMOS VLSI
LFSR Counter Implementation in CMOS VLSI Doshi N. A., Dhobale S. B., and Kakade S. R. Abstract As chip manufacturing technology is suddenly on the threshold of major evaluation, which shrinks chip in size
More informationDESIGN and IMPLETATION of KEYSTREAM GENERATOR with IMPROVED SECURITY
DESIGN and IMPLETATION of KEYSTREAM GENERATOR with IMPROVED SECURITY Vijay Shankar Pendluri, Pankaj Gupta Wipro Technologies India vijay_shankarece@yahoo.com, pankaj_gupta96@yahoo.com Abstract - This paper
More informationAn Improved Hardware Implementation of the Grain-128a Stream Cipher
An Improved Hardware Implementation of the Grain-128a Stream Cipher Shohreh Sharif Mansouri and Elena Dubrova Department of Electronic Systems Royal Institute of Technology (KTH), Stockholm Email:{shsm,dubrova}@kth.se
More informationUnderstanding Cryptography A Textbook for Students and Practitioners by Christof Paar and Jan Pelzl. Chapter 2 Stream Ciphers ver.
Understanding Cryptography A Textbook for Students and Practitioners by Christof Paar and Jan Pelzl www.crypto-textbook.com Chapter 2 Stream Ciphers ver. October 29, 2009 These slides were prepared by
More informationUnderstanding Cryptography A Textbook for Students and Practitioners by Christof Paar and Jan Pelzl. Chapter 2 Stream Ciphers ver.
Understanding Cryptography A Textbook for Students and Practitioners by Christof Paar and Jan Pelzl www.crypto-textbook.com Chapter 2 Stream Ciphers ver. October 29, 2009 These slides were prepared by
More informationIN DIGITAL transmission systems, there are always scramblers
558 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 53, NO. 7, JULY 2006 Parallel Scrambler for High-Speed Applications Chih-Hsien Lin, Chih-Ning Chen, You-Jiun Wang, Ju-Yuan Hsiao,
More informationA Pseudorandom Binary Generator Based on Chaotic Linear Feedback Shift Register
A Pseudorandom Binary Generator Based on Chaotic Linear Feedback Shift Register Saad Muhi Falih Department of Computer Technical Engineering Islamic University College Al Najaf al Ashraf, Iraq saadmuheyfalh@gmail.com
More informationDesign of Fault Coverage Test Pattern Generator Using LFSR
Design of Fault Coverage Test Pattern Generator Using LFSR B.Saritha M.Tech Student, Department of ECE, Dhruva Institue of Engineering & Technology. Abstract: A new fault coverage test pattern generator
More informationPseudorandom bit Generators for Secure Broadcasting Systems
+00? IE.Nfejb~lV 4 Pseudorandom bit Generators for Secure Broadcasting Systems Chung-Huang Yang m Computer & Communication Research Laboratories Industrial Technology Research Institute Chutung, Hsinchu
More informationChapter 4. Logic Design
Chapter 4 Logic Design 4.1 Introduction. In previous Chapter we studied gates and combinational circuits, which made by gates (AND, OR, NOT etc.). That can be represented by circuit diagram, truth table
More informationHow to Predict the Output of a Hardware Random Number Generator
How to Predict the Output of a Hardware Random Number Generator Markus Dichtl Siemens AG, Corporate Technology Markus.Dichtl@siemens.com Abstract. A hardware random number generator was described at CHES
More informationPerformance Evaluation of Stream Ciphers on Large Databases
IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.9, September 28 285 Performance Evaluation of Stream Ciphers on Large Databases Dr.M.Sikandar Hayat Khiyal Aihab Khan Saria
More informationDecim v2. To cite this version: HAL Id: hal
Decim v2 Come Berbain, Olivier Billet, Anne Canteaut, Nicolas Courtois, Blandine Debraize, Henri Gilbert, Louis Goubin, Aline Gouget, Louis Granboulan, Cédric Lauradoux, et al. To cite this version: Come
More informationAN EFFICIENT LOW POWER DESIGN FOR ASYNCHRONOUS DATA SAMPLING IN DOUBLE EDGE TRIGGERED FLIP-FLOPS
AN EFFICIENT LOW POWER DESIGN FOR ASYNCHRONOUS DATA SAMPLING IN DOUBLE EDGE TRIGGERED FLIP-FLOPS NINU ABRAHAM 1, VINOJ P.G 2 1 P.G Student [VLSI & ES], SCMS School of Engineering & Technology, Cochin,
More informationTrue Random Number Generation with Logic Gates Only
True Random Number Generation with Logic Gates Only Jovan Golić Security Innovation, Telecom Italia Winter School on Information Security, Finse 2008, Norway Jovan Golic, Copyright 2008 1 Digital Random
More informationRandomness analysis of A5/1 Stream Cipher for secure mobile communication
Randomness analysis of A5/1 Stream Cipher for secure mobile communication Prof. Darshana Upadhyay 1, Dr. Priyanka Sharma 2, Prof.Sharada Valiveti 3 Department of Computer Science and Engineering Institute
More informationGuidance For Scrambling Data Signals For EMC Compliance
Guidance For Scrambling Data Signals For EMC Compliance David Norte, PhD. Abstract s can be used to help mitigate the radiated emissions from inherently periodic data signals. A previous paper [1] described
More informationINTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY
Tarannum Pathan,, 2013; Volume 1(8):655-662 INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY A PATH FOR HORIZING YOUR INNOVATIVE WORK VLSI IMPLEMENTATION OF 8, 16 AND 32
More informationTesting Digital Systems II
Testing Digital Systems II Lecture 5: Built-in Self Test (I) Instructor: M. Tahoori Copyright 2010, M. Tahoori TDS II: Lecture 5 1 Outline Introduction (Lecture 5) Test Pattern Generation (Lecture 5) Pseudo-Random
More informationSequential Logic Notes
Sequential Logic Notes Andrew H. Fagg igital logic circuits composed of components such as AN, OR and NOT gates and that do not contain loops are what we refer to as stateless. In other words, the output
More informationPower Reduction Techniques for a Spread Spectrum Based Correlator
Power Reduction Techniques for a Spread Spectrum Based Correlator David Garrett (garrett@virginia.edu) and Mircea Stan (mircea@virginia.edu) Center for Semicustom Integrated Systems University of Virginia
More informationLFSRs as Functional Blocks in Wireless Applications Author: Stephen Lim and Andy Miller
XAPP22 (v.) January, 2 R Application Note: Virtex Series, Virtex-II Series and Spartan-II family LFSRs as Functional Blocks in Wireless Applications Author: Stephen Lim and Andy Miller Summary Linear Feedback
More informationdata and is used in digital networks and storage devices. CRC s are easy to implement in binary
Introduction Cyclic redundancy check (CRC) is an error detecting code designed to detect changes in transmitted data and is used in digital networks and storage devices. CRC s are easy to implement in
More informationSRAM Based Random Number Generator For Non-Repeating Pattern Generation
Applied Mechanics and Materials Online: 2014-06-18 ISSN: 1662-7482, Vol. 573, pp 181-186 doi:10.4028/www.scientific.net/amm.573.181 2014 Trans Tech Publications, Switzerland SRAM Based Random Number Generator
More informationY. Tsiatouhas. VLSI Systems and Computer Architecture Lab. Built-In Self Test 2
CMOS INTEGRATE CIRCUIT ESIGN TECHNIUES University of Ioannina Built In Self Test (BIST) ept. of Computer Science and Engineering Y. Tsiatouhas CMOS Integrated Circuit esign Techniques VLSI Systems and
More informationBit Swapping LFSR and its Application to Fault Detection and Diagnosis Using FPGA
Bit Swapping LFSR and its Application to Fault Detection and Diagnosis Using FPGA M.V.M.Lahari 1, M.Mani Kumari 2 1,2 Department of ECE, GVPCEOW,Visakhapatnam. Abstract The increasing growth of sub-micron
More informationEFFICIENT IMPLEMENTATION OF RECENT STREAM CIPHERS ON RECONFIGURABLE HARDWARE DEVICES
EFFICIENT IMPLEMENTATION OF RECENT STREAM CIPHERS ON RECONFIGURABLE HARDWARE DEVICES Philippe Léglise, François-Xavier Standaert, Gaël Rouvroy, Jean-Jacques Quisquater UCL Crypto Group, Microelectronics
More informationA Low Power Delay Buffer Using Gated Driver Tree
IOSR Journal of VLSI and Signal Processing (IOSR-JVSP) ISSN: 2319 4200, ISBN No. : 2319 4197 Volume 1, Issue 4 (Nov. - Dec. 2012), PP 26-30 A Low Power Delay Buffer Using Gated Driver Tree Kokkilagadda
More informationChapter Contents. Appendix A: Digital Logic. Some Definitions
A- Appendix A - Digital Logic A-2 Appendix A - Digital Logic Chapter Contents Principles of Computer Architecture Miles Murdocca and Vincent Heuring Appendix A: Digital Logic A. Introduction A.2 Combinational
More informationModified Alternating Step Generators with Non-Linear Scrambler
Modified Alternating Step Generators with Non-Linear Scrambler Robert Wicik, Tomasz Rachwalik, Rafał Gliwa Military Communication Institute, Cryptology Department, Zegrze, Poland {r.wicik, t.rachwalik,
More informationDESIGN OF LOW POWER TEST PATTERN GENERATOR
International Journal of Electronics, Communication & Instrumentation Engineering Research and Development (IJECIERD) ISSN(P): 2249-684X; ISSN(E): 2249-7951 Vol. 4, Issue 1, Feb 2014, 59-66 TJPRC Pvt.
More informationSegmented Leap-Ahead LFSR Architecture for Uniform Random Number Generator
, pp.233-242 http://dx.doi.org/10.14257/ijseia.2013.7.5.21 Segmented Leap-Ahead LFSR Architecture for Uniform Random Number Generator Je-Hoon Lee 1 and Seong Kun Kim 2 1 Div. of Electronics, Information
More informationPrinciples of Computer Architecture. Appendix A: Digital Logic
A-1 Appendix A - Digital Logic Principles of Computer Architecture Miles Murdocca and Vincent Heuring Appendix A: Digital Logic A-2 Appendix A - Digital Logic Chapter Contents A.1 Introduction A.2 Combinational
More informationEfficient Architecture for Flexible Prescaler Using Multimodulo Prescaler
Efficient Architecture for Flexible Using Multimodulo G SWETHA, S YUVARAJ Abstract This paper, An Efficient Architecture for Flexible Using Multimodulo is an architecture which is designed from the proposed
More informationTHE USE OF forward error correction (FEC) in optical networks
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 52, NO. 8, AUGUST 2005 461 A High-Speed Low-Complexity Reed Solomon Decoder for Optical Communications Hanho Lee, Member, IEEE Abstract
More informationSynthesis Techniques for Pseudo-Random Built-In Self-Test Based on the LFSR
Volume 01, No. 01 www.semargroups.org Jul-Dec 2012, P.P. 67-74 Synthesis Techniques for Pseudo-Random Built-In Self-Test Based on the LFSR S.SRAVANTHI 1, C. HEMASUNDARA RAO 2 1 M.Tech Student of CMRIT,
More informationDesign of Test Circuits for Maximum Fault Coverage by Using Different Techniques
Design of Test Circuits for Maximum Fault Coverage by Using Different Techniques Akkala Suvarna Ratna M.Tech (VLSI & ES), Department of ECE, Sri Vani School of Engineering, Vijayawada. Abstract: A new
More informationDynamic Power Reduction in Sequential Circuits Using Look Ahead Clock Gating Technique R. Manjith, C. Muthukumari
Dynamic Power Reduction in Sequential Circuits Using Look Ahead Clock Gating Technique R. Manjith, C. Muthukumari Abstract In this paper, a novel Linear Feedback Shift Register (LFSR) with Look Ahead Clock
More informationArea Efficient Pulsed Clock Generator Using Pulsed Latch Shift Register
International Journal for Modern Trends in Science and Technology Volume: 02, Issue No: 10, October 2016 http://www.ijmtst.com ISSN: 2455-3778 Area Efficient Pulsed Clock Generator Using Pulsed Latch Shift
More informationFinal Exam CPSC/ECEN 680 May 2, Name: UIN:
Final Exam CPSC/ECEN 680 May 2, 2008 Name: UIN: Instructions This exam is closed book. Provide brief but complete answers to the following questions in the space provided, using figures as necessary. Show
More informationLFSR stream cipher RC4. Stream cipher. Stream Cipher
Lecturers: Mark D. Ryan and David Galindo. Cryptography 2016. Slide: 89 Stream Cipher Suppose you want to encrypt a stream of data, such as: the data from a keyboard the data from a sensor Block ciphers
More informationAvailable online at ScienceDirect. Procedia Computer Science 46 (2015 ) Aida S Tharakan a *, Binu K Mathew b
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 46 (2015 ) 1409 1416 International Conference on Information and Communication Technologies (ICICT 2014) Design and Implementation
More informationISSN:
191 Low Power Test Pattern Generator Using LFSR and Single Input Changing Generator (SICG) for BIST Applications A K MOHANTY 1, B P SAHU 2, S S MAHATO 3 Department of Electronics and Communication Engineering,
More informationDesign and Implementation of Data Scrambler & Descrambler System Using VHDL
Design and Implementation of Data Scrambler & Descrambler System Using VHDL Naina K.Randive Dept.of Electronics and Telecommunications Dept. of Electronics and Telecommunications P.R. Pote (Patil) college
More informationMATHEMATICAL APPROACH FOR RECOVERING ENCRYPTION KEY OF STREAM CIPHER SYSTEM
MATHEMATICAL APPROACH FOR RECOVERING ENCRYPTION KEY OF STREAM CIPHER SYSTEM Abdul Kareem Murhij Radhi College of Information Engineering, University of Nahrian,Baghdad- Iraq. Abstract Stream cipher system
More informationComputer Architecture and Organization
A-1 Appendix A - Digital Logic Computer Architecture and Organization Miles Murdocca and Vincent Heuring Appendix A Digital Logic A-2 Appendix A - Digital Logic Chapter Contents A.1 Introduction A.2 Combinational
More informationDesign of Shift Register Using Pulse Triggered Flip Flop
Design of Shift Register Using Pulse Triggered Flip Flop Kuchanpally Mounika M.Tech [VLSI], CMR Institute of Technology, Kandlakoya, Medchal, Hyderabad, India. G.Archana Devi Assistant Professor, CMR Institute
More informationComparative Analysis of Stein s. and Euclid s Algorithm with BIST for GCD Computations. 1. Introduction
IJCSN International Journal of Computer Science and Network, Vol 2, Issue 1, 2013 97 Comparative Analysis of Stein s and Euclid s Algorithm with BIST for GCD Computations 1 Sachin D.Kohale, 2 Ratnaprabha
More informationSIC Vector Generation Using Test per Clock and Test per Scan
International Journal of Emerging Engineering Research and Technology Volume 2, Issue 8, November 2014, PP 84-89 ISSN 2349-4395 (Print) & ISSN 2349-4409 (Online) SIC Vector Generation Using Test per Clock
More informationCS150 Fall 2012 Solutions to Homework 4
CS150 Fall 2012 Solutions to Homework 4 September 23, 2012 Problem 1 43 CLBs are needed. For one bit, the overall requirement is to simulate an 11-LUT with its output connected to a flipflop for the state
More informationOptimization of Multi-Channel BCH Error Decoding for Common Cases. Russell Dill Master's Thesis Defense April 20, 2015
Optimization of Multi-Channel BCH Error Decoding for Common Cases Russell Dill Master's Thesis Defense April 20, 2015 Bose-Chaudhuri-Hocquenghem (BCH) BCH is an Error Correcting Code (ECC) and is used
More informationDesign And Implimentation Of Modified Sqrt Carry Select Adder On FPGA
Design And Implimentation Of Modified Sqrt Carry Select Adder On FPGA Ch. Pavan kumar #1, V.Narayana Reddy, *2, R.Sravanthi *3 #Dept. of ECE, PBR VIT, Kavali, A.P, India #2 Associate.Proffesor, Department
More informationVLSI Test Technology and Reliability (ET4076)
VLSI Test Technology and Reliability (ET476) Lecture 9 (2) Built-In-Self Test (Chapter 5) Said Hamdioui Computer Engineering Lab Delft University of Technology 29-2 Learning aims Describe the concept and
More informationChapter 5 Sequential Systems. Introduction
hapter 5 Seuential Systems Latches and Flip-flops Synchronous ounter synchronous ounter 7822 igital Logic esign @epartment of omputer Engineering U. Introduction Up to now everything has been combinational
More informationRandom Access Scan. Veeraraghavan Ramamurthy Dept. of Electrical and Computer Engineering Auburn University, Auburn, AL
Random Access Scan Veeraraghavan Ramamurthy Dept. of Electrical and Computer Engineering Auburn University, Auburn, AL ramamve@auburn.edu Term Paper for ELEC 7250 (Spring 2005) Abstract: Random Access
More informationDesign for Test. Design for test (DFT) refers to those design techniques that make test generation and test application cost-effective.
Design for Test Definition: Design for test (DFT) refers to those design techniques that make test generation and test application cost-effective. Types: Design for Testability Enhanced access Built-In
More information1. a) For the circuit shown in figure 1.1, draw a truth table showing the output Q for all combinations of inputs A, B and C. [4] Figure 1.
[Question 1 is compulsory] 1. a) For the circuit shown in figure 1.1, draw a truth table showing the output Q for all combinations of inputs A, B and C. Figure 1.1 b) Minimize the following Boolean functions:
More informationImplementation of BIST Test Generation Scheme based on Single and Programmable Twisted Ring Counters
IOSR Journal of Mechanical and Civil Engineering (IOSR-JMCE) e-issn: 2278-1684, p-issn: 2320-334X Implementation of BIST Test Generation Scheme based on Single and Programmable Twisted Ring Counters N.Dilip
More informationImplementation of Memory Based Multiplication Using Micro wind Software
Implementation of Memory Based Multiplication Using Micro wind Software U.Palani 1, M.Sujith 2,P.Pugazhendiran 3 1 IFET College of Engineering, Department of Information Technology, Villupuram 2,3 IFET
More informationVLSI System Testing. BIST Motivation
ECE 538 VLSI System Testing Krish Chakrabarty Built-In Self-Test (BIST): ECE 538 Krish Chakrabarty BIST Motivation Useful for field test and diagnosis (less expensive than a local automatic test equipment)
More informationVLSI Technology used in Auto-Scan Delay Testing Design For Bench Mark Circuits
VLSI Technology used in Auto-Scan Delay Testing Design For Bench Mark Circuits N.Brindha, A.Kaleel Rahuman ABSTRACT: Auto scan, a design for testability (DFT) technique for synchronous sequential circuits.
More informationAsynchronous (Ripple) Counters
Circuits for counting events are frequently used in computers and other digital systems. Since a counter circuit must remember its past states, it has to possess memory. The chapter about flip-flops introduced
More informationCSE 352 Laboratory Assignment 3
CSE 352 Laboratory Assignment 3 Introduction to Registers The objective of this lab is to introduce you to edge-trigged D-type flip-flops as well as linear feedback shift registers. Chapter 3 of the Harris&Harris
More informationStream Cipher. Block cipher as stream cipher LFSR stream cipher RC4 General remarks. Stream cipher
Lecturers: Mark D. Ryan and David Galindo. Cryptography 2015. Slide: 90 Stream Cipher Suppose you want to encrypt a stream of data, such as: the data from a keyboard the data from a sensor Block ciphers
More informationLong and Fast Up/Down Counters Pushpinder Kaur CHOUHAN 6 th Jan, 2003
1 Introduction Long and Fast Up/Down Counters Pushpinder Kaur CHOUHAN 6 th Jan, 2003 Circuits for counting both forward and backward events are frequently used in computers and other digital systems. Digital
More informationA clock is a free-running signal with a cycle time. A clock may be either high or low, and alternates between the two states.
Clocks A clock is a free-running signal with a cycle time. A clock may be either high or low, and alternates between the two states. 1 The length of time the clock is high before changing states is its
More informationHigh Performance Carry Chains for FPGAs
High Performance Carry Chains for FPGAs Matthew M. Hosler Department of Electrical and Computer Engineering Northwestern University Abstract Carry chains are an important consideration for most computations,
More informationVHDL Implementation of Logic BIST (Built In Self Test) Architecture for Multiplier Circuit for High Test Coverage in VLSI Chips
VHDL Implementation of Logic BIST (Built In Self Test) Architecture for Multiplier Circuit for High Test Coverage in VLSI Chips Pushpraj Singh Tanwar, Priyanka Shrivastava Assistant professor, Dept. of
More informationCryptanalysis of LILI-128
Cryptanalysis of LILI-128 Steve Babbage Vodafone Ltd, Newbury, UK 22 nd January 2001 Abstract: LILI-128 is a stream cipher that was submitted to NESSIE. Strangely, the designers do not really seem to have
More informationDesign of BIST with Low Power Test Pattern Generator
IOSR Journal of VLSI and Signal Processing (IOSR-JVSP) Volume 4, Issue 5, Ver. II (Sep-Oct. 2014), PP 30-39 e-issn: 2319 4200, p-issn No. : 2319 4197 Design of BIST with Low Power Test Pattern Generator
More informationImplementation of High Speed Adder using DLATCH
International Journal of Emerging Engineering Research and Technology Volume 3, Issue 12, December 2015, PP 162-172 ISSN 2349-4395 (Print) & ISSN 2349-4409 (Online) Implementation of High Speed Adder using
More informationBLOCK CIPHER AND NON-LINEAR SHIFT REGISTER BASED RANDOM NUMBER GENERATOR QUALITY ANALYSIS
Vilnius University INSTITUTE OF MATHEMATICS AND INFORMATICS INFORMATICS ENGINEERING (07 T) BLOCK CIPHER AND NON-LINEAR SHIFT REGISTER BASED RANDOM NUMBER GENERATOR QUALITY ANALYSIS Robertas Smaliukas October
More information(12) Patent Application Publication (10) Pub. No.: US 2003/ A1
(19) United States US 2003O152221A1 (12) Patent Application Publication (10) Pub. No.: US 2003/0152221A1 Cheng et al. (43) Pub. Date: Aug. 14, 2003 (54) SEQUENCE GENERATOR AND METHOD OF (52) U.S. C.. 380/46;
More informationNH 67, Karur Trichy Highways, Puliyur C.F, Karur District UNIT-III SEQUENTIAL CIRCUITS
NH 67, Karur Trichy Highways, Puliyur C.F, 639 114 Karur District DEPARTMENT OF ELETRONICS AND COMMUNICATION ENGINEERING COURSE NOTES SUBJECT: DIGITAL ELECTRONICS CLASS: II YEAR ECE SUBJECT CODE: EC2203
More informationNew Address Shift Linear Feedback Shift Register Generator
New Address Shift Linear Feedback Shift Register Generator Kholood J. Moulood Department of Mathematical, Tikrit University, College of Education for Women, Salahdin. E-mail: khmsc2006@yahoo.com. Abstract
More informationPower Problems in VLSI Circuit Testing
Power Problems in VLSI Circuit Testing Farhana Rashid and Vishwani D. Agrawal Auburn University Department of Electrical and Computer Engineering 200 Broun Hall, Auburn, AL 36849 USA fzr0001@tigermail.auburn.edu,
More informationISSN:
427 AN EFFICIENT 64-BIT CARRY SELECT ADDER WITH REDUCED AREA APPLICATION CH PALLAVI 1, VSWATHI 2 1 II MTech, Chadalawada Ramanamma Engg College, Tirupati 2 Assistant Professor, DeptofECE, CREC, Tirupati
More informationReconfigurable FPGA Implementation of FIR Filter using Modified DA Method
Reconfigurable FPGA Implementation of FIR Filter using Modified DA Method M. Backia Lakshmi 1, D. Sellathambi 2 1 PG Student, Department of Electronics and Communication Engineering, Parisutham Institute
More informationA High- Speed LFSR Design by the Application of Sample Period Reduction Technique for BCH Encoder
IOSR Journal of VLSI and Signal Processing (IOSR-JVSP) ISSN: 239 42, ISBN No. : 239 497 Volume, Issue 5 (Jan. - Feb 23), PP 7-24 A High- Speed LFSR Design by the Application of Sample Period Reduction
More information128 BIT CARRY SELECT ADDER USING BINARY TO EXCESS-ONE CONVERTER FOR DELAY REDUCTION AND AREA EFFICIENCY
128 BIT CARRY SELECT ADDER USING BINARY TO EXCESS-ONE CONVERTER FOR DELAY REDUCTION AND AREA EFFICIENCY 1 Mrs.K.K. Varalaxmi, M.Tech, Assoc. Professor, ECE Department, 1varuhello@Gmail.Com 2 Shaik Shamshad
More informationAbstract 1. INTRODUCTION. Cheekati Sirisha, IJECS Volume 05 Issue 10 Oct., 2016 Page No Page 18532
www.ijecs.in International Journal Of Engineering And Computer Science ISSN: 2319-7242 Volume 5 Issue 10 Oct. 2016, Page No. 18532-18540 Pulsed Latches Methodology to Attain Reduced Power and Area Based
More informationTesting of Cryptographic Hardware
Testing of Cryptographic Hardware Presented by: Debdeep Mukhopadhyay Dept of Computer Science and Engineering, Indian Institute of Technology Madras Motivation Behind the Work VLSI of Cryptosystems have
More informationECE 172 Digital Systems. Chapter 2.2 Review: Ring Counter, Johnson Counter. Herbert G. Mayer, PSU Status 7/14/2018
ECE 172 Digital Systems Chapter 2.2 Review: Ring Counter, Johnson Counter Herbert G. Mayer, PSU Status 7/14/2018 1 Syllabus l Ring Counter l Parallel Output Ring Counter l Ring Counter via D Flip-Flops
More informationWG Stream Cipher based Encryption Algorithm
International Journal of Emerging Engineering Research and Technology Volume 3, Issue 11, November 2015, PP 63-70 ISSN 2349-4395 (Print) & ISSN 2349-4409 (Online) WG Stream Cipher based Encryption Algorithm
More informationOverview: Logic BIST
VLSI Design Verification and Testing Built-In Self-Test (BIST) - 2 Mohammad Tehranipoor Electrical and Computer Engineering University of Connecticut 23 April 2007 1 Overview: Logic BIST Motivation Built-in
More informationA low jitter clock and data recovery with a single edge sensing Bang-Bang PD
LETTER IEICE Electronics Express, Vol.11, No.7, 1 6 A low jitter clock and data recovery with a single edge sensing Bang-Bang PD Taek-Joon Ahn, Sang-Soon Im, Yong-Sung Ahn, and Jin-Ku Kang a) Department
More informationDesign and Implementation of High Speed 256-Bit Modified Square Root Carry Select Adder
Design and Implementation of High Speed 256-Bit Modified Square Root Carry Select Adder Muralidharan.R [1], Jodhi Mohana Monica [2], Meenakshi.R [3], Lokeshwaran.R [4] B.Tech Student, Department of Electronics
More informationSYNCHRONOUS DERIVED CLOCK AND SYNTHESIS OF LOW POWER SEQUENTIAL CIRCUITS *
SYNCHRONOUS DERIVED CLOCK AND SYNTHESIS OF LOW POWER SEUENTIAL CIRCUITS * Wu Xunwei (Department of Electronic Engineering Hangzhou University Hangzhou 328) ing Wu Massoud Pedram (Department of Electrical
More informationOptimization of FPGA Architecture for Uniform Random Number Generator Using LUT-SR Family
Optimization of FPGA Architecture for Uniform Random Number Generator Using LUT-SR Family Rita Rawate 1, M. V. Vyawahare 2 1 Nagpur University, Priyadarshini College of Engineering, Nagpur 2 Professor,
More informationFault Detection And Correction Using MLD For Memory Applications
Fault Detection And Correction Using MLD For Memory Applications Jayasanthi Sambbandam & G. Jose ECE Dept. Easwari Engineering College, Ramapuram E-mail : shanthisindia@yahoo.com & josejeyamani@gmail.com
More informationNotes on Digital Circuits
PHYS 331: Junior Physics Laboratory I Notes on Digital Circuits Digital circuits are collections of devices that perform logical operations on two logical states, represented by voltage levels. Standard
More informationAn FPGA Implementation of Shift Register Using Pulsed Latches
An FPGA Implementation of Shift Register Using Pulsed Latches Shiny Panimalar.S, T.Nisha Priscilla, Associate Professor, Department of ECE, MAMCET, Tiruchirappalli, India PG Scholar, Department of ECE,
More informationDigital Phase Adjustment Scheme 0 6/3/98, Chaney. A Digital Phase Adjustment Circuit for ATM and ATM- like Data Formats. by Thomas J.
igital Phase Adjustment Scheme 6/3/98, haney A igital Phase Adjustment ircuit for ATM and ATM- like ata Formats by Thomas J. haney epartment of omputer Science University St. Louis, Missouri 633 tom@arl.wustl.edu
More informationAn MFA Binary Counter for Low Power Application
Volume 118 No. 20 2018, 4947-4954 ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu An MFA Binary Counter for Low Power Application Sneha P Department of ECE PSNA CET, Dindigul, India
More informationAvailable online at ScienceDirect. Procedia Technology 24 (2016 )
Available online at www.sciencedirect.com ScienceDirect Procedia Technology 24 (2016 ) 1155 1162 International Conference on Emerging Trends in Engineering, Science and Technology (ICETEST 2015) FPGA Implementation
More informationClocks. Sequential Logic. A clock is a free-running signal with a cycle time.
Clocks A clock is a free-running signal with a cycle time. A clock may be either high or low, and alternates between the two states. The length of time the clock is high before changing states is its high
More informationLogic Design Viva Question Bank Compiled By Channveer Patil
Logic Design Viva Question Bank Compiled By Channveer Patil Title of the Practical: Verify the truth table of logic gates AND, OR, NOT, NAND and NOR gates/ Design Basic Gates Using NAND/NOR gates. Q.1
More informationDecade Counters Mod-5 counter: Decade Counter:
Decade Counters We can design a decade counter using cascade of mod-5 and mod-2 counters. Mod-2 counter is just a single flip-flop with the two stable states as 0 and 1. Mod-5 counter: A typical mod-5
More informationCHAPTER 4: Logic Circuits
CHAPTER 4: Logic Circuits II. Sequential Circuits Combinational circuits o The outputs depend only on the current input values o It uses only logic gates, decoders, multiplexers, ALUs Sequential circuits
More informationA New Proposed Design of a Stream Cipher Algorithm: Modified Grain - 128
International Journal of Computer and Information Technology (ISSN: 2279 764) Volume 3 Issue 5, September 214 A New Proposed Design of a Stream Cipher Algorithm: Modified Grain - 128 Norul Hidayah Lot
More information