A Riddle Wrapped in an Enigma

  title={A Riddle Wrapped in an Enigma},
  author={Neal Koblitz and Alfred Menezes},
  journal={IEEE Security \& Privacy},
In August 2015, the NSA released a major policy statement on the need for postquantum cryptography (PQC). This announcement will be a great stimulus to the development, standardization, and commercialization of new quantum-safe algorithms. However, certain peculiarities in the statement's wording and timing have given rise to much speculation concerning the NSA, elliptic curve cryptography, and quantum-safe cryptography. In this article, the authors evaluate some of the theories that have been… 
Another Look at Tightness II: Practical Issues in Cryptography
N nontightness in connection with complexity leveraging, HMAC, lattice-based cryptography, identity-based encryption, and hybrid encryption is discussed.
RSA, DH, and DSA in the Wild
  • N. Heninger
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2022
This chapter outlines techniques for breaking cryptography by taking advantage of implementation mistakes made in practice, with a focus on those that exploit the mathematical structure of the most widely used public-key primitives.
Recommendations on the features, advantages and possibilities of using the new cryptographic asymmetric algorithm of end-to-end encryption NTRU Prime IIT Ukraine are made.
Malicious Keccak
  • P. Morawiecki
  • Mathematics, Computer Science
    IACR Cryptol. ePrint Arch.
  • 2015
This paper proposes a malicious variant of the Keccak function, where new round constants are introduced, and shows that for such the variant, collision and preimage attacks are possible.
Key Distribution for Post Quantum Cryptography using Physical Unclonable Functions
The method allows the server to independently validate the public key generated by the PUF, and act as a certificate authority in the network, and allow attackers to make this independent validation when only equipped with less powerful computers.
A Survey of Hardware Implementations of Elliptic Curve Cryptographic Systems
The paper outlines ECC’s vulnerability against quantum attacks and references one possible solution to that problem, and the suitability of the hardware/software approach in regard to the security challenges opposed by the low-end embedded devices of the Internet of Things is briefly examined.
From Pre-Quantum to Post-Quantum IoT Security: A Survey on Quantum-Resistant Cryptosystems for the Internet of Things
A survey on what can be called post-quantum IoT systems (IoT systems protected from the currently known quantum computing attacks): the main post-Quantum cryptosystems and initiatives are reviewed, the most relevant IoT architectures and challenges are analyzed, and the expected future trends are indicated.
Post Quantum Cryptographic Keys Generated with Physical Unclonable Functions
This paper describes practical ways to generate keys from physical unclonable functions, for both lattice and code-based cryptography, and allows the server to independently validate the public key generated by the PUF, and act as a certificate authority in the network.
Improved mathematical model of the post-quantum eletronic signature mechanism
In the paper improved mechanism called POST which can be used in post-quantum period is proposed and tends to avoid the disadvantages as previous ones.
A probabilistic analysis on a lattice attack against DSA
This article revisits the attack on DSA presented by Faugère, Goyet and Renault during the conference SAC 2012 and provides a probabilistic approach in opposition to the heuristic proposed therein to measure the limits of the attack.


Practical Cryptanalysis of SFLASH
A practical attack on the signature scheme SFLASH proposed by Patarin, Goubin and Courtois in 2001 is presented, which can be applied to both SFLashv2 which was accepted by NESSIE, as well as to SFLashingv3 which is a higher security version.
Elliptic Curve Cryptography: The Serpentine Course of a Paradigm Shift
Find Me a Hash
A hash function is an easy-to-compute compression function that takes a variable-length input and converts it to a fixed-length output and is employed in many Internet protocols including SSL/TLS, the transport-layer protocol that enables secure Web transactions, IPsec, and SSH.
Curve25519: New Diffie-Hellman Speed Records
This paper explains the design and implementation of a high-security elliptic-curve-Diffie-Hellman function achieving record-setting speeds: e.g., 832457 Pentium III cycles more than twice as fast as other authors' results at the same conjectured security level.
NTRU: A Ring-Based Public Key Cryptosystem
NTRU encryption and decryption use a mixing system suggested by polynomial algebra combined with a clustering principle based on elementary probability theory to create a new public key cryptosystem.
A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator
This paper proves that, if three conjectures are true, then the ECRNG is secure, and it is argued that for nonce and key generation this distinguishability is harmless.
Quantum-Safe Hybrid (QSH) Ciphersuite for Transport Layer Security (TLS) version 1.2
This document describes the Quantum-Safe Hybrid ciphersuite, a new cipher suite providing modular design for quantum-safe cryptography to be adopted in the handshake for the Transport Layer Security
Progress in Cryptology – AFRICACRYPT 2018
This paper shows that a Boolean function f is s-plateaued if and only if the associated Cayley graph is a complete bipartite graph between the support of f and its complement (hence the graph is strongly regular of parameters e = 0, d = 2(n+s−2)/2).
McBits: Fast Constant-Time Code-Based Cryptography
This paper presents extremely fast algorithms for code-based public-key cryptography, including full protection against timing attacks, and achieves a reciprocal decryption throughput of just 60493 cycles on a single Ivy Bridge core.
Reducing elliptic curve logarithms to logarithms in a finite field
The main result of the paper is to demonstrate the reduction of the elliptic curve logarithm problem to the logariths problem in the multiplicative group of an extension of the underlying finite field, thus providing a probabilistic subexponential time algorithm for the former problem.