搜索结果: 1-15 共查到“军事学 security analysis”相关记录91条 . 查询时间(0.152 秒)
Security analysis of two lightweight certi ficateless signature schemes
Certificateless cryptography Cryptanalysis Signature
2019/8/19
Certificateless cryptography can be considered as an intermediate solution to overcome the issues in traditional public key infrastructure (PKI) and identity-based public key cryptography (ID-PKC). Th...
Comprehensive security analysis of CRAFT
Lightweight block cipher differential linear hull zero correlation
2019/6/24
CRAFT is a lightweight involuntary block cipher, designed to provide efficient protection against differential fault attack. It is a tweakable cipher which encrypts a 64-bit plaintext using a 128-bit ...
Security Analysis of Efficient Anonymous Authentication With Conditional Privacy Preserving Scheme for Vehicular Ad Hoc Networks
Vehicular ad hoc networks (VANETs) Impersonation attack Bogus message attack
2019/5/13
Protecting a driver’s privacy is one of the major concerns in vehicular ad hoc networks (VANETs). Currently, Azees et al. has proposed an efficient anonymous authentication protocol (EAAP) for VANETs....
Dragonblood: A Security Analysis of WPA3's SAE Handshake
implementation cryptographic protocols wpa3
2019/4/16
The WPA3 certification aims to secure Wi-Fi networks, and provides several advantages over its predecessor WPA2, such as protection against offline dictionary attacks and forward secrecy.
In this paper we analyze for the first time the post-quantum security of AES. AES is the most popular and widely used block cipher, established as the encryption standard by the NIST in 2001. We consi...
The BIG Cipher: Design, Security Analysis, and Hardware-Software Optimization Techniques
Block cipher linear cryptanalysis FPGA
2019/1/9
Secure block cipher design is a complex discipline which combines mathematics, engineering, and computer science. In order to develop cryptographers who are grounded in all three disciplines, it is ne...
Applications of H-Technique: Revisiting Symmetric Key Security Analysis
provable security coefficients H technique Feistel
2018/11/29
The Coefficients H Technique (also called H-technique), by Patarin, is a tool to obtain upper bound on the distinguishing advantage. The tool is known for providing quite simpler and tight bound proof...
Security Analysis for Randomness Improvements for Security Protocols
cryptographic protocols Security Protocols
2018/11/2
Many cryptographic mechanisms depend on the availability of secure random numbers. In practice, the sources of random numbers can be unreliable for many reasons. There exist ways to improve the reliab...
Quantum Security Analysis of CSIDH and Ordinary Isogeny-based Schemes
Post-quantum cryptography isogeny-based cryptography hidden shift problem
2018/6/5
CSIDH is a recent proposal by Castryck, Lange, Martindale, Panny and Renes for post-quantum non-interactive key-exchange. It is similar in design to a scheme by Couveignes, Rostovtsev and Stolbunov, b...
Security Analysis of Fan et al. Lightweight RFID Authentication Protocol for Privacy Protection in IoT
RFID IoT Secret disclosure
2018/5/2
The designers of Radio-Frequency IDentification (RFID) systems have a challenging task for proposing secure mutual authentication protocols for Internet of Things (IoT) applications. Recently, Fan et ...
Security Analysis and Modification of ID-Based Encryption with Equality Test from ACISP 2017
insider attacks chosen ciphertext attacks modification
2018/4/25
At ACISP 2017, Wu et al. presented an identity-based encryption with equality test (IBEET) that considers to prevent insider attacks. To analyze its security, they proposed a new security notion for I...
Security Analysis of a Dynamic Threshold Secret Sharing Scheme Using Linear Subspace Method
Dynamic threshold Linear subspace Forging
2017/11/14
A dealer-free and non-interactive dynamic threshold secret sharing scheme has been proposed by Harn et.al., in 2015. In this scheme, a (t; n) secret sharing scheme in secret reconstruction phase can t...
Why Attackers Lose: Design and Security Analysis of Arbitrarily Large XOR Arbiter PUFs
secret-key cryptography XOR
2017/9/26
In a novel analysis, we formally prove that arbitrarily many Arbiter PUFs can be combined into a stable XOR Arbiter PUF. To the best of our knowledge, this design cannot be modeled by any known oracle...
The security of a probabilistic Message Authentication Code (MAC) usually depends on the uniqueness of the random salt which restricts the security to birthday bound of the salt size due to the collis...
Security Analysis of an Ultra-lightweight RFID Authentication Protocol for M-commerce
Mobile commerce RFID Ultra-lightweight
2017/6/9
Over the last few years, more people perform their social activities on mobile devices, such as mobile payment or mobile wallet. Mobile commerce (m-commerce) refers to manipulating electronic commerce...