26 May 2016
Bulletproof TLS Newsletter is a free periodic newsletter bringing you commentary and news surrounding SSL/TLS and Internet PKI, designed to keep you informed about the latest developments in this space. Maintained by Hanno Böck.
Modern TLS applications today frequently use AES and the Galois/Counter-Mode (GCM) as their symmetric encryption mode. GCM uses a 12 byte initialization vector (IV), in which eight bytes have to be set by the implementation and are required to be a nonce. It is absolutely crucial for the security of GCM that an implementation never reuses the same nonce with the same key.
The author of this Newsletter (Hanno Böck) discovered that there are real-world implementations that repeat the nonce value, which makes them insecure. Even though the number of affected hosts is low (184 HTTPS servers), there are some notable users of vulnerable servers, including the credit card company Visa.
Some of the affected devices came from Radware and the company subsequently published security updates. Other devices could not be identified, so it must be assumed that vulnerable implementations still exist.
Repeating a nonce means that an attacker can learn the authentication key and use it to inject malicious content into HTTPS web pages.
Furthermore, the research identified 70,000 hosts which use a random nonce value. This is risky — if the same encryption key is used to encrypt a large number of connections (around 2^32), then a repeating nonce becomes likely. Devices from A10 and IBM Lotus Domino are affected by this and have published security updates.
The possibility of nonce reuse vulnerabilities has led to discussions about cipher modes that use a synthetic IV (SIV).
Padding Oracles have long been an issue for CBC-based cipher suites in TLS. The latest security update of OpenSSL fixes another variant of these attacks. Padding Oracle attacks rely on the fact that an attacker can learn information about a ciphertext based on different errors that happen on the recipient side of an encrypted message.
Juraj Somorovsky discovered a new variant of a padding oracle in OpenSSL. OpenSSL did not properly check the length of encrypted TLS records and whether they are long enough to hold the HMAC authentication tag and the padding bytes. Somorovsky discovered this vulnerability with his tool TLS-Attacker. The bug was introduced with the fix for another padding oracle, the Lucky Thirteen attack. Somorovsky also found a very similar bug in MatrixSSL.
Cloudflare developer Filippo Valsorda wrote a detailed explanation of the OpenSSL vulnerability and published an online test for it.
The OpenSSL updates fix another severe security vulnerability in the ASN.1 parser code. Several independent bugs can be used together to cause a memory corruption.
The switch to a fully encrypted web seems to have taken up some speed lately. Google announced that all Blogspot-hosted sites are now available over HTTPS and users can set an option that will forward all HTTP traffic to HTTPS. The link shortening service Bit.ly also announced full HTTPS support. Customer-branded domains will automatically get Let’s Encrypt certificates in the future.
Joining the HTTPS move, the cloud platform Heroku also announced free HTTPS support. Heroku will use SNI, a TLS feature that allows multiple different certificates on one IP address, for their HTTPS service. It is widely supported in modern browsers, but Windows XP and some old Android versions don’t support this extension.
Switching to HTTPS has been notoriously difficult for news web sites. The main culprits are third party content and advertising. Many ad networks don’t deliver their ads over HTTPS and it is not possible to include active unencrypted HTTP content on an HTTPS web page. Wired is working on transitioning their web site to HTTPS. The main web page is still delivered over unencrypted HTTP, but the security news section is HTTPS. Ars Technica author Cyrus Farivar said that their web site will also switch to HTTPS soon.
The BoringSSL developers are experimenting with a key exchange algorithm that may be resistant against attacks with quantum computers. David Benjamin committed code for a combination of the elliptic curve key exchange X25519 and the New Hope algorithm. The latter is based on the Ring-Learning-With-Errors problem.
Microsoft researchers published an optimized version of the SIDH key exchange (code, paper). This experimental encryption algorithm is based on supersingular isogenies in elliptic curves. SIDH is also a candidate for post quantum cryptography.
While the development of post-quantum cryptography gains speed, many cryptographers were unhappy with the EU commission publishing a “Quantum Manifesto”. In this manifesto the EU announces a big research program towards several Quantum technologies. Post-quantum cryptography isn’t mentioned in the manifesto at all. On the other hand it makes questionable promises about future quantum communication networks and even a Quantum Internet based on Quantum key distribution algorithms. Daniel Bernstein published a lengthy critique and the author of this Newsletter (Hanno Böck) wrote a critical comment on Golem.de (in German).
This subscription is just for the newsletter; we won't send you anything else.
Designed by Ivan Ristić, the author of SSL Labs, Bulletproof SSL and TLS, and Hardenize, our course covers everything you need to know to deploy secure servers and encrypted web applications.
Remote and trainer-led, with small classes and a choice of timezones.
Join over 1,500 students who have benefited from more than a decade of deep TLS and PKI expertise.