provable formula

provable formula的基本解释

-

可证公式

与provable formula相关的网络例句 [注：此内容来源于网络，仅供参考]

Provable Security is a formal method for proving the security of cryptographic schemes, in which the difficulty of breaking a particular scheme is formally related to that of solving a widely believed computational hard problem. Provable security has already become an important theme of theoretical researches in modern cryptography. This dissertation investigates the provable security of public-key encryptions and hybrid encryptions of asymmetric and symmetric encryptions. This includes the various formal security notions and the constructions can be proved to achieve them. Among the constructions, hybrid encryptions are themselves an important way to obtain public-key encryption schemes with chosen ciphertext security. The main results are as follows:(1) The one-wayness of the trapdoor one-way function in NTRU depends on the randomness of the session key, which is different from previous ones. Based on this observation, a new kind of trapdoor one-way function, trapdoor one-way functions with an auxiliary random variable is proposed.

可证明安全性是一种证明密码学方案安全性的形式化方法，它将密码学方案的安全性归约为公认的计算难题，已成为现代密码学领域中理论工作的主线，本文主要研究公钥加密与单双钥混合加密的可证明安全性，这包括它们的各种形式化安全性定义以及达到这些安全性定义的方案构造，而单双钥混合加密本身也是一种构造选择密文安全公钥加密的重要方法，本文得到的主要结果如下：(1)在研究NTRU公钥加密的特殊性基础上，对于公钥加密的陷门单向函数加密模型进行了扩展，提出了具有辅助陷门单向函数的概念，并将其扩展到多元的情况，讨论了可能的密码学用途。

At the same time , we discuss the determinism and nondeterminism of formula-clock automata and the closure propertied under Boolean operation of the language which is accepted by formula-clock automata. We also prove the expressive equivalence between the deterministic formula-clock automata and the nondeterministic formula-clock automata. This means that every nondeterministic formula-clock automata can be transformed to a deterministic formula-clock automata which exactly accept the timed language identified by the fomer.We also extend timed words to infiniteness and define the formula-clock Buchi automata and the formula-clock Muller automata. At last, we show its application in formal verification and modeling of real-time system.

然后讨论了公式时钟自动机的确定性和非确定性，公式时钟自动机识别的语言类在并、交、补运算下的封闭性；并证明了确定的公式时钟自动机和非确定的公式时钟自动机表达能力的等价性，这意味这每一个非确定的公式时钟自动机都能转换为一个与之识别相同时间语言的确定的公式时钟自动机；我们将时间字扩展为无穷的，从而定义了公式时钟Buchi自动机与公式时钟Muller自动机；最后给出了用它进行实时系统的形式化验证方面及对实时系统建模的应用。

After rectifying the family structure, and educational level of parents, the influencing factor of adaptability was formula mainly; intensity of reaction was breastfeeding duration for 4-6 months and breast milk mainly; rhythmicity was breastfeeding duration for 7-9 months and formula only; activity level was both breast milk an formula milk equally and breastfeeding duration for 7-9 months; quality of mood was formula only and duration of breastfeeding for 7-9 months; approach-withdrawal was breast milk mainly and both breast milk and formula milk equally; distractibility was formula milk mainly.

校正家庭结构、父母亲受教育水平等因素后，适应度的影响因素是主要喂奶粉；反应强度的影响因素是母乳喂养持续时间4~6个月和主要喂母乳；规律性的影响因素是母乳喂养持续时间7~9个月和只喂奶粉；活动水平的影响因素是母乳与奶粉等量和母乳喂养持续时间7~9个月；情绪本质的影响因素是只喂奶粉和母乳喂养持续时间7~9个月；趋避性的影响因素是主要喂母乳和母乳与奶粉等量；注意分散的影响因素是主要喂奶粉。

与provable formula相关的网络解释 [注：此内容来源于网络，仅供参考]

provable formula：可证公式

provable 可证媚;可证的 | provable formula 可证公式 | prove 证明论证