Quantum resistant public key cryptography: a survey
RA Perlner, DA Cooper - Proceedings of the 8th Symposium on Identity …, 2009 - dl.acm.org
Public key cryptography is widely used to secure transactions over the Internet. However,
advances in quantum computers threaten to undermine the security assumptions upon …
advances in quantum computers threaten to undermine the security assumptions upon …
Hash based digital signature schemes
We discuss various issues associated with signature schemes based solely upon hash
functions. Such schemes are currently attractive in some limited applications, but their …
functions. Such schemes are currently attractive in some limited applications, but their …
Exploiting coding theory for collision attacks on SHA-1
N Pramstaller, C Rechberger, V Rijmen - IMA International Conference on …, 2005 - Springer
In this article we show that coding theory can be exploited efficiently for the cryptanalysis of
hash functions. We will mainly focus on SHA-1. We present different linear codes that are …
hash functions. We will mainly focus on SHA-1. We present different linear codes that are …
Novel one time Signatures (NOTS): A compact post-quantum digital signature scheme
The future of the hash based digital signature schemes appears to be very bright in the
upcoming quantum era because of the quantum threats to the number theory based digital …
upcoming quantum era because of the quantum threats to the number theory based digital …
Post-quantum message authentication cryptography based on error-correcting codes
Y Gorbenko, I Svatovskiy… - 2016 Third International …, 2016 - ieeexplore.ieee.org
In this paper we analyse possibilities of application of post-quantum code based signature
schemes for message authentication purposes. An error-correcting code based digital …
schemes for message authentication purposes. An error-correcting code based digital …
Physical turing machines and the formalization of physical cryptography
U Rührmair - Cryptology ePrint Archive, 2011 - eprint.iacr.org
Physical Turing Machines and the Formalization of Physical Cryptography Page 1 Physical
Turing Machines and the Formalization of Physical Cryptography Ulrich Rührmair Technische …
Turing Machines and the Formalization of Physical Cryptography Ulrich Rührmair Technische …
Practical lattice basis sampling reduction
C Ludwig - 2005 - tuprints.ulb.tu-darmstadt.de
In 2003, Schnorr presented a novel lattice basis reduction method named Random
Sampling Reduction (RSR). He concluded that RSR improves the shortest vector …
Sampling Reduction (RSR). He concluded that RSR improves the shortest vector …
[PDF][PDF] A fuzzy commitment scheme with McEliece's cipher.
DB Ojha, A Sharma - Surveys in Mathematics and its Applications, 2010 - eudml.org
\quad In this paper an attempt has been made to explain a fuzzy commitment scheme with
McEliece scheme.\quad The efficiency and security of this cryptosystem is comparatively …
McEliece scheme.\quad The efficiency and security of this cryptosystem is comparatively …
[PDF][PDF] An Authenticated Transmission of Medical Image with Codebase Cryptosystem over Noisy Channel
----------------------------------------------------------------------ABSTRACT----------------------------------------
----------------------In this paper attempt has been made to explain an authentic transmission …
----------------------In this paper attempt has been made to explain an authentic transmission …
[PDF][PDF] 'Code-based sequential aggregate signature scheme
This paper proposes the first code-based quantum immune sequential aggregate signature
(SAS) scheme and proves the security of the proposed scheme in the random oracle model …
(SAS) scheme and proves the security of the proposed scheme in the random oracle model …