Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 47 for “"Preimage"”.

  1. ATPG based Preimage Computation: Efficient Search Space Pruning using ZBDD

    Preimage Computation is a fundamental step in Formal Verification of VLSI designs. Conventional OBDD-based methods for Formal Verification suffer from spatial explosion, since large designs can blow up in terms of memory. On the other hand, SAT/ATPG based methods are less demanding on memory. But …

    vt Repository record for ATPG based Preimage Computation: Efficient Search Space Pruning using ZBDD (opens in a new tab)

  2. A Theory of Preimage Complexity: Data-structures, Complexity Measures and Applications to Endofunctions and Associated Digraphs

    … This novel approach is based on the structure of preimage sets generated under repeat application of the inverse. We encode this information in our primary data-structure, an square matrix called the sigma matrix. This matrix allows us to easily encode information about the functional digraph and …

    uno Repository record for A Theory of Preimage Complexity: Data-structures, Complexity Measures and Applications to Endofunctions and Associated Digraphs (opens in a new tab)

  3. Reeb Spaces and the Robustness of Preimages

    <p>We study how the preimages of a mapping f : X &rarr Y between manifolds vary under perturbations. First, we consider the preimage of a single point and track the history of its connected component as this point varies in Y. This information is compactly represented in a structure that is the …

    duke Repository record for Reeb Spaces and the Robustness of Preimages (opens in a new tab)

  4. Towards a Theory of Recursive Function Complexity: Sigma Matrices and Inverse Complexity Measures

    This paper develops a data structure based on preimage sets of functions on a finite set. This structure, called the sigma matrix, is shown to be particularly well-suited for exploring the structural characteristics of recursive functions relevant to investigations of complexity. The matrix is easy …

    uno Repository record for Towards a Theory of Recursive Function Complexity: Sigma Matrices and Inverse Complexity Measures (opens in a new tab)

  5. Formal Algebraic Reasoning About Compression Function Security

    … security properties like collision resistance, preimage resistance, and indifferentiability from a random oracle (RO). Creating efficient hash functions with provable security has long posed a challenge. Security proofs for hash functions usually fall under the random oracle model or the ideal …

    uvic Repository record for Formal Algebraic Reasoning About Compression Function Security (opens in a new tab)

  6. The Complete Preimage of Euclidean K-Space Under an Open Mapping With The1-Regular Property and Whose Point Inverses Are Open 2-Cells Is Euclidean(k Plus 2)-Space

    Made available in DSpace on 2014-12-11T18:23:45Z (GMT). No. of bitstreams: 1 7206926.pdf: 3145209 bytes, checksum: 3212c154ca63432b3b2871295b0d3241 (MD5) Previous issue date: 1971

    uiuc Repository record for The Complete Preimage of Euclidean K-Space Under an Open Mapping With The1-Regular Property and Whose Point Inverses Are Open 2-Cells Is Euclidean(k Plus 2)-Space (opens in a new tab)

  7. Response curves of deterministic and probabilistic cellular automata in one and two dimensions

    … We approach this problem using patterns in preimage sets - that is, the set of blocks which iterate to the desired output. This allows us to construct a response curve - a relationship between the proportion of cells in state 1 after niterations as a function of the initial proportion. We …

    brock Repository record for Response curves of deterministic and probabilistic cellular automata in one and two dimensions (opens in a new tab)

  8. Search-space Aware Learning Techniques for Unbounded Model Checking and Path Delay Testing

    … model checking, we need the core image / preimage computation engines that perform forward / backward reachability analysis. First, we develop an ATPG engine, with search-space aware learning, that computes ``all solutions" for a given target objective and stores it as a decision diagram. …

    vt Repository record for Search-space Aware Learning Techniques for Unbounded Model Checking and Path Delay Testing (opens in a new tab)

  9. The Jacobian Map On Outer Space

    … image of J is discussed. It is shown that the preimage of Soul´ 's well-rounded retract of Y3 is a deformation retract of X3 . e The quotient K of this preimage by the kernel of the natural map from Out(Fn ) to GL(n, Z) is an Eilenberg-MacLane space for this kernel. A 2-dimensional subspace A …

    cornell Repository record for The Jacobian Map On Outer Space (opens in a new tab)

  10. Finite Subdivision Rules from Matings of Quadratic Functions: Existence and Constructions

    Combinatorial methods are utilized to examine preimage iterations of topologically glued polynomials. In particular, this paper addresses using finite subdivision rules and Hubbard trees as tools to model the dynamic behavior of mated quadratic functions. Several methods of construction of …

    vt Repository record for Finite Subdivision Rules from Matings of Quadratic Functions: Existence and Constructions (opens in a new tab)

  11. A Novel Method For Watermarking Sequential Circuits

    … (1) data-mining hidden functionality, (2) preimage, (3) secondary preimage, and (4) collision, can be shown to be computationally infeasible. Experimental results for the ten largest IWLS 93 benchmarks that the proposed watermarking technique is a secure, yet flexible, technique for …

    usf Repository record for A Novel Method For Watermarking Sequential Circuits (opens in a new tab)

  12. Designing Cryptographic Hash Functions- Architecture and Implementation

    … our final cryptographic hash function exhibits preimage resistance, second preimage resistance, and collision resistance properties similar to the well-known cryptographic hash function SHA-256. We also show that our final cryptographic hash function presents a near-ideal avalanche effect, …

    tamu Repository record for Designing Cryptographic Hash Functions- Architecture and Implementation (opens in a new tab)

  13. Designing Cryptographic Hash Functions- Architecture and Implementation

    … our final cryptographic hash function exhibits preimage resistance, second preimage resistance, and collision resistance properties similar to the well-known cryptographic hash function SHA-256. We also show that our final cryptographic hash function presents a near-ideal avalanche effect, …

    tamu Repository record for Designing Cryptographic Hash Functions- Architecture and Implementation (opens in a new tab)

  14. Designing Cryptographic Hash Functions- Architecture and Implementation

    … our final cryptographic hash function exhibits preimage resistance, second preimage resistance, and collision resistance properties similar to the well-known cryptographic hash function SHA-256. We also show that our final cryptographic hash function presents a near-ideal avalanche effect, …

    tamu Repository record for Designing Cryptographic Hash Functions- Architecture and Implementation (opens in a new tab)

  15. Designing Cryptographic Hash Functions- Architecture and Implementation

    … our final cryptographic hash function exhibits preimage resistance, second preimage resistance, and collision resistance properties similar to the well-known cryptographic hash function SHA-256. We also show that our final cryptographic hash function presents a near-ideal avalanche effect, …

    tamu Repository record for Designing Cryptographic Hash Functions- Architecture and Implementation (opens in a new tab)

  16. Designing Cryptographic Hash Functions- Architecture and Implementation

    … our final cryptographic hash function exhibits preimage resistance, second preimage resistance, and collision resistance properties similar to the well-known cryptographic hash function SHA-256. We also show that our final cryptographic hash function presents a near-ideal avalanche effect, …

    tamu Repository record for Designing Cryptographic Hash Functions- Architecture and Implementation (opens in a new tab)

  17. Designing Cryptographic Hash Functions- Architecture and Implementation

    … our final cryptographic hash function exhibits preimage resistance, second preimage resistance, and collision resistance properties similar to the well-known cryptographic hash function SHA-256. We also show that our final cryptographic hash function presents a near-ideal avalanche effect, …

    tamu Repository record for Designing Cryptographic Hash Functions- Architecture and Implementation (opens in a new tab)

  18. The Logarithmic Derivative and Model-Theoretic Analysability in Differentially Closed Fields

    … given a type internal to the constants, is its preimage under logδ, which is 2-step analysable in the constants, ever internal to the constants? The question is answered positively, and a criterion for when the preimage is indeed internal is proposed. Partial results are proven for this …

    waterloo Repository record for The Logarithmic Derivative and Model-Theoretic Analysability in Differentially Closed Fields (opens in a new tab)

  19. Noise resilience of proofs of quantumness

    … bit flip noise affects the success rate of the preimage test more heavily than the equation test. Conversely, the phase flip noise affects the equation test more heavily than the preimage test. With a maximum tolerable error rate of 0.10% obtained from the simple noise models, the protocol is …

    reykjavik Repository record for Noise resilience of proofs of quantumness (opens in a new tab)

Page 1 of 3