math/gfreduce.[ch]: Fix out-of-bounds memory access.
[u/mdw/catacomb] / math / f-niceprime.c
CommitLineData
f46efa79 1/* -*-c-*-
2 *
f46efa79 3 * Prime fields with efficient reduction for special-form primes
4 *
5 * (c) 2004 Straylight/Edgeware
6 */
7
45c0fd36 8/*----- Licensing notice --------------------------------------------------*
f46efa79 9 *
10 * This file is part of Catacomb.
11 *
12 * Catacomb is free software; you can redistribute it and/or modify
13 * it under the terms of the GNU Library General Public License as
14 * published by the Free Software Foundation; either version 2 of the
15 * License, or (at your option) any later version.
45c0fd36 16 *
f46efa79 17 * Catacomb is distributed in the hope that it will be useful,
18 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 * GNU Library General Public License for more details.
45c0fd36 21 *
f46efa79 22 * You should have received a copy of the GNU Library General Public
23 * License along with Catacomb; if not, write to the Free
24 * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
25 * MA 02111-1307, USA.
26 */
27
f46efa79 28/*----- Header files ------------------------------------------------------*/
29
30#include <mLib/sub.h>
31
32#include "field.h"
f94b972d 33#include "field-guts.h"
f46efa79 34#include "mprand.h"
35
4edc47b8 36/*----- Main code ---------------------------------------------------------*/
f46efa79 37
f46efa79 38/* --- Field operations --- */
39
f94b972d 40static void fdestroy(field *ff) {
41 fctx_niceprime *f = (fctx_niceprime *)ff;
42 mpreduce_destroy(&f->r);
43 DESTROY(f);
44}
f46efa79 45
f94b972d 46static mp *frand(field *ff, mp *d, grand *r) {
47 fctx_niceprime *f = (fctx_niceprime *)ff;
48 return (mprand_range(d, f->r.p, r, 0));
49}
f46efa79 50
a69a3efd 51static int fzerop(field *ff, mp *x) { return (MP_ZEROP(x)); }
f46efa79 52
f94b972d 53static mp *fneg(field *ff, mp *d, mp *x) {
54 fctx_niceprime *f = (fctx_niceprime *)ff;
55 return (mp_sub(d, f->r.p, x));
56}
f46efa79 57
4edc47b8 58static mp *fadd(field *ff, mp *d, mp *x, mp *y) {
f94b972d 59 fctx_niceprime *f = (fctx_niceprime *)ff; d = mp_add(d, x, y);
a69a3efd 60 if (MP_NEGP(d)) d = mp_add(d, d, f->r.p);
4edc47b8 61 else if (MP_CMP(d, >, f->r.p)) d = mp_sub(d, d, f->r.p);
f46efa79 62 return (d);
63}
64
4edc47b8 65static mp *fsub(field *ff, mp *d, mp *x, mp *y) {
f94b972d 66 fctx_niceprime *f = (fctx_niceprime *)ff; d = mp_sub(d, x, y);
a69a3efd 67 if (MP_NEGP(d)) d = mp_add(d, d, f->r.p);
4edc47b8 68 else if (MP_CMP(d, >, f->r.p)) d = mp_sub(d, d, f->r.p);
f46efa79 69 return (d);
70}
71
4edc47b8 72static mp *fmul(field *ff, mp *d, mp *x, mp *y) {
f94b972d 73 fctx_niceprime *f = (fctx_niceprime *)ff; d = mp_mul(d, x, y);
f46efa79 74 return (mpreduce_do(&f->r, d, d));
75}
76
4edc47b8 77static mp *fsqr(field *ff, mp *d, mp *x) {
f94b972d 78 fctx_niceprime *f = (fctx_niceprime *)ff; d = mp_sqr(d, x);
f46efa79 79 return (mpreduce_do(&f->r, d, d));
80}
81
f94b972d 82static mp *finv(field *ff, mp *d, mp *x) {
83 fctx_niceprime *f = (fctx_niceprime *)ff;
84 d = mp_modinv(d, x, f->r.p);
85 return (d);
86}
f46efa79 87
f94b972d 88static mp *freduce(field *ff, mp *d, mp *x) {
89 fctx_niceprime *f = (fctx_niceprime *)ff;
90 return (mpreduce_do(&f->r, d, x));
91}
f46efa79 92
f94b972d 93static mp *fsqrt(field *ff, mp *d, mp *x) {
94 fctx_niceprime *f = (fctx_niceprime *)ff;
95 return (mp_modsqrt(d, x, f->r.p));
96}
f46efa79 97
4edc47b8 98static mp *fdbl(field *ff, mp *d, mp *x) {
f94b972d 99 fctx_niceprime *f = (fctx_niceprime *)ff; d = mp_lsl(d, x, 1);
d2f1ffa0 100 if (MP_CMP(d, >=, f->r.p)) d = mp_sub(d, d, f->r.p);
f46efa79 101 return (d);
102}
103
4edc47b8 104static mp *ftpl(field *ff, mp *d, mp *x) {
f94b972d 105 fctx_niceprime *f = (fctx_niceprime *)ff; MP_DEST(d, MP_LEN(x) + 1, x->f);
d2f1ffa0 106 MPX_UMULN(d->v, d->vl, x->v, x->vl, 3); d->f &= ~MP_UNDEF;
107 while (MP_CMP(d, >=, f->r.p)) d = mp_sub(d, d, f->r.p);
f46efa79 108 return (d);
109}
110
4edc47b8 111static mp *fqdl(field *ff, mp *d, mp *x) {
f94b972d 112 fctx_niceprime *f = (fctx_niceprime *)ff; d = mp_lsl(d, x, 2);
d2f1ffa0 113 while (MP_CMP(d, >=, f->r.p)) d = mp_sub(d, d, f->r.p);
f46efa79 114 return (d);
115}
116
4edc47b8 117static mp *fhlv(field *ff, mp *d, mp *x) {
f94b972d 118 fctx_niceprime *f = (fctx_niceprime *)ff;
a69a3efd 119 if (MP_ZEROP(x)) { MP_COPY(x); MP_DROP(d); return (x); }
4edc47b8 120 if (x->v[0] & 1) { d = mp_add(d, x, f->r.p); x = d; }
f46efa79 121 return (mp_lsr(d, x, 1));
122}
123
124/* --- Field operations table --- */
125
4e66da02 126static const field_ops fops = {
f46efa79 127 FTY_PRIME, "niceprime",
34e4f738 128 fdestroy, frand, field_stdsamep,
f46efa79 129 freduce, field_id,
130 fzerop, fneg, fadd, fsub, fmul, fsqr, finv, freduce, fsqrt,
131 0,
132 fdbl, ftpl, fqdl, fhlv
133};
134
135/* --- @field_niceprime@ --- *
136 *
137 * Arguments: @mp *p@ = the characteristic of the field
138 *
f4535c64 139 * Returns: A pointer to the field, or null.
f46efa79 140 *
141 * Use: Creates a field structure for a prime field of size %$p$%,
142 * using efficient reduction for nice primes.
143 */
144
145field *field_niceprime(mp *p)
146{
f94b972d 147 fctx_niceprime *f = CREATE(fctx_niceprime);
f46efa79 148 f->f.ops = &fops;
149 f->f.zero = MP_ZERO;
150 f->f.one = MP_ONE;
432c4e18 151 f->f.nbits = mp_bits(p);
152 f->f.noctets = (f->f.nbits + 7) >> 3;
f4535c64 153 if (mpreduce_create(&f->r, p)) {
154 DESTROY(f);
155 return (0);
156 }
432c4e18 157 f->f.m = f->r.p;
d2f1ffa0 158 f->f.q = f->r.p;
f46efa79 159 return (&f->f);
160}
161
162/*----- That's all, folks -------------------------------------------------*/