Concurrent Error Detection in Finite Field Arithmetic Operations
| dc.comment.hidden | Hi, I would appreciate if you review my thesis as soon as possible, since I need to have the letter stating I am done with my Ph.D. requirements to be able to start my job. Thanks, Siavash | en |
| dc.contributor.author | Bayat Sarmadi, Siavash | |
| dc.date.accessioned | 2008-01-03T16:23:59Z | |
| dc.date.available | 2008-01-03T16:23:59Z | |
| dc.date.issued | 2008-01-03T16:23:59Z | |
| dc.date.submitted | 2007 | |
| dc.description.abstract | With significant advances in wired and wireless technologies and also increased shrinking in the size of VLSI circuits, many devices have become very large because they need to contain several large units. This large number of gates and in turn large number of transistors causes the devices to be more prone to faults. These faults specially in sensitive and critical applications may cause serious failures and hence should be avoided. On the other hand, some critical applications such as cryptosystems may also be prone to deliberately injected faults by malicious attackers. Some of these faults can produce erroneous results that can reveal some important secret information of the cryptosystems. Furthermore, yield factor improvement is always an important issue in VLSI design and fabrication processes. Digital systems such as cryptosystems and digital signal processors usually contain finite field operations. Therefore, error detection and correction of such operations have become an important issue recently. In most of the work reported so far, error detection and correction are applied using redundancies in space (hardware), time, and/or information (coding theory). In this work, schemes based on these redundancies are presented to detect errors in important finite field arithmetic operations resulting from hardware faults. Finite fields are used in a number of practical cryptosystems and channel encoders/decoders. The schemes presented here can detect errors in arithmetic operations of finite fields represented in different bases, including polynomial, dual and/or normal basis, and implemented in various architectures, including bit-serial, bit-parallel and/or systolic arrays. | en |
| dc.identifier.uri | http://hdl.handle.net/10012/3460 | |
| dc.language.iso | en | en |
| dc.pending | false | en |
| dc.publisher | University of Waterloo | en |
| dc.subject | concurrent error detection (CED) | en |
| dc.subject | Finite field operations | en |
| dc.subject | polynomial basis | en |
| dc.subject | dual basis | en |
| dc.subject | normal basis | en |
| dc.subject | systolic arrays | en |
| dc.subject.program | Electrical and Computer Engineering | en |
| dc.title | Concurrent Error Detection in Finite Field Arithmetic Operations | en |
| dc.type | Doctoral Thesis | en |
| uws-etd.degree | Doctor of Philosophy | en |
| uws-etd.degree.department | Electrical and Computer Engineering | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |