Results 21 to 30 of about 19,870 (237)
A Mathematical Perspective on Post-Quantum Cryptography
Mathematics, 2022 In 2016, the National Institute of Standards and Technology (NIST) announced an open competition with the goal of finding and standardizing suitable algorithms for quantum-resistant cryptography.
Maximilian Richter +3 more
doaj +1 more source
MATHEMATICAL MODELS OF HYBRID CRYPTO CODE CONSTRUCTIONS ON DAMAGED CODES
Сучасні інформаційні системи, 2019 The subject are mathematical models of building hybrid (complex) cryptosystems based on Mac-Elis crypto-code constructions on damaged codes. The purpose of this work is cryptographic mechanisms design in post-quantum cryptography to provide basic ...
Serhii Yevseiev +2 more
doaj +1 more source
Single Trace Analysis against HyMES by Exploitation of Joint Distributions of Leakages
Applied Sciences, 2020 Beginning with the proposal of the McEliece cryptosystem in 1978, code-based cryptography has positioned itself as one of main categories in post-quantum cryptography (PQC).
ByeongGyu Park +4 more
doaj +1 more source
Research Status, Challenges, and Future Development of Post-Quantum Cryptography [PDF]
中国工程科学As an important strategic resource for safeguarding national information security and the healthy development of digital economy, cryptography is the cornerstone of protecting the security of critical infrastructure, government affairs data, financial ...
Guizhen Zhu +5 more
doaj +1 more source
TinyIBE: identity-based encryption for heterogeneous sensor networks [PDF]
, 2009 The area of security for heterogeneous sensor networks (HSNs) is still an open research field that requires new cryptographic solutions. Recent results have demonstrated that elliptic curve cryptography (ECC) and pairing-based cryptography (PBC) are ...
Martin Collier +3 more
core +1 more source
Formal Verification of Security Protocol Implementations: A Survey [PDF]
, 2014 Automated formal verification of security protocols has been mostly focused on analyzing high-level abstract models which, however, are significantly different from real protocol implementations written in programming languages.
Pironti, Alfredo +3 more
core +1 more source
Efficient algorithms for pairing-based cryptosystems [PDF]
, 2002 We describe fast new algorithms to implement recent cryptosystems based on the Tate pairing. In particular, our techniques improve pairing evaluation speed by a factor of about 55 compared to previously known methods in characteristic 3, and attain ...
B. Lynn +13 more
core +1 more source
Post-Quantum Two-Party Adaptor Signature Based on Coding Theory
Cryptography, 2022 An adaptor signature can be viewed as a signature concealed with a secret value and, by design, any two of the trio yield the other. In a multiparty setting, an initial adaptor signature allows each party to create additional adaptor signatures without ...
Jean Belo Klamti, M. Anwar Hasan
doaj +1 more source
Efficient One-Time Signatures from Quasi-Cyclic Codes: A Full Treatment
Cryptography, 2018 The design of a practical code-based signature scheme is an open problem in post-quantum cryptography. This paper is the full version of a work appeared at SIN’18 as a short paper, which introduced a simple and efficient one-time secure signature ...
Edoardo Persichetti
doaj +1 more source
Code Based Cryptography and Steganography [PDF]
, 2013 For a long time, coding theory was only concerned by message integrity (how to protect against errors a message sent via some noisely channel). Nowadays, coding theory plays an important role in the area of cryptography and steganography. The aim of this paper is to show how algebraic coding theory offers ways to define secure cryptographic primitives ...
openaire +1 more source