class_group 0.6.0

Rust library for building IQC: cryptography based on class groups (Cl) of imaginary quadratic orders
Documentation 
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

shankslog(a,g,card)=
{
  my(M=Map());
  my(h=a,B=sqrtint(card)+1);
  for(i=0,B-1,
    mapput(M,h,i);
    h*=g);
  g2=h*a^-1;
  h=1;
  for(i=0,B,my(j);
    if(mapisdefined(M,h,&j),
      return(i*B-j));
    h*=g2);
  error("shankslog: not found");
}
if(Mod(2,1000003)^shankslog(Mod(3,1000003),Mod(2,1000003),1000002)!=3, error("shankslog"));

tablelog(g,card)=
{
  my(M=Map());
  my(h=1);
  for(i=0,card-1,
    mapput(M,h,i);h*=g);
  M;
}
tablelogdel(g,card)=
{
  my(M=Map());
  my(h=1);
  for(i=0,card-1,
    mapput(M,h,i);h*=g);
  h=1;
  for(i=0,card-1,
    mapdelete(M,h);h*=g);
  #M;
}
a=ffgen(5^5,'a); g=ffprimroot(a); T=tablelog(g,5^5-1);
if(g^mapget(T,a^2+a+1)!=a^2+a+1,error("shankslog"));
if(tablelogdel(g,5^5-1),error("mapdelete"));

M=Map([1,2;3,4;5,6])
Vec(M)
Vecrev(M)
Mat(M)
apply(sqr,M)
for(i=0,2,mapput(M, 2*i+1, -mapget(M,2*i+1)));M

M0=Map(matrix(10,2,i,j,i));
M1=Map(matrix(10,2,i,j,if(j==1,i,i*x^0)));
M2=Map(matrix(10,2,i,j,11-i));
M3=Map(matrix(10,2,i,j,12-i));
M4=Map(matrix(10,2,i,j,i*x^0));
MV=[M0,M1,M2,M3,M4];
[a==b|a<-MV;b<-MV]
[a===b|a<-MV;b<-MV]
cmp(M0,M1)
cmp(M0,M0)

M=Map();
mapput(M,2,3);
mapdelete(M,2);
M
mapisdefined(M,2)
mapput(M,2,3);M

M=Map([1,2;3,4;5,6]);
mapget(M,7)
mapdelete(M,7)
Vec(M,1)
Vec(M,-1)
Map([1,2;2,3;1,3;1,4])

\\ Errors, keep at end
L=List();
mapdelete(1,1)
mapdelete(L,1)
mapget(1,1)
mapget(L,1)
mapisdefined(1,1)
mapisdefined(L,1)
mapput(1,1)
mapput(L,1)
Map(1)