1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
|
/*
* Arithmetic for point groups of elliptic curves over GF(p)
*
* (C) 2007 Martin Doering, Christoph Ludwig, Falko Strenzke
* 2008 Jack Lloyd
*
* Distributed under the terms of the Botan license
*/
#include <botan/point_gfp.h>
#include <botan/numthry.h>
namespace Botan {
// construct the point at infinity or a random point
PointGFp::PointGFp(const CurveGFp& curve) :
mC(curve),
mX(curve.get_p(), 0),
mY(curve.get_p(), 1),
mZ(curve.get_p(), 0)
{
}
// construct a point given its jacobian projective coordinates
PointGFp::PointGFp(const CurveGFp& curve, const GFpElement& x,
const GFpElement& y, const GFpElement& z) :
mC(curve),
mX(x),
mY(y),
mZ(z)
{
}
PointGFp::PointGFp(const CurveGFp& curve,
const GFpElement& x,
const GFpElement& y) :
mC(curve),
mX(x),
mY(y),
mZ(curve.get_p(),1)
{
}
// arithmetic operators
PointGFp& PointGFp::operator+=(const PointGFp& rhs)
{
if(is_zero())
{
*this = rhs;
return *this;
}
if(rhs.is_zero())
{
return *this;
}
GFpElement U1 = mX;
GFpElement S1 = mY;
GFpElement rhs_z2 = rhs.mZ * rhs.mZ;
U1 *= rhs_z2;
S1 *= rhs_z2 * rhs.mZ;
GFpElement U2 = rhs.mX;
GFpElement S2 = rhs.mY;
GFpElement lhs_z2 = mZ * mZ;
U2 *= lhs_z2;
S2 *= lhs_z2 * mZ;
GFpElement H(U2 - U1);
GFpElement r(S2 - S1);
if(H.is_zero())
{
if(r.is_zero())
{
mult2_in_place();
return *this;
}
*this = PointGFp(mC); // setting myself to zero
return *this;
}
U2 = H * H;
S2 = U2 * H;
U2 *= U1;
GFpElement x(r*r - S2 - (U2+U2));
GFpElement z(S1 * S2);
GFpElement y(r * (U2-x) - z);
z = (mZ * rhs.mZ) * H;
mX = x;
mY = y;
mZ = z;
return *this;
}
PointGFp& PointGFp::operator-=(const PointGFp& rhs)
{
PointGFp minus_rhs = PointGFp(rhs).negate();
if(is_zero())
{
*this = minus_rhs;
}
else
{
*this += minus_rhs;
}
return *this;
}
PointGFp& PointGFp::operator*=(const BigInt& scalar)
{
// use montgomery mult. in this operation
PointGFp H(this->mC); // create as zero
PointGFp P(*this);
BigInt m(scalar);
if(m < BigInt(0))
{
m = -m;
P.negate();
}
if(P.is_zero() || (m == BigInt(0)))
{
*this = H;
return *this;
}
if(m == BigInt(1)) //*this == P already
return *this;
const int l = m.bits() - 1;
for(int i = l; i >= 0; --i)
{
H.mult2_in_place();
if(m.get_bit(i))
H += P;
}
if(!H.is_zero()) // cannot convert if H == O
*this = H.get_z_to_one();
else
*this = H;
return *this;
}
PointGFp& PointGFp::negate()
{
if(!is_zero())
mY.negate();
return *this;
}
// *this *= 2
PointGFp& PointGFp::mult2_in_place()
{
if(is_zero())
return *this;
else if(mY.is_zero())
{
*this = PointGFp(mC); // setting myself to zero
return *this;
}
GFpElement Y_squared = mY*mY;
GFpElement S = mX * Y_squared;
GFpElement x = S + S;
S = x + x;
GFpElement a_z4 = mC.get_a();
GFpElement z2 = mZ * mZ;
a_z4 *= z2;
a_z4 *= z2;
GFpElement y(mX * mX);
GFpElement M(y + y + y + a_z4);
x = M * M - (S+S);
y = Y_squared * Y_squared;
GFpElement U(y + y);
GFpElement z = U + U;
U = z + z;
y = M * (S - x) - U;
z = mY * mZ;
z = z + z;
mX = x;
mY = y;
mZ = z;
return *this;
}
/**
* returns a point equivalent to *this but were
* Z has value one, i.e. x and y correspond to
* their values in affine coordinates
*/
PointGFp PointGFp::get_z_to_one() const
{
return PointGFp(*this).set_z_to_one();
}
/**
* changes the representation of *this so that
* Z has value one, i.e. x and y correspond to
* their values in affine coordinates.
* returns *this.
*/
const PointGFp& PointGFp::set_z_to_one() const
{
if(!(mZ.get_value() == BigInt(1)) && !(mZ.get_value() == BigInt(0)))
{
GFpElement z = inverse(mZ);
GFpElement z2 = z * z;
z *= z2;
GFpElement x = mX * z2;
GFpElement y = mY * z;
mZ = GFpElement(mC.get_p(), BigInt(1));
mX = x;
mY = y;
}
else
{
if(mZ.get_value() == BigInt(0))
{
throw Illegal_Transformation("cannot convert Z to one");
}
}
return *this; // mZ = 1 already
}
GFpElement PointGFp::get_affine_x() const
{
if(is_zero())
throw Illegal_Transformation("cannot convert to affine");
GFpElement z2 = mZ * mZ;
return mX * z2.inverse_in_place();
}
GFpElement PointGFp::get_affine_y() const
{
if(is_zero())
throw Illegal_Transformation("cannot convert to affine");
GFpElement z3 = mZ * mZ * mZ;
return mY * z3.inverse_in_place();
}
GFpElement PointGFp::get_jac_proj_x() const
{
return GFpElement(mX);
}
GFpElement PointGFp::get_jac_proj_y() const
{
return GFpElement(mY);
}
GFpElement PointGFp::get_jac_proj_z() const
{
return GFpElement(mZ);
}
// Is this the point at infinity?
bool PointGFp::is_zero() const
{
return(mX.is_zero() && mZ.is_zero());
//NOTE: the calls to GFpElement::is_zero() instead of getting the value and
// and comparing it are import because they do not provoke backtransformations
// to the ordinary residue.
}
// Is the point still on the curve??
// (If everything is correct, the point is always on its curve; then the
// function will return silently. If Oskar managed to corrupt this object's state,
// then it will throw an exception.)
void PointGFp::check_invariants() const
{
if(is_zero())
{
return;
}
const GFpElement y2 = mY * mY;
const GFpElement x3 = mX * mX * mX;
if(mZ.get_value() == BigInt(1))
{
GFpElement ax = mC.get_a() * mX;
if(y2 != (x3 + ax + mC.get_b()))
{
throw Illegal_Point();
}
}
GFpElement Zpow2 = mZ * mZ;
GFpElement Zpow3 = Zpow2 * mZ;
GFpElement AZpow4 = Zpow3 * mZ * mC.get_a();
const GFpElement aXZ4 = AZpow4 * mX;
const GFpElement bZ6 = mC.get_b() * Zpow3 * Zpow3;
if(y2 != (x3 + aXZ4 + bZ6))
throw Illegal_Point();
}
// swaps the states of *this and other, does not throw!
void PointGFp::swap(PointGFp& other)
{
mC.swap(other.mC);
mX.swap(other.mX);
mY.swap(other.mY);
mZ.swap(other.mZ);
}
PointGFp mult2(const PointGFp& point)
{
return (PointGFp(point)).mult2_in_place();
}
bool operator==(const PointGFp& lhs, PointGFp const& rhs)
{
if(lhs.is_zero() && rhs.is_zero())
{
return true;
}
if((lhs.is_zero() && !rhs.is_zero()) || (!lhs.is_zero() && rhs.is_zero()))
{
return false;
}
// neither operand is zero, so we can call get_z_to_one()
//assert(!lhs.is_zero());
//assert(!rhs.is_zero());
PointGFp aff_lhs = lhs.get_z_to_one();
PointGFp aff_rhs = rhs.get_z_to_one();
return (aff_lhs.get_curve() == aff_rhs.get_curve() &&
aff_lhs.get_jac_proj_x() == aff_rhs.get_jac_proj_x() &&
aff_lhs.get_jac_proj_y() == aff_rhs.get_jac_proj_y());
}
// arithmetic operators
PointGFp operator+(const PointGFp& lhs, PointGFp const& rhs)
{
PointGFp tmp(lhs);
return tmp += rhs;
}
PointGFp operator-(const PointGFp& lhs, PointGFp const& rhs)
{
PointGFp tmp(lhs);
return tmp -= rhs;
}
PointGFp operator-(const PointGFp& lhs)
{
return PointGFp(lhs).negate();
}
PointGFp operator*(const BigInt& scalar, const PointGFp& point)
{
PointGFp result(point);
return result *= scalar;
}
PointGFp operator*(const PointGFp& point, const BigInt& scalar)
{
PointGFp result(point);
return result *= scalar;
}
// encoding and decoding
SecureVector<byte> EC2OSP(const PointGFp& point, byte format)
{
SecureVector<byte> result;
if(format == PointGFp::UNCOMPRESSED)
{
result = encode_uncompressed(point);
}
else if(format == PointGFp::COMPRESSED)
{
result = encode_compressed(point);
}
else if(format == PointGFp::HYBRID)
{
result = encode_hybrid(point);
}
else
{
throw Invalid_Argument("illegal point encoding format specification");
}
return result;
}
SecureVector<byte> encode_compressed(const PointGFp& point)
{
if(point.is_zero())
{
SecureVector<byte> result (1);
result[0] = 0;
return result;
}
u32bit l = point.get_curve().get_p().bits();
int dummy = l & 7;
if(dummy != 0)
{
l += 8 - dummy;
}
l /= 8;
SecureVector<byte> result (l+1);
result[0] = 2;
BigInt x = point.get_affine_x().get_value();
SecureVector<byte> bX = BigInt::encode_1363(x, l);
result.copy(1, bX.begin(), bX.size());
BigInt y = point.get_affine_y().get_value();
if(y.get_bit(0))
{
result[0] |= 1;
}
return result;
}
SecureVector<byte> encode_uncompressed(const PointGFp& point)
{
if(point.is_zero())
{
SecureVector<byte> result (1);
result[0] = 0;
return result;
}
u32bit l = point.get_curve().get_p().bits();
int dummy = l & 7;
if(dummy != 0)
{
l += 8 - dummy;
}
l /= 8;
SecureVector<byte> result (2*l+1);
result[0] = 4;
BigInt x = point.get_affine_x().get_value();
BigInt y = point.get_affine_y().get_value();
SecureVector<byte> bX = BigInt::encode_1363(x, l);
SecureVector<byte> bY = BigInt::encode_1363(y, l);
result.copy(1, bX.begin(), l);
result.copy(l+1, bY.begin(), l);
return result;
}
SecureVector<byte> encode_hybrid(const PointGFp& point)
{
if(point.is_zero())
{
SecureVector<byte> result (1);
result[0] = 0;
return result;
}
u32bit l = point.get_curve().get_p().bits();
int dummy = l & 7;
if(dummy != 0)
{
l += 8 - dummy;
}
l /= 8;
SecureVector<byte> result (2*l+1);
result[0] = 6;
BigInt x = point.get_affine_x().get_value();
BigInt y = point.get_affine_y().get_value();
SecureVector<byte> bX = BigInt::encode_1363(x, l);
SecureVector<byte> bY = BigInt::encode_1363(y, l);
result.copy(1, bX.begin(), bX.size());
result.copy(l+1, bY.begin(), bY.size());
if(y.get_bit(0))
{
result[0] |= 1;
}
return result;
}
PointGFp OS2ECP(MemoryRegion<byte> const& os, const CurveGFp& curve)
{
if(os.size() == 1 && os[0] == 0)
{
return PointGFp(curve); // return zero
}
SecureVector<byte> bX;
SecureVector<byte> bY;
GFpElement x(1,0);
GFpElement y(1,0);
GFpElement z(1,0);
const byte pc = os[0];
BigInt bi_dec_x;
BigInt bi_dec_y;
switch (pc)
{
case 2:
case 3:
//compressed form
bX = SecureVector<byte>(os.size() - 1);
bX.copy(os.begin()+1, os.size()-1);
bi_dec_x = BigInt::decode(bX, bX.size());
x = GFpElement(curve.get_p(), bi_dec_x);
bool yMod2;
yMod2 = (pc & 1) == 1;
y = PointGFp::decompress(yMod2, x, curve);
break;
case 4:
// uncompressed form
int l;
l = (os.size() -1)/2;
bX = SecureVector<byte>(l);
bY = SecureVector<byte>(l);
bX.copy(os.begin()+1, l);
bY.copy(os.begin()+1+l, l);
bi_dec_x = BigInt::decode(bX.begin(), bX.size());
bi_dec_y = BigInt::decode(bY.begin(),bY.size());
x = GFpElement(curve.get_p(), bi_dec_x);
y = GFpElement(curve.get_p(), bi_dec_y);
break;
case 6:
case 7:
//hybrid form
l = (os.size() - 1)/2;
bX = SecureVector<byte>(l);
bY = SecureVector<byte>(l);
bX.copy(os.begin() + 1, l);
bY.copy(os.begin()+1+l, l);
yMod2 = (pc & 0x01) == 1;
if(!(PointGFp::decompress(yMod2, x, curve) == y))
{
throw Illegal_Point("error during decoding hybrid format");
}
break;
default:
throw Invalid_Argument("encountered illegal format specification while decoding point");
}
z = GFpElement(curve.get_p(), BigInt(1));
//assert((x.is_trf_to_mres() && x.is_use_montgm()) || !x.is_trf_to_mres());
//assert((y.is_trf_to_mres() && y.is_use_montgm()) || !y.is_trf_to_mres());
//assert((z.is_trf_to_mres() && z.is_use_montgm()) || !z.is_trf_to_mres());
PointGFp result(curve, x, y, z);
result.check_invariants();
//assert((result.get_jac_proj_x().is_trf_to_mres() && result.get_jac_proj_x().is_use_montgm()) || !result.get_jac_proj_x().is_trf_to_mres());
//assert((result.get_jac_proj_y().is_trf_to_mres() && result.get_jac_proj_y().is_use_montgm()) || !result.get_jac_proj_y().is_trf_to_mres());
//assert((result.get_jac_proj_z().is_trf_to_mres() && result.get_jac_proj_z().is_use_montgm()) || !result.get_jac_proj_z().is_trf_to_mres());
return result;
}
GFpElement PointGFp::decompress(bool yMod2, const GFpElement& x,
const CurveGFp& curve)
{
BigInt xVal = x.get_value();
BigInt xpow3 = xVal * xVal * xVal;
BigInt g = curve.get_a().get_value() * xVal;
g += xpow3;
g += curve.get_b().get_value();
g = g%curve.get_p();
BigInt z = ressol(g, curve.get_p());
if(z < 0)
throw Illegal_Point("error during decompression");
bool zMod2 = z.get_bit(0);
if((zMod2 && ! yMod2) || (!zMod2 && yMod2))
{
z = curve.get_p() - z;
}
return GFpElement(curve.get_p(),z);
}
PointGFp create_random_point(RandomNumberGenerator& rng,
const CurveGFp& curve)
{
// create a random point
GFpElement mX(1,1);
GFpElement mY(1,1);
GFpElement mZ(1,1);
GFpElement minusOne(curve.get_p(), BigInt(BigInt::Negative,1));
mY = minusOne;
GFpElement y2(1,1);
GFpElement x(1,1);
while (mY == minusOne)
{
BigInt value(rng, curve.get_p().bits());
mX = GFpElement(curve.get_p(),value);
y2 = curve.get_a() * mX;
x = mX * mX;
x *= mX;
y2 += (x + curve.get_b());
value = ressol(y2.get_value(), curve.get_p());
if(value < 0)
mY = minusOne;
else
mY = GFpElement(curve.get_p(), value);
}
mZ = GFpElement(curve.get_p(), BigInt(1));
return PointGFp(curve, mX, mY, mZ);
}
} // namespace Botan
|