搜索结果: 1-15 共查到“军事学 CRYPTO”相关记录36条 . 查询时间(0.037 秒)
Efficiently Masking Binomial Sampling at Arbitrary Orders for Lattice-Based Crypto
Masking Post-quantum Cryptography
2019/8/8
With the rising popularity of lattice-based cryptography, the Learning with Errors (LWE) problem has emerged as a fundamental core of numerous encryption and key exchange schemes. Many LWE-based schem...
Pseudorandom functions (PRFs) are one of the fundamental building blocks in cryptography. We explore a new space of plausible PRF candidates that are obtained by mixing linear functions over different...
Observations on the Dynamic Cube Attack of 855-Round TRIVIUM from Crypto'18
Dynamic Cube attack Division Property MILP
2018/11/6
Recently, another kind of dynamic cube attack is proposed by Fu et al. With some key guesses and a transformation in the output bit, they claim that, when the key guesses are correct, the degree of th...
A Refinement of “A Key-recovery Attack on 855-round Trivium" From CRYPTO 2018
Trivium Nullification Technique Polynomial Reduction
2018/11/5
At CRYPTO 2018, we proposed a method to reduce the Boolean polynomial of 855-round Trivium. By multiplying a polynomial reduction factor, the output Boolean polynomial is simplified. Based on this met...
Automated Penalization of Data Breaches using Crypto-augmented Smart Contracts
Data leakage Oblivious transfer Smart Contracts
2018/11/2
This work studies the problem of automatically penalizing intentional or unintentional data breach (APDB) by a receiver/custodian receiving confidential data from a sender. We solve this problem by au...
Faster Modular Arithmetic For Isogeny Based Crypto on Embedded Devices
public-key cryptography Embedded Devices
2018/9/6
We show how to implement the Montgomery reduction algorithm for isogeny based cryptography such that it can utilize the "unsigned multiply accumulate accumulate long" instruction present on modern ARM...
4-bit crypto S-boxes: Generation with irreducible polynomials over Galois field GF(24) and cryptanalysis
public-key cryptography EPs
2018/6/13
4-bit crypto S-boxes play a significant role in encryption and decryption of many cipher algorithms from last 4 decades. Generation and cryptanalysis of generated 4-bit crypto S-boxes is one of the ma...
At CRYPTO 2017, Belaïd et al. presented two new private multiplication algorithms over finite fields, to be used in secure masking schemes. To date, these algorithms have the lowest known complex...
A review of cryptographic properties of S-boxes with Generation and Analysis of crypto secure S-boxes
AES BFs
2018/5/11
In modern as well as ancient ciphers of public key cryptography, substitution boxes find a permanent seat. Generation and cryptanalysis of 4-bit as well as 8-bit crypto S-boxes is of utmost importance...
Start your ENGINEs: dynamically loadable contemporary crypto
applied cryptography public key cryptography elliptic curve cryptography
2018/4/19
Software ever-increasingly relies on building blocks implemented by security libraries, which provide access to evolving standards, protocols, and cryptographic primitives. These libraries are often s...
A New Crypto-Classifier Service for Energy Efficiency in Smart Cities
data privacy homomorphic encryption secure classification
2017/12/19
Smart Cities draw a nice picture of a connected city where useful services and data are ubiquitous, energy is properly used and urban infrastructures are well orchestrated. Fulfilling this vision in o...
A Review of Existing 4-bit Crypto S-box cryptanalysis Techniques and Two New Techniques with 4-bit Boolean Functions for Cryptanalysis of 4-bit Crypto S-boxes
public-key cryptography BFs
2017/12/1
4-bit Linear Relations play an important role in Cryptanalysis of 4-bit Bijective Crypto S-boxes. 4-bit finite differences also a major part of cryptanalysis of 4-bit substitution boxes. Count of exis...
Lattice Klepto: Turning Post-Quantum Crypto Against Itself
Post-quantum cryptography kleptography lattice-based encryption NTRU
2017/11/28
This paper studies ways to backdoor lattice-based systems following Young and Yung's work on backdooring RSA and discrete-log based systems. For the NTRU encryption scheme we show how to build a backd...
Rounded Gaussians -- Fast and Secure Constant-Time Sampling for Lattice-Based Crypto
Post-quantum cryptography lattice-based cryptography sig- natures
2017/10/25
This paper suggests to use rounded Gaussians in place of dis- crete Gaussians in rejection-sampling-based lattice signature schemes like BLISS. We show that this distribution can efficiently be sample...
Detecting Large Integer Arithmetic for Defense Against Crypto Ransomware
Crypto Ransomware Malware Analysis Public Key Encryption
2017/6/9
The evolution of crypto ransomware has increasingly influenced real-life systems and lead to fatal threats to data security of individuals and enterprises. A crypto ransomware basically encrypts files...