搜索结果: 1-15 共查到“密码学 PRE”相关记录29条 . 查询时间(0.119 秒)
Information Conservational Security with “Black Hole” Keypad Compression and Scalable One-Time Pad — A Quantum Intelligence Approach to Pre- and Post-Quantum Cryptography
Pre- and Post-Quantum Cryptography Scalable One-Time Pad (S-OTP) Information Conservational Security (ICS)
2019/8/14
Whereas it is widely deemed impossible to overcome the optimality of the one-time pad (OTP) cipher in pre- and post-quantum cryptography, this work shows that the optimality of information theoretic s...
Decisional second-preimage resistance: When does SPR imply PRE?
cryptographic hash functions preimage resistance second-preimage resistance
2019/5/21
There is a well-known gap between second-preimage resistance and preimage resistance for length-preserving hash functions. This paper introduces a simple concept that fills this gap. One consequence o...
Approx-SVP in Ideal Lattices with Pre-processing
heuristic assumptions pre-processing phase outputs
2019/2/28
We describe an algorithm to solve the approximate Shortest Vector Problem for lattices corresponding to ideals of the ring of integers of an arbitrary number field KK. This algorithm has a pre-process...
Pre- and post-quantum Diffie--Hellman from groups, actions, and isogenies
key exchange elliptic-curve cryptography isogenies
2018/11/13
Diffie--Hellman key exchange is at the foundations of public-key cryptography, but conventional group-based Diffie--Hellman is vulnerable to Shor's quantum algorithm. A range of ``post-quantum Diffie-...
OPAQUE: An Asymmetric PAKE Protocol Secure Against Pre-Computation Attacks
Password authentication key exchange PAKE
2018/3/7
Password-Authenticated Key Exchange (PAKE) protocols allow two parties that only share a password to establish a shared key in a way that is immune to offline attacks. Asymmetric PAKE (aPAKE) strength...
A Novel Pre-Computation Scheme of Window τNAF for Koblitz Curves
Elliptic curve cryptography Koblitz curve Pre-computation
2017/10/25
Let Ea:y2+xy=x3+ax2+1/F2mEa:y2+xy=x3+ax2+1/F2m be a Koblitz curve. The window ττ-adic nonadjacent-form (window ττNAF) is currently the standard representation system to perform scalar multiplications ...
An attacker or evaluator can detect more information leakages if he improves the Signal-to-Noise Ratio (SNR) of power traces in his tests. For this purpose, pre-processings such as de-noise, distribut...
Convolutional Neural Networks with Data Augmentation against Jitter-Based Countermeasures -- Profiling Attacks without Pre-Processing --
side channel attacks machine learning deep learning
2017/8/10
In the context of the security evaluation of cryptographic implementations, profiling attacks (aka Template Attacks) play a fundamental role. Nowadays the most popular Template Attack strategy consist...
In the RFC 7748 memorandum, the Internet Research Task Force specified a Montgomery ladder scalar multiplication function based on two recently proposed prime elliptic curves. The purpose of this func...
Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
quantum cryptanalysis hash functions cost models
2016/12/8
We investigate the cost of Grover's quantum search algorithm when used in the context of pre-image attacks on the SHA-2 and SHA-3 families of hash functions. Our cost model assumes that the attack is ...
Efficient and Private Scoring of Decision Trees, Support Vector Machines and Logistic Regression Models based on Pre-Computation
privacy-preserving private data
2016/7/29
Many data-driven personalized services require that private data of users is scored against a trained machine learning model. In this paper we propose a novel protocol for privacy-preserving classific...
A Cryptographic Analysis of the TLS 1.3 draft-10 Full and Pre-shared Key Handshake Protocol
Transport Layer Security (TLS) key exchange protocol analysis
2016/2/23
We analyze the handshake protocol of TLS 1.3 draft-ietf-tls-tls13-10 (published October 2015). This continues and extends our previous analysis (CCS 2015, Cryptology ePrint Archive 2015) of former TLS...
TLS is by far the most important protocol on the Internet for negotiating secure session
keys and providing authentication. Only very recently, the standard ciphersuites of TLS have
been shown to pr...
On the Optimal Pre-Computation of Window $\tau$NAF for Koblitz Curves
public-key cryptography elliptic curve cryptosystem implementation
2016/1/7
Koblitz curves have been a nice subject of consideration for both theoretical and
practical interests. The window τ -adic algorithm of Solinas (window τNAF) is the
most powerful method for computing...
Bounded Pre-Image Awareness and the Security of Hash-Tree Keyless Signatures
hash functions Pre-image awareness time-stamping
2016/1/7
We present a new tighter security proof for unbounded hash tree keyless signature (timestamping)
schemes that use Merkle-Damgⅹard (MD) hash functions with Preimage Aware (PrA) compression
functions....