搜索结果: 1-15 共查到“军事学 new”相关记录516条 . 查询时间(0.171 秒)
A new elliptic curve point compression method based on Fp-rationality of some generalized Kummer surfaces
elliptic cryptography point compression Barreto-Naehrig curves
2019/9/19
In the article we propose a new compression method (to 2log2(p)+32log2(p)+3 bits) for the Fp2Fp2-points of an elliptic curve Eb:y2=x3+bEb:y2=x3+b (for b∈F∗p2b∈Fp2∗) of jj-invariant ...
A New Attack on RSA and Demytko's Elliptic Curve Cryptosystem
RSA Cryptanalysis Coppersmith's method
2019/9/19
Let N=pqN=pq be an RSA modulus and ee be a public exponent. Numerous attacks on RSA exploit the arithmetical properties of the key equation ed−k(p−1)(q−1)=1ed−k(p−1)(q...
A New Public Key Cryptosystem Based on Edwards Curves
Elliptic curves Twisted Edwards curves RSA cryptosystem
2019/9/19
The elliptic curve cryptography plays a central role in various cryptographic schemes and protocols. For efficiency reasons, Edwards curves and twisted Edwards curves have been introduced. In this pap...
A New Method for Geometric Interpretation of Elliptic Curve Discrete Logarithm Problem
Intersection of Curves Grobner Basis Vanishing Ideals
2019/9/19
In this paper, we intend to study the geometric meaning of the discrete logarithm problem defined over an Elliptic Curve. The key idea is to reduce the Elliptic Curve Discrete Logarithm Problem (EC-DL...
Forkcipher: a New Primitive for Authenticated Encryption of Very Short Messages
Authenticated encryption new primitive forkcipher
2019/9/6
Highly efficient encryption and authentication of short messages is an essential requirement for enabling security in constrained scenarios such as the CAN FD in automotive systems (max. message size ...
The binomial B(x)=x3+βx36 (where β is primitive in F24) over F210 is the first known example of an Almost Perfect Nonlinear (APN) function that is not CCZ-equivalent to a power function, and has remai...
New Approaches to Traitor Tracing with Embedded Identities
traitor tracing public-key cryptography
2019/8/30
In a traitor tracing (TT) system for nn users, every user has his/her own secret key. Content providers can encrypt messages using a public key, and each user can decrypt the ciphertext using his/her ...
New Constructions of Hinting PRGs, OWFs with Encryption, and more
number theory one-way functions RSA
2019/8/27
Over the last few years there has been a surge of new cryptographic results, including laconic oblivious transfer, (anonymous/ hierarchical) identity-based encryption, trapdoor functions, chosen-ciphe...
A new implementation of Falcon is presented. It solves longstanding issues in the existing reference code: the new implementation is constant-time, it does not require floating-point hardware (though ...
New Circuit Minimization Techniques for Smaller and Faster AES SBoxes
AES SBox circuit area circuit depth
2019/7/15
In this paper we consider various methods and techniques to find the smallest circuit realizing a given linear transformation on nn input signals and mm output signals, with a constraint of a maximum ...
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...
New Semi-Free-Start Collision Attack Framework for Reduced RIPEMD-160
hash function RIPEMD-160 freedom degree utilization
2019/6/10
RIPEMD-160 is a hash function published in 1996, which shares similarities with other hash functions designed in this time-period like MD4, MD5 and SHA-1. However, for RIPEMD-160, no (semi-free-start)...
A New Approach to Constructing Digital Signature Schemes (Extended Paper)
digital signatures hash functions public-key cryptography
2019/6/10
A new hash-based, server-supported digital signature scheme was proposed recently. We decompose the concept into forward-resistant tags and a generic cryptographic time-stamping service. Based on the ...
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...
Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification
PFG iO
2019/6/4
The existence of secure indistinguishability obfuscators (iO) has far-reaching implications, significantly expanding the scope of problems amenable to cryptographic study. All known approaches to cons...