Information Flow Analysis for VHDL

Terkel Kristian Tolstrup, Flemming Nielson, Hanne Riis Nielson

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    347 Downloads (Pure)

    Abstract

    We describe a fragment of the hardware description language VHDL that is suitable for implementing the Advanced Encryption Standard algorithm. We then define an Information Flow analysis as required by the international standard Common Criteria. The goal of the analysis is to identify the entire information flow through the VHDL program. The result of the analysis is presented as a non-transitive directed graph that connects those nodes (representing either variables or signals) where an information flow might occur. We compare our approach to that of Kemmerer and conclude that our approach yields more precise results.
    Original languageEnglish
    Title of host publicationParallel Computing Technoligies
    PublisherSpringer
    Publication date2005
    Publication statusPublished - 2005

    Cite this