preimage


Also found in: Wikipedia.
Related to preimage: Preimage attack

pre·im·age

 (prē′ĭm′ĭj)
n. Mathematics
The set of arguments of a function corresponding to a particular subset of the range.
American Heritage® Dictionary of the English Language, Fifth Edition. Copyright © 2016 by Houghton Mifflin Harcourt Publishing Company. Published by Houghton Mifflin Harcourt Publishing Company. All rights reserved.
References in periodicals archive ?
(i) If B = {<v, [[mu].sub.B] (v), [[gamma].sub.B] (v)> : v [member of] Y} is an IFS in Y, then the preimage of B under [phi] (denoted by [[phi].sup.-1](B)) is defined by [[phi].sup.-1](B) = {<u, [[phi].sup.-1] ([[mu].sub.B]) (u),[[phi].sup.-1]([[gamma].sub.B]) (u)> : u [member of] X}.
The indeterminacy points and ramification divisors of [??], [[??].sub.1], [[??].sub.2] are contained in the singular fibres and their preimage. The correspondence (2.2) induces the endomorphism [[??].sub.2*] [??]* o [[??].sub.1*] on rational pluricanonical forms on [S.sub.[GAMMA]].
Here the concept of "fault diagnosis" is one-way functions are collision resistant - given a message digest [K.sub.commit](D) it is computationally hard to find the preimage of the digest, that can produce the same digest.
The goal of UOV attack is to find the preimage of Oil subspace O under transformation [T.sup.-1] by exploiting a symmety hidden in the differential structure of UOV.
In general, AES key size defines the most attractive target helping cryptanalysis to find key recovery or preimage attacks on AES.
The twin preimage of real model is generated at the design stage.
Moreover, since [[PHI].sup.[lambda]] is conformal, the topological property of each interpolant on the s-Enneper surface, whether it is a simple curve or a loop, is the same as that of the preimage of itself obtained from the inverse of [[PHI].sup.[lambda]].
In the next two sections, we consider two types of second-order Zadeh image and preimage operators of (L, M)-double fuzzy filter base and examine their characteristics by giving examples.
The advantages of using hash functions to generate MACs include elevated collision, preimage, and second preimage resistances.
Denote by [[??].sub.n1] the class of continuous operators F : [H.sup.n](D) [right arrow] H(D) such that each polynomial p(s) has its preimage [F.sup.-1]{p}.
Relabeling classes as in Lemma 1.2, for each [[bar.[beta]]] [member of] R[[bar.[phi]], [bar.[psi]]] we fix a preimage [[beta]] [member of] R[[phi], [psi]], and the above becomes: