搜索结果: 1-11 共查到“军事学 Error Correcting Codes”相关记录11条 . 查询时间(0.155 秒)
Timing attacks on Error Correcting Codes in Post-Quantum Secure Schemes
Post-Quantum Cryptography Decryption Failures Side-Channel Attacks
2019/3/20
While error correcting codes (ECC) have the potential to significantly reduce the failure probability of post-quantum schemes, they add an extra ECC decoding step to the algorithm. As this additional ...
Analysis of Error-Correcting Codes for Lattice-Based Key Exchange
post-quantum key exchange NewHope Simple error-correcting codes
2018/3/7
Lattice problems allow the construction of very efficient key exchange and public-key encryption schemes. When using the Learning with Errors (LWE) or Ring-LWE (RLWE) problem such schemes exhibit an i...
Variable-Length Bit Mapping and Error-Correcting Codes for Higher-Order Alphabet PUFs
Higher-Order Alphabet PUFs Error-Correcting Codes
2017/9/25
Device-specific physical characteristics provide the foundation for PUFs, a hardware primitive for secure storage of cryptographic keys. So far, they have been implemented by either directly evaluatin...
Near-Optimal Secret Sharing and Error Correcting Codes in AC0
secret sharing Near-Optimal Secret Sharing
2017/9/25
We study the question of minimizing the computational complexity of (robust) secret sharing schemes and error correcting codes. In standard instances of these objects, both encoding and decoding invol...
Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions
hash function near-collision random-code
2016/1/9
In this paper we consider the problem of finding a near-collision with Hamming distance bounded by r in a generic cryptographic hash function h whose outputs can be modeled as random n-bit strings. In...
Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
Linear Secret Sharing Schemes Linear Time Sharing Robust Secret Sharing
2015/12/21
A linear near-threshold secret sharing scheme with both linear time sharing and reconstruction
algorithms and large secrets (i.e. secrets of size Ω(n)). Thus, the computational overhead per
sh...
Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
Circuit-SAT linear error-correcting codes non-interactive zero knowledge polynomial algebra
2013/4/18
Recently, Gennaro, Gentry, Parno and Raykova~\cite{eprint2012:GennaroGPR} proposed an efficient non-interactive zero knowledge argument for Circuit-SAT, based on non-standard notions like conscientiou...
A New Class of Public Key Cryptosystems Constructed Based on Error-Correcting Codes, Using K(III) Scheme
public-key cryptography Public Key Cryptosystem Error-Correcting Code Multivariate PKC Linear PKC McEliece PKC PQC
2010/7/14
In this paper, we present a new scheme referred to as K(III) scheme which would be effective for improving a certain class of PKC's. Using K(III) scheme, we propose a new method for constructing the p...
A New Class of Public Key Cryptosystems Constructed Based on Perfect Error-Correcting Codes Realizing Coding Rate of Exactly 1.0
Public Key Cryptosystem (PKC) Error-Correcting Code Multivariate PKC Linear PKC McEliece PKC
2010/3/16
In this paper, we propose a new method for constructing the public-key cryptosystems based on a class of perfect error-correcting codes. The constructed PKC is referred to as K(IV)SE(1)PKC. In K(IV)SE...
Forgotten Secret Recovering Scheme and Fuzzy Vault Scheme Constructed Based on Systematic Error-Correcting Codes
Forgotten Secret Recovering Scheme Fuzzy Vault Scheme Reed-Solomon code
2009/8/7
In this paper, we revisit the Forgotten Secret Recovering
Scheme for k users, referred to as FSRS(k) previously proposed
by the present author. FSRS(k) takes advantage of the
fact that Reed-Solomon...
On a Relation Between Verifiable Secret Sharing Schemes and a Class of Error-Correcting Codes
Verifiable Secret Sharing Schemes Error-Correcting Codes
2009/4/10
In this paper we try to shed a new insight on Verifiable Secret Sharing
Schemes (VSS). We first define a new “metric” (with slightly different properties
than the standard Hamming metric). Using thi...