Projects
Mega:23.09
libtommath
Sign Up
Log In
Username
Password
Overview
Repositories
Revisions
Requests
Users
Attributes
Meta
Expand all
Collapse all
Changes of Revision 3
View file
_service:tar_scm:libtommath.spec
Changed
@@ -1,14 +1,12 @@ Name: libtommath -Version: 1.2.0 -Release: 4 +Version: 1.2.1 +Release: 1 Summary: A portable number theoretic multiple-precision integer library. License: Public Domain URL: http://www.libtom.net/ Source0: https://github.com/libtom/%{name}/archive/v%{version}.tar.gz#/%{name}-%{version}.tar.gz -Patch0: backport-CVE-2023-36328-Fix-possible-integer-overflow.patch - BuildRequires: ghostscript libtiff-tools libtool texlive-dvips-bin ghostscript-tools-dvipdf BuildRequires: texlive-latex-bin-bin texlive-makeindex-bin texlive-mfware-bin TeXamator BuildRequires: tex(cmr10.tfm) tex(fancyhdr.sty) tex(hyphen.tex) texlive-metafont-bin @@ -75,6 +73,9 @@ %doc doc/bn.pdf %changelog +* Fri Dec 15 2023 fuanan <fuanan3@h-partners.com> - 1.2.1-1 +- update version to 1.2.1 + * Mon Sep 04 2023 fuanan <fuanan3@h-partners.com> - 1.2.0-4 - Fix CVE-2023-36328
View file
_service:tar_scm:backport-CVE-2023-36328-Fix-possible-integer-overflow.patch
Deleted
@@ -1,140 +0,0 @@ -From beba892bc0d4e4ded4d667ab1d2a94f4d75109a9 Mon Sep 17 00:00:00 2001 -From: czurnieden <czurnieden@gmx.de> -Date: Tue, 9 May 2023 17:17:12 +0200 -Subject: PATCH Fix possible integer overflow - ---- - bn_mp_2expt.c | 4 ++++ - bn_mp_grow.c | 4 ++++ - bn_mp_init_size.c | 5 +++++ - bn_mp_mul_2d.c | 4 ++++ - bn_s_mp_mul_digs.c | 4 ++++ - bn_s_mp_mul_digs_fast.c | 4 ++++ - bn_s_mp_mul_high_digs.c | 4 ++++ - bn_s_mp_mul_high_digs_fast.c | 4 ++++ - 8 files changed, 33 insertions(+) - -diff --git a/bn_mp_2expt.c b/bn_mp_2expt.c -index 0ae3df1..23de0c3 100644 ---- a/bn_mp_2expt.c -+++ b/bn_mp_2expt.c -@@ -12,6 +12,10 @@ mp_err mp_2expt(mp_int *a, int b) - { - mp_err err; - -+ if (b < 0) { -+ return MP_VAL; -+ } -+ - /* zero a as per default */ - mp_zero(a); - -diff --git a/bn_mp_grow.c b/bn_mp_grow.c -index 9e904c5..2b16826 100644 ---- a/bn_mp_grow.c -+++ b/bn_mp_grow.c -@@ -9,6 +9,10 @@ mp_err mp_grow(mp_int *a, int size) - int i; - mp_digit *tmp; - -+ if (size < 0) { -+ return MP_VAL; -+ } -+ - /* if the alloc size is smaller alloc more ram */ - if (a->alloc < size) { - /* reallocate the array a->dp -diff --git a/bn_mp_init_size.c b/bn_mp_init_size.c -index d622687..9957383 100644 ---- a/bn_mp_init_size.c -+++ b/bn_mp_init_size.c -@@ -6,6 +6,11 @@ - /* init an mp_init for a given size */ - mp_err mp_init_size(mp_int *a, int size) - { -+ -+ if (size < 0) { -+ return MP_VAL; -+ } -+ - size = MP_MAX(MP_MIN_PREC, size); - - /* alloc mem */ -diff --git a/bn_mp_mul_2d.c b/bn_mp_mul_2d.c -index 87354de..bfeaf2e 100644 ---- a/bn_mp_mul_2d.c -+++ b/bn_mp_mul_2d.c -@@ -9,6 +9,10 @@ mp_err mp_mul_2d(const mp_int *a, int b, mp_int *c) - mp_digit d; - mp_err err; - -+ if (b < 0) { -+ return MP_VAL; -+ } -+ - /* copy */ - if (a != c) { - if ((err = mp_copy(a, c)) != MP_OKAY) { -diff --git a/bn_s_mp_mul_digs.c b/bn_s_mp_mul_digs.c -index 64509d4..3682b49 100644 ---- a/bn_s_mp_mul_digs.c -+++ b/bn_s_mp_mul_digs.c -@@ -16,6 +16,10 @@ mp_err s_mp_mul_digs(const mp_int *a, const mp_int *b, mp_int *c, int digs) - mp_word r; - mp_digit tmpx, *tmpt, *tmpy; - -+ if (digs < 0) { -+ return MP_VAL; -+ } -+ - /* can we use the fast multiplier? */ - if ((digs < MP_WARRAY) && - (MP_MIN(a->used, b->used) < MP_MAXFAST)) { -diff --git a/bn_s_mp_mul_digs_fast.c b/bn_s_mp_mul_digs_fast.c -index b2a287b..3c4176a 100644 ---- a/bn_s_mp_mul_digs_fast.c -+++ b/bn_s_mp_mul_digs_fast.c -@@ -26,6 +26,10 @@ mp_err s_mp_mul_digs_fast(const mp_int *a, const mp_int *b, mp_int *c, int digs) - mp_digit WMP_WARRAY; - mp_word _W; - -+ if (digs < 0) { -+ return MP_VAL; -+ } -+ - /* grow the destination as required */ - if (c->alloc < digs) { - if ((err = mp_grow(c, digs)) != MP_OKAY) { -diff --git a/bn_s_mp_mul_high_digs.c b/bn_s_mp_mul_high_digs.c -index 2bb2a50..c9dd355 100644 ---- a/bn_s_mp_mul_high_digs.c -+++ b/bn_s_mp_mul_high_digs.c -@@ -15,6 +15,10 @@ mp_err s_mp_mul_high_digs(const mp_int *a, const mp_int *b, mp_int *c, int digs) - mp_word r; - mp_digit tmpx, *tmpt, *tmpy; - -+ if (digs < 0) { -+ return MP_VAL; -+ } -+ - /* can we use the fast multiplier? */ - if (MP_HAS(S_MP_MUL_HIGH_DIGS_FAST) - && ((a->used + b->used + 1) < MP_WARRAY) -diff --git a/bn_s_mp_mul_high_digs_fast.c b/bn_s_mp_mul_high_digs_fast.c -index a2c4fb6..4ce7f59 100644 ---- a/bn_s_mp_mul_high_digs_fast.c -+++ b/bn_s_mp_mul_high_digs_fast.c -@@ -19,6 +19,10 @@ mp_err s_mp_mul_high_digs_fast(const mp_int *a, const mp_int *b, mp_int *c, int - mp_digit WMP_WARRAY; - mp_word _W; - -+ if (digs < 0) { -+ return MP_VAL; -+ } -+ - /* grow the destination as required */ - pa = a->used + b->used; - if (c->alloc < pa) { --- -2.27.0 -
View file
_service
Changed
@@ -2,7 +2,7 @@ <service name="tar_scm"> <param name="url">git@gitee.com:src-openeuler/libtommath.git</param> <param name="scm">git</param> - <param name="revision">openEuler-23.09</param> + <param name="revision">master</param> <param name="exclude">*</param> <param name="extract">*</param> </service>
View file
_service:tar_scm:libtommath-1.2.0.tar.gz/appveyor.yml -> _service:tar_scm:libtommath-1.2.1.tar.gz/appveyor.yml
Changed
@@ -1,4 +1,4 @@ -version: 1.2.0-{build} +version: 1.2.1-{build} branches: only: - master
View file
_service:tar_scm:libtommath-1.2.0.tar.gz/bn_mp_2expt.c -> _service:tar_scm:libtommath-1.2.1.tar.gz/bn_mp_2expt.c
Changed
@@ -12,6 +12,10 @@ { mp_err err; + if (b < 0) { + return MP_VAL; + } + /* zero a as per default */ mp_zero(a);
View file
_service:tar_scm:libtommath-1.2.0.tar.gz/bn_mp_grow.c -> _service:tar_scm:libtommath-1.2.1.tar.gz/bn_mp_grow.c
Changed
@@ -9,6 +9,10 @@ int i; mp_digit *tmp; + if (size < 0) { + return MP_VAL; + } + /* if the alloc size is smaller alloc more ram */ if (a->alloc < size) { /* reallocate the array a->dp
View file
_service:tar_scm:libtommath-1.2.0.tar.gz/bn_mp_init_size.c -> _service:tar_scm:libtommath-1.2.1.tar.gz/bn_mp_init_size.c
Changed
@@ -6,6 +6,11 @@ /* init an mp_init for a given size */ mp_err mp_init_size(mp_int *a, int size) { + + if (size < 0) { + return MP_VAL; + } + size = MP_MAX(MP_MIN_PREC, size); /* alloc mem */
View file
_service:tar_scm:libtommath-1.2.0.tar.gz/bn_mp_mul_2d.c -> _service:tar_scm:libtommath-1.2.1.tar.gz/bn_mp_mul_2d.c
Changed
@@ -9,6 +9,10 @@ mp_digit d; mp_err err; + if (b < 0) { + return MP_VAL; + } + /* copy */ if (a != c) { if ((err = mp_copy(a, c)) != MP_OKAY) {
View file
_service:tar_scm:libtommath-1.2.0.tar.gz/bn_s_mp_mul_digs.c -> _service:tar_scm:libtommath-1.2.1.tar.gz/bn_s_mp_mul_digs.c
Changed
@@ -16,6 +16,10 @@ mp_word r; mp_digit tmpx, *tmpt, *tmpy; + if (digs < 0) { + return MP_VAL; + } + /* can we use the fast multiplier? */ if ((digs < MP_WARRAY) && (MP_MIN(a->used, b->used) < MP_MAXFAST)) {
View file
_service:tar_scm:libtommath-1.2.0.tar.gz/bn_s_mp_mul_digs_fast.c -> _service:tar_scm:libtommath-1.2.1.tar.gz/bn_s_mp_mul_digs_fast.c
Changed
@@ -26,6 +26,10 @@ mp_digit WMP_WARRAY; mp_word _W; + if (digs < 0) { + return MP_VAL; + } + /* grow the destination as required */ if (c->alloc < digs) { if ((err = mp_grow(c, digs)) != MP_OKAY) {
View file
_service:tar_scm:libtommath-1.2.0.tar.gz/bn_s_mp_mul_high_digs.c -> _service:tar_scm:libtommath-1.2.1.tar.gz/bn_s_mp_mul_high_digs.c
Changed
@@ -15,6 +15,10 @@ mp_word r; mp_digit tmpx, *tmpt, *tmpy; + if (digs < 0) { + return MP_VAL; + } + /* can we use the fast multiplier? */ if (MP_HAS(S_MP_MUL_HIGH_DIGS_FAST) && ((a->used + b->used + 1) < MP_WARRAY)
View file
_service:tar_scm:libtommath-1.2.0.tar.gz/bn_s_mp_mul_high_digs_fast.c -> _service:tar_scm:libtommath-1.2.1.tar.gz/bn_s_mp_mul_high_digs_fast.c
Changed
@@ -19,6 +19,10 @@ mp_digit WMP_WARRAY; mp_word _W; + if (digs < 0) { + return MP_VAL; + } + /* grow the destination as required */ pa = a->used + b->used; if (c->alloc < pa) {
View file
_service:tar_scm:libtommath-1.2.0.tar.gz/changes.txt -> _service:tar_scm:libtommath-1.2.1.tar.gz/changes.txt
Changed
@@ -1,4 +1,9 @@ -XXX XXth, 2019 +Sep 04th, 2023 +v1.2.1 + -- Bugfix release because of potential integer overflow + c.f. PR #546 resp. CVE-2023-36328 + +Oct 22nd, 2019 v1.2.0 -- A huge refactoring of the library happened - renaming, deprecating and replacing existing functions by improved API's.
View file
_service:tar_scm:libtommath-1.2.0.tar.gz/doc/bn.tex -> _service:tar_scm:libtommath-1.2.1.tar.gz/doc/bn.tex
Changed
@@ -50,7 +50,7 @@ \begin{document} \frontmatter \pagestyle{empty} -\title{LibTomMath User Manual \\ v1.2.0} +\title{LibTomMath User Manual \\ v1.2.1} \author{LibTom Projects \\ www.libtom.net} \maketitle This text, the library and the accompanying textbook are all hereby placed in the public domain. This book has been
View file
_service:tar_scm:libtommath-1.2.0.tar.gz/makefile.unix -> _service:tar_scm:libtommath-1.2.1.tar.gz/makefile.unix
Changed
@@ -21,7 +21,7 @@ CFLAGS = -O2 LDFLAGS = -VERSION = 1.2.0 +VERSION = 1.2.1 #Compilation flags LTM_CFLAGS = -I. $(CFLAGS)
View file
_service:tar_scm:libtommath-1.2.0.tar.gz/makefile_include.mk -> _service:tar_scm:libtommath-1.2.1.tar.gz/makefile_include.mk
Changed
@@ -3,9 +3,9 @@ # #version of library -VERSION=1.2.0 -VERSION_PC=1.2.0 -VERSION_SO=3:0:2 +VERSION=1.2.1 +VERSION_PC=1.2.1 +VERSION_SO=3:1:2 PLATFORM := $(shell uname | sed -e 's/_.*//')
Locations
Projects
Search
Status Monitor
Help
Open Build Service
OBS Manuals
API Documentation
OBS Portal
Reporting a Bug
Contact
Mailing List
Forums
Chat (IRC)
Twitter
Open Build Service (OBS)
is an
openSUSE project
.
浙ICP备2022010568号-2