Linux Security
Linux Security
Linux Security

Debian: DSA-3565-1: botan1.10 security update

Date 02 May 2016
147
Posted By LinuxSecurity Advisories
Several security vulnerabilities were found in botan1.10, a C++ library which provides support for many common cryptographic operations, including encryption, authentication, X.509v3 certificates and CRLs.

- -------------------------------------------------------------------------
Debian Security Advisory DSA-3565-1                   This email address is being protected from spambots. You need JavaScript enabled to view it.
https://www.debian.org/security/                       Sebastien Delafond
May 02, 2016                          https://www.debian.org/security/faq
- -------------------------------------------------------------------------

Package        : botan1.10
CVE ID         : CVE-2015-5726 CVE-2015-5727 CVE-2015-7827 CVE-2016-2194 
                 CVE-2016-2195 CVE-2016-2849
Debian Bug     : 817932 822698

Several security vulnerabilities were found in botan1.10, a C++
library which provides support for many common cryptographic
operations, including encryption, authentication, X.509v3 certificates
and CRLs.

CVE-2015-5726
    The BER decoder would crash due to reading from offset 0 of an
    empty vector if it encountered a BIT STRING which did not contain
    any data at all. This can be used to easily crash applications
    reading untrusted ASN.1 data, but does not seem exploitable for
    code execution.

CVE-2015-5727
    The BER decoder would allocate a fairly arbitrary amount of memory
    in a length field, even if there was no chance the read request
    would succeed. This might cause the process to run out of memory or
    invoke the OOM killer.

CVE-2015-7827
    Use constant time PKCS #1 unpadding to avoid possible side channel
    attack against RSA decryption

CVE-2016-2194
    Infinite loop in modular square root algorithm.
    The ressol function implementing the Tonelli-Shanks algorithm for
    finding square roots could be sent into a nearly infinite loop due
    to a misplaced conditional check. This could occur if a composite
    modulus is provided, as this algorithm is only defined for primes.
    This function is exposed to attacker controlled input via the
    OS2ECP function during ECC point decompression.

CVE-2016-2195
    Fix Heap overflow on invalid ECC point.

CVE-2016-2849
    Use constant time modular inverse algorithm to avoid possible
    side channel attack against ECDSA.

For the stable distribution (jessie), these problems have been fixed in
version 1.10.8-2+deb8u1.

We recommend that you upgrade your botan1.10 packages.

Further information about Debian Security Advisories, how to apply
these updates to your system and frequently asked questions can be
found at: https://www.debian.org/security/

Mailing list: This email address is being protected from spambots. You need JavaScript enabled to view it.

Advisories

LinuxSecurity Poll

How frequently do you patch/update your system?

No answer selected. Please try again.
Please select either existing option or enter your own, however not both.
Please select minimum 0 answer(s) and maximum 3 answer(s).
/main-polls/52-how-frequently-do-you-patch-update-your-system?task=poll.vote&format=json
52
radio
[{"id":"179","title":"As soon as patches\/updates are released - I track advisories for my distro(s) diligently","votes":"47","type":"x","order":"1","pct":79.66,"resources":[]},{"id":"180","title":"Every so often, when I think of it","votes":"7","type":"x","order":"2","pct":11.86,"resources":[]},{"id":"181","title":"Hardly ever","votes":"5","type":"x","order":"3","pct":8.47,"resources":[]}] ["#ff5b00","#4ac0f2","#b80028","#eef66c","#60bb22","#b96a9a","#62c2cc"] ["rgba(255,91,0,0.7)","rgba(74,192,242,0.7)","rgba(184,0,40,0.7)","rgba(238,246,108,0.7)","rgba(96,187,34,0.7)","rgba(185,106,154,0.7)","rgba(98,194,204,0.7)"] 350

Please vote first in order to view vote results.

VOTE ON THE POLL PAGE


VIEW MORE POLLS

bottom 200

Please enable / Bitte aktiviere JavaScript!
Veuillez activer / Por favor activa el Javascript![ ? ]

We use cookies to provide and improve our services. By using our site, you consent to our Cookie Policy.