搜索结果: 1-15 共查到“军事学 k code”相关记录75条 . 查询时间(0.093 秒)
Code Constructions for Physical Unclonable Functions and Biometric Secrecy Systems
Information theoretic security key agreement physical unclonable functions
2019/7/8
The two-terminal key agreement problem with biometric or physical identifiers is considered. Two linear code constructions based on Wyner-Ziv coding are developed. The first construction uses random l...
A Modified pqsigRM: RM Code-Based Signature Scheme
Code-based cryptography Courtois Finiasz
2019/6/12
We propose a novel signature scheme based on a modified Reed--Muller (RM) code, which reduces the signing complexity and key size compared to existing code-based signature schemes. This cheme is calle...
Evaluation of Code-based Signature Schemes
post-quantum cryptography code-based cryptography signature scheme
2019/5/23
Code-based cryptographic schemes recently raised to prominence as quantum-safe alternatives to the currently employed number-theoretic constructions, which do not resist quantum attacks. In this artic...
New Code-Based Privacy-Preserving Cryptographic Constructions
Code-based cryptography zero-knowledge range arguments
2019/5/21
Code-based cryptography has a long history but did suffer from periods of slow development. The field has recently attracted a lot of attention as one of the major branches of post-quantum cryptograph...
A Post-Quantum UC-Commitment Scheme in the Global Random Oracle Model from Code-Based Assumptions
Commitment Scheme Universal Composability
2019/2/27
In this work, we propose the first post-quantum UC-commitment scheme in the Global Random Oracle Model, where only one non-programmable random oracle is available. The security of our proposal is base...
Cryptanalysis of a New Code-based Signature Scheme with Shorter Public Key in PKC 2019
RQCS digital signatures cryptanalysis
2019/2/27
Song, Huang, Mu, and Wu proposed a new code-based signature scheme, the Rank Quasi-Cyclic Signature (RQCS) scheme (PKC 2019, Cryptology ePrint Archive 2019/053), which is based on an IND-CCA2 KEM sche...
Constant-time BCH Error-Correcting Code
Lattice-based cryptography Decryption failures Error-correcting codes
2019/2/25
Decryption failure is a common phenomenon in most lattice-based public-key schemes. To reduce the rate of decryption failure, application of error correction code can be helpful. However, the literatu...
A New Code-based Signature Scheme with Shorter Public Key
Post-Quantum Cryptography Rank Metric Codes Digital Signatures
2019/1/26
Code-based signature has been believed to be a useful authentication tool for post-quantum cryptography. There have been some attempts to construct efficient code-based signatures; however, existing c...
Error Amplification in Code-based Cryptography
post-quantum cryptography MDPC timing attack
2019/1/2
Code-based cryptography is one of the main techniques enabling cryptographic primitives in a post-quantum scenario. In particular, the MDPC scheme is a basic scheme from which many other schemes have ...
Cryptanalysis of a code-based one-time signature
Post-Quantum Cryptography Coding Theory Digital Signature
2018/12/20
In 2012, Lyubashevsky introduced a new framework for building lattice-based signature schemes without resorting to any trapdoor (such as GPV [6] or NTRU [8]). The idea is to sample a set of short latt...
On a Rank-Metric Code-Based Cryptosystem with Small Key Size
code-based cryptography rank-metric codes interleaving
2018/12/19
A repair of the Faure-Loidreau (FL) public-key code-based cryptosystem is proposed.The FL cryptosystem is based on the hardness of list decoding Gabidulin codes which are special rank-metric codes. We...
Code-based Cryptosystem from Quasi-Cyclic Elliptic Codes
code-based cryptography post quantum cryptograp elliptic code
2018/12/6
With the fast development of quantum computation, code based cryptography arises public concern as a candidate of post quantum cryptography. However, the large key-size becomes a main drawback such th...
We present here Wave the first ``hash-and-sign'' code-based signature scheme which strictly follows the GPV strategy [GPV08]. It uses the family of ternary generalized (U,U+V)(U,U+V) codes. We prove t...
A polynomial attack on a NIST proposal: RankSign, a code-based signature in rank metric
public-key cryptography NIST
2018/4/17
RankSign is a code-based signature scheme proposed to the NIST competition for post-quantum cryptography [AGHRZ17]. It is based on the rank metric and enjoys remarkably small key sizes, about 10KBytes...
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing
LPN Worst-Case to Average Case Reductions Collision-Resistant Hashing
2018/3/23
We present a worst case decoding problem whose hardness reduces to that of solving the Learning Parity with Noise (LPN) problem, in some parameter regime. Prior to this work, no worst case hardness re...