A Riddle Wrapped in an Enigma

@article{Koblitz2016ARW,
  title={A Riddle Wrapped in an Enigma},
  author={Neal Koblitz and Alfred Menezes},
  journal={IEEE Security \& Privacy},
  year={2016},
  volume={14},
  pages={34-42}
}
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

TLDR
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
TLDR
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.

Strumok keystream generator

This work presents the main results of development of a new keystream generator, which is named “Strumok”, and offered as a candidate for the national symmetric encryption standard of Ukraine.

004.056.55 NTRU PRIME IIT UKRAINE ENCRYPTION ALGORITHM WITH CONSIDERATION KNOWN ATTACKS

TLDR
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
TLDR
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.

The Impact of Quantum Computing on Present Cryptography

The aim of this paper is to elucidate the implications of quantum computing in present cryptography and to introduce the reader to basic post-quantum algorithms. In particular the reader can delve

Key Distribution for Post Quantum Cryptography using Physical Unclonable Functions

TLDR
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

TLDR
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

TLDR
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

TLDR
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.

References

SHOWING 1-10 OF 86 REFERENCES

Practical Cryptanalysis of SFLASH

TLDR
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

TLDR
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

TLDR
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

TLDR
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

TLDR
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

Post-quantum cryptography

TLDR
The central challenge in post-quantum cryptography is to meet demands for cryptographic usability and flexibility without sacrificing confidence.

Non-uniform cracks in the concrete: the power of free precomputation

AES-128, the NIST P-256 elliptic curve, DSA-3072, RSA-3072, and various higher-level protocols are frequently conjectured to provide a security level of 2128. Extensive cryptanalysis of these

Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies

TLDR
A new zero-knowledge identification scheme and detailed security proofs for the protocols, and a new, asymptotically faster, algorithm for key generation, a thorough study of its optimization, and new experimental data are presented.
...