The Experts below are selected from a list of 52641 Experts worldwide ranked by ideXlab platform

Rocchi Luciano - One of the best experts on this subject based on the ideXlab platform.

Ingrid Verbauwhede - One of the best experts on this subject based on the ideXlab platform.

  • a survey on lightweight entity authentication with strong pufs
    ACM Computing Surveys, 2015
    Co-Authors: Jeroen Delvaux, Roel Peeters, Ingrid Verbauwhede
    Abstract:

    Physically unclonable functions (PUFs) exploit the unavoidable manufacturing variations of an Integrated Circuit (IC). Their input-output behavior serves as a unique IC “fingerprint.” Therefore, they have been envisioned as an IC authentication mechanism, in particular the subclass of so-called strong PUFs. The protocol proposals are typically accompanied with two PUF promises: lightweight and an increased resistance against physical attacks. In this work, we review 19 proposals in Chronological Order: from the original strong PUF proposal (2001) to the more complicated noise bifurcation and system of PUF proposals (2014). The assessment is aided by a unified notation and a transparent framework of PUF protocol requirements.

  • a survey on lightweight entity authentication with strong pufs
    2015
    Co-Authors: Jeroen Delvaux, Roel Peeters, Ingrid Verbauwhede
    Abstract:

    Physically unclonable functions (PUFs) exploit the unavoidable manufacturing variations of an integrated circuit (IC). Their input-output behavior serves as a unique IC ‘fingerprint’. Therefore, they have been envisioned as an IC authentication mechanism, in particular the subclass of so-called strong PUFs. The protocol proposals are typically accompanied with two PUF promises: lightweight and an increased resistance against physical attacks. In this work, we review nineteen proposals in Chronological Order: from the original strong PUF proposal (2001) to the more complicated noise bifurcation and system of PUF proposals (2014). The assessment is aided by a unified notation and a transparent framework of PUF protocol requirements.

Jeroen Delvaux - One of the best experts on this subject based on the ideXlab platform.

  • a survey on lightweight entity authentication with strong pufs
    ACM Computing Surveys, 2015
    Co-Authors: Jeroen Delvaux, Roel Peeters, Ingrid Verbauwhede
    Abstract:

    Physically unclonable functions (PUFs) exploit the unavoidable manufacturing variations of an Integrated Circuit (IC). Their input-output behavior serves as a unique IC “fingerprint.” Therefore, they have been envisioned as an IC authentication mechanism, in particular the subclass of so-called strong PUFs. The protocol proposals are typically accompanied with two PUF promises: lightweight and an increased resistance against physical attacks. In this work, we review 19 proposals in Chronological Order: from the original strong PUF proposal (2001) to the more complicated noise bifurcation and system of PUF proposals (2014). The assessment is aided by a unified notation and a transparent framework of PUF protocol requirements.

  • a survey on lightweight entity authentication with strong pufs
    2015
    Co-Authors: Jeroen Delvaux, Roel Peeters, Ingrid Verbauwhede
    Abstract:

    Physically unclonable functions (PUFs) exploit the unavoidable manufacturing variations of an integrated circuit (IC). Their input-output behavior serves as a unique IC ‘fingerprint’. Therefore, they have been envisioned as an IC authentication mechanism, in particular the subclass of so-called strong PUFs. The protocol proposals are typically accompanied with two PUF promises: lightweight and an increased resistance against physical attacks. In this work, we review nineteen proposals in Chronological Order: from the original strong PUF proposal (2001) to the more complicated noise bifurcation and system of PUF proposals (2014). The assessment is aided by a unified notation and a transparent framework of PUF protocol requirements.

S M Reddy - One of the best experts on this subject based on the ideXlab platform.

  • improving the efficiency of static compaction based on Chronological Order enumeration of test sequences logic testing
    Asian Test Symposium, 2002
    Co-Authors: Irith Pomeranz, S M Reddy
    Abstract:

    Chronological Order enumeration is a static compaction procedure for synchronous sequential circuits that to-date produces the shortest test sequences overall for benchmark circuits. The Chronological Order enumeration procedure was not meant to compete in computational complexity with the highly-efficient restoration based compaction procedure. Rather, it was developed so as to provide a more aggressive target for static and dynamic test compaction procedures. Nevertheless, we describe in this work several algorithmic methods to improve the efficiency of compaction based on Chronological Order enumeration. These improvements reduce the run time of Chronological Order enumeration significantly using the same basic implementation. With these improvements, Chronological Order enumeration is shown to be faster and more effective than restoration based compaction for sequences produced by an ATPG that already uses restoration based compaction as part of the test generation process. For uncompacted sequences, restoration based compaction followed by the improved Chronological Order enumeration process is shown to be an effective combination.

  • improving the efficiency of static compaction based on Chronological Order enumeration of test sequences
    Asian Test Symposium, 2002
    Co-Authors: Irith Pomeranz, S M Reddy
    Abstract:

    Chronological Order enumeration is a static compaction procedurefor synchronous sequential circuits that to-date producesthe shortest test sequences overall for benchmark circuits. TheChronological Order enumeration procedure was not meant tocompete in computational complexity with the highly-efficientrestoration based compaction procedure. Rather, it wasdeveloped so as to provide a more aggressive target for static anddynamic test compaction procedures. Nevertheless, we describein this work several algorithmic methods to improve theefficiency of compaction based on Chronological Order enumeration.These improvements reduce the run time of ChronologicalOrder enumeration significantly using the same basic implementation.With these improvements, Chronological Order enumerationis shown to be faster and more effective than restorationbased compaction for sequences produced by an ATPG thatalready uses restoration based compaction as part of the test generationprocess. For uncompacted sequences, restoration basedcompaction followed by the improved Chronological Orderenumeration process is shown to be an effective combination.

  • enumeration of test sequences in increasing Chronological Order to improve the levels of compaction achieved by vector omission
    IEEE Transactions on Computers, 2002
    Co-Authors: Irith Pomeranz, S M Reddy
    Abstract:

    We describe a method to improve the levels of compaction achievable by static compaction procedures based on vector omission. Such procedures are used to reduce the lengths of test sequences for synchronous sequential circuits without reducing the fault coverage. The proposed procedure enumerates, in increasing Chronological Order, test sequences consisting of subsets of the vectors included in a given test sequence that needs to be compacted. The unique feature of this approach is that test vectors omitted from the test sequence at an earlier iteration can be reintroduced at a later iteration. This results in a less greedy procedure and helps reduce the compacted test sequence length beyond the length that can be achieved if vectors are omitted permanently as in earlier procedures.

Chapin Crow & Publisher - One of the best experts on this subject based on the ideXlab platform.