搜索结果: 1-15 共查到“军事学 Functions”相关记录533条 . 查询时间(0.1 秒)
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More
Trapdoor functions range trapdoor hash power DDH
2019/9/3
Substantial work on trapdoor functions (TDFs) has led to many powerful notions and applications. However, despite tremendous work and progress, all known constructions have prohibitively large public ...
Linear Approximations of Random Functions and Permutations
random function random permutation multinomial distribution
2019/8/19
The goal of this paper is to investigate the behavior of the ideal cipher under linear cryptanalysis. The motivation of this work is twofold. First, before a practical cipher can be distinguished from...
Count of rotational symmetric bent Boolean functions
Rotational Symmetric Boolean Function Algebraic Normal Form Bent Boolean Function
2019/8/2
Counting the Boolean functions having specific cryptographic features is an interesting problem in combinatorics and cryptography. Count of bent functions for more than eight variables is unexplored. ...
Relation between o-equivalence and EA-equivalence for Niho bent functions
Bent function Boolean function EA-equivalence
2019/7/15
Boolean functions, and bent functions in particular, are considered up to so-called EA-equivalence, which is the most general known equivalence relation preserving bentness of functions. However, for ...
On equivalence between known families of quadratic APN functions
CCZ-equivalence EA-equivalence APN
2019/7/15
We study a question whether the currently known families of quadratic APN polynomials are pairwise different up to CCZ-equivalence. We reduce the list of these families to those CCZ-inequivalent to ea...
Code Constructions for Physical Unclonable Functions and Biometric Secrecy Systems
Information theoretic security key agreement physical unclonable functions
2019/7/8
The two-terminal key agreement problem with biometric or physical identifiers is considered. Two linear code constructions based on Wyner-Ziv coding are developed. The first construction uses random l...
On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations
Collision Resistance Statistical Zero Knowledge Black box separations
2019/6/12
The complexity of collision-resistant hash functions has been long studied in the theory of cryptography. While we often think about them as a Minicrypt primitive, black-box separations demonstrate th...
A Note on the (Im)possibility of Verifiable Delay Functions in the Random Oracle Model
Verifiable Delay Functions Random Oracle Model
2019/6/6
Boneh, Bonneau, B{\"u}nz, and Fisch (CRYPTO 2018) recently introduced the notion of a \emph{verifiable delay function} (VDF). VDFs are functions that take a long \emph{sequential} time TT to compute, ...
A Verifiable Delay Function (VDF) is a function that takes at least TT sequential steps to evaluate and produces a unique output that can be verified efficiently, in time essentially independent of TT...
Continuous Verifiable Delay Functions
Verifiable delay functions continuous verifiability randomness beacons
2019/6/4
We introduce the notion of a continuous verifiable delay functioncontinuous verifiable delay function (cVDF): a function gg which is (a) iteratively sequential---meaning that evaluating the iteration ...
New non-linearity parameters of Boolean functions
Boolean functions nonlinearity optimal functions bent functions
2019/6/4
The study of non-linearity (linearity) of Boolean function was initiated by Rothaus in 1976. The classical non-linearity of a Boolean function is the minimum Hamming distance of its truth table to tha...
We introduce a new primitive, called trapdoor hash functions (TDH), which are hash functions H:{0,1}n→{0,1}secH:{0,1}n→{0,1}sec with additional trapdoor function-like properties. Specifically, given a...
Weights on affine subspaces and some other cryptographic characteristics of Boolean functions of 5 variables
Boolean functions affine classification nonlinearity algebraic degree
2019/5/27
Recently one new key recovery method for a filter generator was proposed. It is based on so-called planar approximations of such a generator. This paper contains the numerical part of the research of ...
Pseudorandom functions are traditionally built upon block ciphers, but with the trend of permutation based cryptography, it is a natural question to investigate the design of pseudorandom functions fr...
UC-Commitment Schemes with Phase-Adaptive Security from Trapdoor Functions
Commitment Universal Composability Global Random Oracle
2019/5/21
We propose a generic framework for perfectly hiding UC-Commitment schemes in the Global Random Oracle model of Canetti \textit{el at.} (CCS 14). The main building block of our construction is a novel ...