| Contents | |
|---|---|
|
ECE 570 - Advanced Computer Architecture - Winter 2000 Reconfigurable Computing ECE 575 - Data Security and Cryptography - Winter 2000 MARS encryption algorithm ECE 577 - Computer Arithmetic - Fall 1999 Simulation of On-line-Arithmetic Algorithms using C ECE 578 - Computer and Network Security - Spring 2000 Internet Banking - How secure is it? ECE 679 - FPGA design using VHDL - Fall 2000 Testbench for SRT Division Algorithm ECE 567 - Digital Signal Processing - Spring 2000 Interpolation by a factor of 100 ECE 565 - Network and Data Communication - Winter 2001 Simple encrypted FTP program in C |
|
| ECE 570 - Advanced Computer Architecture - Winter 2000 | |
|
Reconfigurable Computing There's a whole field of people, multiple conferences/year, who think the future of computing is a small fixed CPU core surrounded by a sea of uncommitted gates or simple processors. At runtime the fixed core programs the sea of simple processors to very closely match the needs of the workload. Do a survey of the claims, the designs done to date; how fast can they reconfigure? How much faster is the reconfigured processor than the fixed core + software? How much clock frequency are the reconfig folks giving up vs. the fixed+SW chips? Where's all this going? The reconfig folks generally look for the One Killer App that shows their hardware scheme to its best advantage. How good is that? How bad is the worst-performing app, and are normal apps more like the killer one or the worst one? Why? project report (pdf) |
|
| top of page | |
| ECE 575 - Data Security and Cryptography - Winter 2000 | |
|
MARS encryption algorithm The MARS encryption algorithm was developed by IBM and is a candidate for AES (Advanced Encryption Standard). It is a symmetric key block ciper uses 128 bit blocks and supports variable key sizes (from 128 to 1248 bits). MARS is unique in that it combines virtually every design technique known to cryptographers in one algorithm. It uses addition and subtractions, S-boxes, fixed and data dependent rotations, and multiplications. The goal of this project was to analize the MARS encryption algorithm and point out some advantages of this algorithms compared to the other candidates for AES. Further a demoprogram based on the c-code that was published by NIST on February, 18th 2000 shows how the algorithm works. Project report Source code The demoprogram does unfortunately not work anymore, because OSU stopped my ENGR account with CGI ability. You can install it on your account, see the readme file that comes with the source. |
|
| top of page | |
| ECE 577 - Computer Arithmetic - Fall 1999 | |
|
Simulation of On-line-Arithmetic Algorithms using C On-line Arithmetic is a special kind of Algorithms that start with the most significant bit of the operands first. After a certain delay they produce the most significant bit of the result first. These algorithms work with redundant number systems. In this project I improved an existing simulator for on-line algorithms wirtten in C. project report (PDF) |
|
| top of page | |
| ECE 578 - Computer and Network Security - Spring 2000 | |
|
Internet Banking - How secure is it? Most banks offer their customers a web interface to access their bank account and making transactions like payments, stock orders and others. Every bank has an own solution, so there is no standard. Most systems are based on SSL connections with 128bit cryptographic keys and certificates. In this project we analyze some of these systems and compare them in terms of security. We show some weaknesses of the systems itself and how they possibly could be attacked. Furthermore we have a critical look at the instructions and information about security issues the banks provide for the user. project report (PDF) |
|
| top of page | |
| ECE 679 - FPGA design using VHDL - Fall 2000 | |
|
Testbench for SRT Division Algorithm This project is an implementation of a SRT divider using VHDL. A version of this algorithm is used in several microprocessors as for example the Pentium Family from Intel. It is a Division by Digit Recurrence scheme that works with a internal residue and a selection function. The implementation is a version that works in radix-2 and uses a redundant adder (CSA) to calculate the residue. At the output is a converter that converts the result from a maximally redundant radix-2 system produced by the selection function into a two's complement number. The main development of the project is a VHDL testbench that verifies the correctness of the results coming out of the divider. VHDL files and report |
|
| top of page | |
| ECE 567 - Digital Signal Processing - Spring 2000 | |
|
Interpolation by a factor of 100 This project shows the realization and simulation of an interpolator by a factor of 100. 
A single-stage and a more efficient four-stage solution are shown and compared. project report (PDF) MATLAB: m-files and simulink models |
|
| top of page | |
| ECE 565 - Network and Data Communication - Winter 2001 | |
|
Simple encrypted FTP program in C For this project we implemented a UNIX program in C that works as receiver or as sender. The two programs establish a session key at the begin of the connection using Diffie-Hellmann Key Exchange protocol (1024 bit, public key). The sender encrypts the data block in each frame (Application-Level Encryption) before sending, using single DES encryption (56 bit key, 8bit cipher feedback). The receiving program produces both original file, and received data log (encrypted data). The program is menu driven and runs on HP-UX machines. project report (PDF) Source code (tar) |
|
| top of page | |
