Single-chip FPGA implementation of a pipelined, memory-based AES Rijndael encryption design
Bibliographic record
Abstract
In this paper, we present a fully synchronous, memory-based, single-chip FPGA implementation of the recent AES standard, Rijndael encryption algorithm. Our RTL design encrypts the necessary AES rounds in an arithmetic pipeline structure. The dual-width encryption datapath uses lookup table (LUT) architecture to perform encryption with internally generated round keys. Rijndael state matrix cell entries are transformed individually at the byte-level for encryption operations such as cipher key addition, byte substitution, and shift row. Whereas, a 32-bit DSP core, inserted in the pipeline, allows for Galios field(8) arithmetic operations at the word-level of the state matrix column. Design functionality was verified using self-checking testbench with the NIST Known Answer Tests. Our FPGA implementation targets a Xilinx VirtexIIPro device. Experimental clock frequencies, throughput translations, latency-area issues and FPGA resource utilizations are presented for the memory-based design. Finally, we present a brief comparison of our FPGA implementation with other implementations of the Rijndael encryption algorithm
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".