搜索结果: 1-15 共查到“Candidates”相关记录91条 . 查询时间(0.361 秒)
Structure-based design of antiviral drug candidates targeting the SARS-CoV-2 main protease
Structure-based design antiviral drug candidates targeting SARS-CoV-2 protease
2020/6/12
SARS-CoV-2 is the etiological agent responsible for the global COVID-19 outbreak. The main protease (Mpro) of SARS-CoV-2 is a key enzyme that plays a pivotal role in mediating viral replication and tr...
Hardware Implementations of NIST Lightweight Cryptographic Candidates: A First Look
Lightweight cryptography FPGA Authenticated cipher
2019/7/17
Security in the Internet of Things (IoT) is challenging. The need for lightweight yet robust cryptographic solutions suitable for the IoT calls for improved design and implementation of constructs suc...
Exploiting Determinism in Lattice-based Signatures - Practical Fault Attacks on pqm4 Implementations of NIST candidates
Deterministic Lattice Signatures pqm4 Fault Attack
2019/7/8
In this paper, we analyze the implementation level fault vulnerabilities of deterministic lattice-based signature schemes. In particular, we extend the practicality of skip-addition fault attacks thro...
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...
Statistical Zeroizing Attack: Cryptanalysis of Candidates of BP Obfuscation over GGH15 Multilinear Map
Cryptanalysis indistinguishability obfuscation multilinear map
2018/11/12
We introduce a new type of cryptanalytic algorithm on the obfuscations based on the branching programs. Applying this algorithm to two recent general-purpose obfuscation schemes one by Chen et al. (CR...
Faster multiplication in $\mathbb{Z}_{2^m}[x]$ on Cortex-M4 to speed up NIST PQC candidates
ARM Cortex-M4 Karatsuba Toom
2018/11/2
In this paper we optimize multiplication of polynomials in Z2m[x]Z2m[x] on the ARM Cortex-M4 microprocessor. We use these optimized multiplication routines to speed up the NIST post-quantum candidates...
GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates
Graded encodings indistinguishability obfuscation
2018/4/19
We present new constructions of private constrained PRFs and lockable obfuscation, for constraints (resp. functions to be obfuscated) that are computable by general branching programs. Our constructio...
A Comprehensive Performance Analysis of Hardware Implementations of CAESAR Candidates
ASIC Implementation FPGA Authenticated Encryption
2018/1/2
Authenticated encryption with Associated Data (AEAD) plays a significant role in cryptography because of its ability to provide integrity, confidentiality and authenticity at the same time. Due to the...
Authenticated ciphers rely on the uniqueness of the nonces to meet their security goals. In this work, we investigate the implications of reusing nonces for three third-round candidates of the ongoing...
Under Pressure: Security of Caesar Candidates beyond their Guarantees
Authenticated Encryption CAESAR Competition Forgery
2017/11/28
The Competition for Authenticated Encryption: Security, Applicability and Robustness (CAESAR) has as its official goal to ``identify a portfolio of authenticated ciphers that offer advantages over AES...
A cosmic barbecue:Researchers spot 60 new ‘hot Jupiter’ candidates
A cosmic barbecue Researchers 60 new hot Jupiter candidates
2017/7/24
Yale researchers have identified 60 potential new “hot Jupiters” — highly irradiated worlds that glow like coals on a barbecue grill and are found orbiting only 1% of Sun-like stars.Hot Jupiters const...
Replay Attacks on Zero Round-Trip Time: The Case of the TLS 1.3 Handshake Candidates
protocol analysis zero round-trip time composition
2017/2/20
We investigate security of key exchange protocols supporting so-called zero round-trip time (0-RTT), enabling a client to establish a fresh provisional key without interaction, based only on cryptogra...
Software Benchmarking of the 2$^{\text{nd}}$ round CAESAR Candidates
real-worlds usecases tls ssh
2016/12/12
The software performance of cryptographic schemes is an important factor in the decision to include such a scheme in real-world protocols like TLS, SSH or IPsec. In this paper, we develop a benchmarki...
Heuristic Tool for Linear Cryptanalysis with Applications to CAESAR Candidates
linear cryptanalysis authenticated encryption automated tools
2016/1/27
Differential and linear cryptanalysis are the general purpose
tools to analyze various cryptographic primitives. Both techniques have
in common that they rely on the existence of good differential o...
New candidates for multivariate trapdoor functions
Multivariate cryptography HFE polynomials HFE cryptosystem
2016/1/9
We present a new method for building pairs of HFE polynomials of
high degree, such that the map constructed with such a pair is easy to invert.
The inversion is accomplished using a low degree polyn...