Cisco and ISARA Collaborate on a Proof of Concept of the World’s First Digital Certificate Compatible with Both Classic and Quantum-Safe Cryptographic Algorithms : Hash-Based Signatures

Cisco Systems and ISARA Corp., the leading provider of security solutions for the quantum computing age, today announced the world’s first collaboration to test digital certificates that operate in both classic and quantum-safe algorithm modes.

Continue Reading

The ISARA Radiate™ Security Solution Suite 1.4 includes a complete set of stateful hash-based signature options and their implementation on a Hardware Security Module (HSM).

Continue Reading

With the latest release of the ISARA Radiate™ Security Solution Suite, we’ve added stafeful hash-based signatures, specifically eXtended Merkle Signature Scheme (XMSS), to the cryptographic library. With this addition, we now offer complete stateful hash-based signature algorithm support.  Also, using a unique optimization approach, we’ve successfully overcome the recognized challenges associated with implementing stateful hash-based signatures to create an HSM-based implementation successfully tested with Utimaco Inc.’s SecrutyServer.

Continue Reading

Digital signatures constructed solely from hash functions offer competitive signature sizes and fast signing and verifying times. Moreover, the security of hash functions against a quantum adversary is believed to be well understood. This means that hash-based signatures are strong candidates for standard use in a post-quantum world. The Leighton-Micali signature scheme (LMS) is one such scheme being considered for standardization. However all systematic analyses of LMS have only considered a classical adversary. In this work we close this gap by showing a proof of the security of LMS in the quantum random-oracle model. Our results match the bounds imposed by Grover’s search algorithm within a constant factor, and remain tight in the multi-user setting.

Continue Reading

ISARA provides a “high-quality implementation of quantum resistant algorithms and related integration tools,” to allow existing companies to achieve crypto-agility and remain secure and competitive in today’s market. Scott Totzke, CEO & Co-Founder of ISARA Corporation, further explains the need for such integration as the quantum age approaches: “As businesses and governments around the world […]

Continue Reading

We study a scheme of Bai and Galbraith (CT-RSA’14), also known as TESLA. TESLA was thought to have a tight security reduction from the learning with errors problem (LWE) in the random oracle model (ROM). Moreover, a variant using chameleon hash functions was lifted to the quantum random oracle model (QROM). However, both reductions were later found to be flawed and hence it remained unresolved until now whether TESLA can be proven to be tightly secure in the (Q)ROM. In the present paper, we provide an entirely new, tight security reduction for TESLA from LWE in the QROM (and thus in the ROM). Our security reduction involves the adaptive re-programming of a quantum oracle. Furthermore, we propose parameter sets targeting 128 bits of security against both classical and quantum adversaries and compare TESLA’s performance with state-of-the-art signature schemes.

Continue Reading