initial commit

8 files changed, 1064 insertions, 0 deletions

diff --git a/LICENSE.md b/LICENSE.md
new file mode 100644
index 0000000..af5153d
--- /dev/null
+++ b/LICENSE.md
@@ -0,0 +1,361 @@
+### GNU GENERAL PUBLIC LICENSE
+
+Version 2, June 1991
+
+    Copyright (C) 1989, 1991 Free Software Foundation, Inc.  
+    51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA
+
+    Everyone is permitted to copy and distribute verbatim copies
+    of this license document, but changing it is not allowed.
+
+### Preamble
+
+The licenses for most software are designed to take away your freedom
+to share and change it. By contrast, the GNU General Public License is
+intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users. This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it. (Some other Free Software Foundation software is covered by
+the GNU Lesser General Public License instead.) You can apply it to
+your programs, too.
+
+When we speak of free software, we are referring to freedom, not
+price. Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if
+you distribute copies of the software, or if you modify it.
+
+For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have. You must make sure that they, too, receive or can get the
+source code. And you must show them these terms so they know their
+rights.
+
+We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software. If the software is modified by someone else and passed on,
+we want its recipients to know that what they have is not the
+original, so that any problems introduced by others will not reflect
+on the original authors' reputations.
+
+Finally, any free program is threatened constantly by software
+patents. We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary. To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at
+all.
+
+The precise terms and conditions for copying, distribution and
+modification follow.
+
+### TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+**0.** This License applies to any program or other work which
+contains a notice placed by the copyright holder saying it may be
+distributed under the terms of this General Public License. The
+"Program", below, refers to any such program or work, and a "work
+based on the Program" means either the Program or any derivative work
+under copyright law: that is to say, a work containing the Program or
+a portion of it, either verbatim or with modifications and/or
+translated into another language. (Hereinafter, translation is
+included without limitation in the term "modification".) Each licensee
+is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope. The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the Program
+(independent of having been made by running the Program). Whether that
+is true depends on what the Program does.
+
+**1.** You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a
+fee.
+
+**2.** You may modify your copy or copies of the Program or any
+portion of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+  
+**a)** You must cause the modified files to carry prominent notices
+stating that you changed the files and the date of any change.
+
+  
+**b)** You must cause any work that you distribute or publish, that in
+whole or in part contains or is derived from the Program or any part
+thereof, to be licensed as a whole at no charge to all third parties
+under the terms of this License.
+
+  
+**c)** If the modified program normally reads commands interactively
+when run, you must cause it, when started running for such interactive
+use in the most ordinary way, to print or display an announcement
+including an appropriate copyright notice and a notice that there is
+no warranty (or else, saying that you provide a warranty) and that
+users may redistribute the program under these conditions, and telling
+the user how to view a copy of this License. (Exception: if the
+Program itself is interactive but does not normally print such an
+announcement, your work based on the Program is not required to print
+an announcement.)
+
+These requirements apply to the modified work as a whole. If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works. But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote
+it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+**3.** You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+  
+**a)** Accompany it with the complete corresponding machine-readable
+source code, which must be distributed under the terms of Sections 1
+and 2 above on a medium customarily used for software interchange; or,
+
+  
+**b)** Accompany it with a written offer, valid for at least three
+years, to give any third party, for a charge no more than your cost of
+physically performing source distribution, a complete machine-readable
+copy of the corresponding source code, to be distributed under the
+terms of Sections 1 and 2 above on a medium customarily used for
+software interchange; or,
+
+  
+**c)** Accompany it with the information you received as to the offer
+to distribute corresponding source code. (This alternative is allowed
+only for noncommercial distribution and only if you received the
+program in object code or executable form with such an offer, in
+accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it. For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable. However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+**4.** You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License. Any attempt otherwise
+to copy, modify, sublicense or distribute the Program is void, and
+will automatically terminate your rights under this License. However,
+parties who have received copies, or rights, from you under this
+License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+**5.** You are not required to accept this License, since you have not
+signed it. However, nothing else grants you permission to modify or
+distribute the Program or its derivative works. These actions are
+prohibited by law if you do not accept this License. Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+**6.** Each time you redistribute the Program (or any work based on
+the Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions. You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+**7.** If, as a consequence of a court judgment or allegation of
+patent infringement or for any other reason (not limited to patent
+issues), conditions are imposed on you (whether by court order,
+agreement or otherwise) that contradict the conditions of this
+License, they do not excuse you from the conditions of this License.
+If you cannot distribute so as to satisfy simultaneously your
+obligations under this License and any other pertinent obligations,
+then as a consequence you may not distribute the Program at all. For
+example, if a patent license would not permit royalty-free
+redistribution of the Program by all those who receive copies directly
+or indirectly through you, then the only way you could satisfy both it
+and this License would be to refrain entirely from distribution of the
+Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices. Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+**8.** If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded. In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+**9.** The Free Software Foundation may publish revised and/or new
+versions of the General Public License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns.
+
+Each version is given a distinguishing version number. If the Program
+specifies a version number of this License which applies to it and
+"any later version", you have the option of following the terms and
+conditions either of that version or of any later version published by
+the Free Software Foundation. If the Program does not specify a
+version number of this License, you may choose any version ever
+published by the Free Software Foundation.
+
+**10.** If you wish to incorporate parts of the Program into other
+free programs whose distribution conditions are different, write to
+the author to ask for permission. For software which is copyrighted by
+the Free Software Foundation, write to the Free Software Foundation;
+we sometimes make exceptions for this. Our decision will be guided by
+the two goals of preserving the free status of all derivatives of our
+free software and of promoting the sharing and reuse of software
+generally.
+
+**NO WARRANTY**
+
+**11.** BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO
+WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
+EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
+OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY
+KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
+PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME
+THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+**12.** IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
+WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
+AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU
+FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
+CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
+PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
+RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
+FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF
+SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
+DAMAGES.
+
+### END OF TERMS AND CONDITIONS
+
+### How to Apply These Terms to Your New Programs
+
+If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these
+terms.
+
+To do so, attach the following notices to the program. It is safest to
+attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    one line to give the program's name and an idea of what it does.
+    Copyright (C) yyyy  name of author
+
+    This program is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public License
+    as published by the Free Software Foundation; either version 2
+    of the License, or (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
+
+Also add information on how to contact you by electronic and paper
+mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details
+    type `show w'.  This is free software, and you are welcome
+    to redistribute it under certain conditions; type `show c' 
+    for details.
+
+The hypothetical commands \`show w' and \`show c' should show the
+appropriate parts of the General Public License. Of course, the
+commands you use may be called something other than \`show w' and
+\`show c'; they could even be mouse-clicks or menu items--whatever
+suits your program.
+
+You should also get your employer (if you work as a programmer) or
+your school, if any, to sign a "copyright disclaimer" for the program,
+if necessary. Here is a sample; alter the names:
+
+    Yoyodyne, Inc., hereby disclaims all copyright
+    interest in the program `Gnomovision'
+    (which makes passes at compilers) written 
+    by James Hacker.
+
+    signature of Ty Coon, 1 April 1989
+    Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program
+into proprietary programs. If your program is a subroutine library,
+you may consider it more useful to permit linking proprietary
+applications with the library. If this is what you want to do, use the
+[GNU Lesser General Public
+License](http://www.gnu.org/licenses/lgpl.html) instead of this
+License.
\ No newline at end of file
diff --git a/README.md b/README.md
new file mode 100644
index 0000000..90f5144
--- /dev/null
+++ b/README.md
@@ -0,0 +1,10 @@
+## ecgen
+
+Tool for generating Elliptic curve domain parameters.
+
+Currently only supports curves over prime fields.
+
+### Usage
+
+`gen.sh [-l|-s|-p] [num_curves] [prime_size] [timeout]`
+
diff --git a/ecgen.c b/ecgen.c
new file mode 100644
index 0000000..202f839
--- /dev/null
+++ b/ecgen.c
@@ -0,0 +1,55 @@
+
+#include <pari/pari.h>
+
+#include <stdio.h>
+#include <readline/readline.h>
+
+#include "points.c"
+#include "sea.c"
+
+char *readHex() {
+    char *r = readline(NULL);
+    size_t len = strlen(r);
+    char *result = realloc(r, len + 3);
+    memmove(result + 2, result, len);
+    result[0] = '0';
+    result[1] = 'x';
+    result[len + 2] = 0;
+    return result;
+}
+
+int main(int argc, char * argv[]) {
+	GEN (*todo)(GEN,GEN,GEN,long) = &largest_prime;
+	void (*print)(GEN) = &print_params;
+
+	if (argc > 1) {
+		if (!strcmp(argv[1], "-l")) {
+		todo = &largest_prime;
+		print = &print_params;
+		} else if (!strcmp(argv[1], "-s")) {
+		todo = &smallest_prime;
+		print = &print_params;
+		} else if (!strcmp(argv[1], "-p")) {
+		todo = &small_pubkey;
+		print = &print_params_pub;
+		}
+	}
+
+	init_sea();
+	pari_init( 1e9, 1e8 );
+	
+	default0("datadir","./data");
+
+	char *sp = readHex();
+	char *sa = readHex();
+	char *sb = readHex();
+
+	GEN p = strtoi(sp);
+	GEN a = strtoi(sa);
+	GEN b = strtoi(sb);
+
+	GEN result = (*todo)(p, a, b, 0);
+	(*print)(result);
+	pari_close();
+	return 0;
+}
diff --git a/gen.sh b/gen.sh
new file mode 100755
index 0000000..bcb2c98
--- /dev/null
+++ b/gen.sh
@@ -0,0 +1,32 @@
+#!/bin/bash
+
+if [ "$#" -lt 3 ]; then
+	echo "gen.sh [-l|-s|-p] [num_curves] [prime_size] [timeout]"
+	exit
+fi
+
+option=$1
+keys=$2
+bits=$3
+timeout=$4
+
+time for (( i=1; i <= "$keys"; i++ )); do
+p=$(openssl prime -generate -hex -bits "$bits");
+a=$(openssl rand -hex $(($bits / 8)));
+b=$(openssl rand -hex $(($bits / 8)));
+params="$p\n$a\n$b\n";
+
+if [ "$#" -eq 4 ]; then
+	res=$(echo -e "$params" | timeout "$timeout" ecgen "$option");
+else
+	res=$(echo -e "$params" | ecgen "$option");
+fi
+
+if [ "$?" -ne 0 ]; then
+    i=$((i - 1));
+else
+    r=($res);
+    echo "${r[3]}" | tee -a "$2b.curves";
+fi
+done
+
diff --git a/points.c b/points.c
new file mode 100644
index 0000000..1266d56
--- /dev/null
+++ b/points.c
@@ -0,0 +1,203 @@
+/*-*- compile-command: "cc -c -o points.o -g -O3 -Wall -fomit-frame-pointer -fno-strict-aliasing -fPIC -I"/usr/include/x86_64-linux-gnu" points.c && cc -o points.so -shared -g -O3 -Wall -fomit-frame-pointer -fno-strict-aliasing -fPIC -Wl,-shared -Wl,-z,relro points.o -lc -lm -L/usr/lib/x86_64-linux-gnu -lpari"; -*-*/
+#include <pari/pari.h>
+/*
+GP;install("init_points","v","init_points","./points.so");
+GP;install("find_point","D0,G,D0,G,D0,G,","find_point","./points.so");
+GP;install("find_points","D0,G,D0,G,D0,G,","find_points","./points.so");
+GP;install("maxprime_order","D0,G,D0,G,","maxprime_order","./points.so");
+GP;install("minprime_order","D0,G,D0,G,","minprime_order","./points.so");
+GP;install("max_order","D0,G,D0,G,","max_order","./points.so");
+GP;install("get_point","D0,G,D0,G,D0,G,","get_point","./points.so");
+GP;install("prime_orders","D0,G,D0,G,","prime_orders","./points.so");
+GP;install("get_points","D0,G,D0,G,D0,G,","get_points","./points.so");
+*/
+void init_points(void);
+GEN find_point(GEN e, GEN o, GEN n);
+GEN find_points(GEN e, GEN o, GEN p);
+GEN maxprime_order(GEN e, GEN o);
+GEN minprime_order(GEN e, GEN o);
+GEN max_order(GEN e, GEN o);
+GEN get_point(GEN e, GEN o, GEN f);
+GEN prime_orders(GEN e, GEN o);
+GEN get_points(GEN e, GEN o, GEN f);
+/*End of prototype*/
+
+void
+init_points(void)	  /* void */
+{
+  pari_sp ltop = avma;
+  avma = ltop;
+  return;
+}
+
+/* Finds random point of order n on curve e of order o.
+* @returns [[P.x, P.y], n, h]
+* @param e curve
+* @param o curve order
+* @param n desired point order
+*/
+GEN
+find_point(GEN e, GEN o, GEN n)	  /* vec */
+{
+  pari_sp ltop = avma;
+  GEN h = gen_0, P = gen_0;
+  GEN p1 = gen_0;	  /* vec */
+  h = gdivent(o, n);
+  {
+    pari_sp btop = avma;
+    do
+    {
+      P = genrand(e);
+      if (gc_needed(btop, 1))
+        P = gerepilecopy(btop, P);
+    } while(gequal0(ellmul(e, P, n)));
+  }
+  p1 = cgetg(4, t_VEC);
+  gel(p1, 1) = gcopy(P);
+  gel(p1, 2) = gcopy(n);
+  gel(p1, 3) = gcopy(h);
+  p1 = gerepilecopy(ltop, p1);
+  return p1;
+}
+
+/* Finds random points of orders given by vector p.
+* @returns vector of points in format [[P.x, P.y], n, h]
+* @param e curve
+* @param o curve order
+* @param p vector of point orders
+*/
+GEN
+find_points(GEN e, GEN o, GEN p)	  /* vec */
+{
+  pari_sp ltop = avma;
+  long l1;
+  GEN p2 = gen_0;	  /* vec */
+  l1 = glength(p);
+  {
+    long X;
+    p2 = cgetg(l1+1, t_VEC);
+    for (X = 1; X <= l1; ++X)
+      gel(p2, X) = find_point(e, o, gel(p, X));
+  }
+  p2 = gerepilecopy(ltop, p2);
+  return p2;
+}
+
+/*####################################################################*/
+
+GEN
+maxprime_order(GEN e, GEN o)
+{
+  pari_sp ltop = avma;
+  if (!gequal0(gisprime(o, 0)))
+  {
+    o = gerepilecopy(ltop, o);
+    return o;
+  }
+  else
+  {
+    GEN p1 = gen_0;
+    p1 = vecmax(factor(o));
+    p1 = gerepilecopy(ltop, p1);
+    return p1;
+  }
+  avma = ltop;
+  return gen_0;
+}
+
+GEN
+minprime_order(GEN e, GEN o)
+{
+  pari_sp ltop = avma;
+  if (!gequal0(gisprime(o, 0)))
+  {
+    o = gerepilecopy(ltop, o);
+    return o;
+  }
+  else
+  {
+    GEN p1 = gen_0;
+    p1 = gcopy(gcoeff(factor(o), 1, 1));
+    p1 = gerepilecopy(ltop, p1);
+    return p1;
+  }
+  avma = ltop;
+  return gen_0;
+}
+
+GEN
+max_order(GEN e, GEN o)
+{
+  pari_sp ltop = avma;
+  o = gerepilecopy(ltop, o);
+  return o;
+}
+
+/* Finds a random point of order given by f(o).
+* @returns [[P.x, P.y], n, h]
+* with P being the point with order f(o).
+* @param e curve
+* @param o curve order
+* @param f function returning the point order, \in maxprime_order,
+*			minprime_order, max_order
+*/
+GEN
+get_point(GEN e, GEN o, GEN f)	  /* vec */
+{
+  pari_sp ltop = avma;
+  GEN p1 = gen_0;	  /* vec */
+  p1 = find_point(e, o, closure_callgen1(f, o));
+  p1 = gerepilecopy(ltop, p1);
+  return p1;
+}
+
+/*####################################################################*/
+
+GEN
+prime_orders(GEN e, GEN o)
+{
+  pari_sp ltop = avma;
+  GEN f = gen_0;
+  if (!gequal0(gisprime(o, 0)))
+  {
+    GEN p1 = gen_0;	  /* vec */
+    p1 = cgetg(2, t_VEC);
+    gel(p1, 1) = gcopy(o);
+    p1 = gerepilecopy(ltop, p1);
+    return p1;
+  }
+  else
+  {
+    long l2;
+    GEN p3 = gen_0;	  /* vec */
+    f = factor(o);
+    l2 = glength(f);
+    {
+      long X;
+      p3 = cgetg(l2+1, t_VEC);
+      for (X = 1; X <= l2; ++X)
+        gel(p3, X) = gcopy(gcoeff(f, X, 1));
+    }
+    p3 = gerepilecopy(ltop, p3);
+    return p3;
+  }
+  avma = ltop;
+  return gen_0;
+}
+
+/* Finds random points of orders given by f(o).
+* @returns vector of points in format [[P.x, P.y], n, h]
+* @param e curve
+* @param o curve order
+* @param f function returning a vector of point orders
+*/
+GEN
+get_points(GEN e, GEN o, GEN f)	  /* vec */
+{
+  pari_sp ltop = avma;
+  GEN p1 = gen_0;	  /* vec */
+  p1 = find_points(e, o, closure_callgen1(f, o));
+  p1 = gerepilecopy(ltop, p1);
+  return p1;
+}
+
diff --git a/points.gp b/points.gp
new file mode 100644
index 0000000..a59c41b
--- /dev/null
+++ b/points.gp
@@ -0,0 +1,80 @@
+/* Finds random point of order n on curve e of order o.
+ * @returns [[P.x, P.y], n, h]
+ * @param e curve
+ * @param o curve order
+ * @param n desired point order
+ */
+find_point(e, o, n) = {
+	local(h, P);
+	h = o\n;
+	until(ellmul(e, P, n),
+		P = random(e);
+	);
+	return([P, n, h]);
+}
+
+/* Finds random points of orders given by vector p.
+ * @returns vector of points in format [[P.x, P.y], n, h]
+ * @param e curve
+ * @param o curve order
+ * @param p vector of point orders
+ */
+find_points(e, o, p) = {
+	return(vector(length(p),X,find_point(e, o, p[X])));
+}
+
+/*####################################################################*/
+
+maxprime_order(e, o) = {
+	if(isprime(o),
+		return(o);
+	,
+		return(vecmax(factor(o)));
+    );
+}
+
+minprime_order(e, o) = {
+	if(isprime(o),
+		return(o);
+	,
+		return(factor(o)[1,1]);
+	);
+}
+
+max_order(e, o) = {
+	return(o);
+}
+
+/* Finds a random point of order given by f(o).
+ * @returns [[P.x, P.y], n, h]
+ * with P being the point with order f(o).
+ * @param e curve
+ * @param o curve order
+ * @param f function returning the point order, \in maxprime_order,
+ *			minprime_order, max_order
+ */
+get_point(e, o, f) = {
+	return(find_point(e, o, f(o)));
+}
+
+/*####################################################################*/
+
+prime_orders(e, o) = {
+	local(f);
+	if(isprime(o),
+		return([o]);;
+	,
+		f = factor(o);
+		return(vector(length(f),X,f[X,1]));
+	);
+}
+
+/* Finds random points of orders given by f(o).
+ * @returns vector of points in format [[P.x, P.y], n, h]
+ * @param e curve
+ * @param o curve order
+ * @param f function returning a vector of point orders
+ */
+get_points(e, o, f) = {
+	return(find_points(e, o, f(o)));
+}
diff --git a/sea.c b/sea.c
new file mode 100644
index 0000000..1a987db
--- /dev/null
+++ b/sea.c
@@ -0,0 +1,231 @@
+/*-*- compile-command: "cc -c -o sea.o -g -O3 -Wall -fomit-frame-pointer -fno-strict-aliasing -fPIC -I"/usr/include/x86_64-linux-gnu" sea.c && cc -o sea.so -shared -g -O3 -Wall -fomit-frame-pointer -fno-strict-aliasing -fPIC -Wl,-shared -Wl,-z,relro sea.o -lc -lm -L/usr/lib/x86_64-linux-gnu -lpari"; -*-*/
+#include <pari/pari.h>
+/*
+GP;install("init_sea","v","init_sea","./sea.so");
+GP;install("largest_prime","D0,G,D0,G,D0,G,p","largest_prime","./sea.so");
+GP;install("smallest_prime","D0,G,D0,G,D0,G,p","smallest_prime","./sea.so");
+GP;install("all_prime","D0,G,D0,G,D0,G,p","all_prime","./sea.so");
+GP;install("small_pubkey","D0,G,D0,G,D0,G,p","small_pubkey","./sea.so");
+GP;install("print_params","vD0,G,","print_params","./sea.so");
+GP;install("print_params_pub","vD0,G,","print_params_pub","./sea.so");
+*/
+void init_sea(void);
+GEN largest_prime(GEN p, GEN a, GEN b, long prec);
+GEN smallest_prime(GEN p, GEN a, GEN b, long prec);
+GEN all_prime(GEN p, GEN a, GEN b, long prec);
+GEN small_pubkey(GEN p, GEN a, GEN b, long prec);
+void print_params(GEN curve);
+void print_params_pub(GEN curve);
+/*End of prototype*/
+
+void
+init_sea(void)	  /* void */
+{
+  pari_sp ltop = avma;
+  avma = ltop;
+  return;
+}
+
+/* E(Fp): y^2 = x^3 + ax + b mod p
+* @returns [p, a, b, [G.x, G.y], n, h]
+* @param p
+* @param a
+* @param b
+*/
+GEN
+largest_prime(GEN p, GEN a, GEN b, long prec)
+{
+  pari_sp ltop = avma;
+  GEN e = gen_0, o = gen_0, G = gen_0;
+  GEN p1 = gen_0;	  /* vec */
+  GEN maxprime_point = pol_x(fetch_user_var("maxprime_point"));
+  GEN p2 = gen_0;	  /* vec */
+  p1 = cgetg(3, t_VEC);
+  gel(p1, 1) = gcopy(a);
+  gel(p1, 2) = gcopy(b);
+  e = ellinit(p1, p, prec);
+  o = ellsea(e, 0);
+  if (gequal0(o))
+  {
+    avma = ltop;
+    return gen_0;
+  }
+  G = get_point(e, o, maxprime_point);
+  p2 = cgetg(8, t_VEC);
+  gel(p2, 1) = gcopy(p);
+  gel(p2, 2) = gcopy(a);
+  gel(p2, 3) = gcopy(b);
+  gel(p2, 4) = lift(gel(gel(G, 1), 1));
+  gel(p2, 5) = lift(gel(gel(G, 1), 2));
+  gel(p2, 6) = gcopy(gel(G, 2));
+  gel(p2, 7) = gcopy(gel(G, 3));
+  p2 = gerepilecopy(ltop, p2);
+  return p2;
+}
+
+/* E(Fp): y^2 = x^3 + ax + b mod p
+* @returns [p, a, b, G, n, h]
+* @param p
+* @param a
+* @param b
+*/
+GEN
+smallest_prime(GEN p, GEN a, GEN b, long prec)
+{
+  pari_sp ltop = avma;
+  GEN e = gen_0, o = gen_0, G = gen_0;
+  GEN p1 = gen_0;	  /* vec */
+  GEN minprime_point = pol_x(fetch_user_var("minprime_point"));
+  GEN p2 = gen_0;	  /* vec */
+  p1 = cgetg(3, t_VEC);
+  gel(p1, 1) = gcopy(a);
+  gel(p1, 2) = gcopy(b);
+  e = ellinit(p1, p, prec);
+  o = ellsea(e, 0);
+  if (gequal0(o))
+  {
+    avma = ltop;
+    return gen_0;
+  }
+  G = get_point(e, o, minprime_point);
+  p2 = cgetg(8, t_VEC);
+  gel(p2, 1) = gcopy(p);
+  gel(p2, 2) = gcopy(a);
+  gel(p2, 3) = gcopy(b);
+  gel(p2, 4) = lift(gel(gel(G, 1), 1));
+  gel(p2, 5) = lift(gel(gel(G, 1), 2));
+  gel(p2, 6) = gcopy(gel(G, 2));
+  gel(p2, 7) = gcopy(gel(G, 3));
+  p2 = gerepilecopy(ltop, p2);
+  return p2;
+}
+
+/* E(Fp): y^2 = x^3 + ax + b mod p
+* @returns vector of domain parameters [p, a, b, G, n, h]  points of all prime orders
+* @param p
+* @param a
+* @param b
+*/
+GEN
+all_prime(GEN p, GEN a, GEN b, long prec)
+{
+  pari_sp ltop = avma;
+  GEN e = gen_0, o = gen_0, G = gen_0;
+  GEN p1 = gen_0;	  /* vec */
+  GEN prime_orders = pol_x(fetch_user_var("prime_orders"));
+  long l2;
+  GEN p3 = gen_0;	  /* vec */
+  p1 = cgetg(3, t_VEC);
+  gel(p1, 1) = gcopy(a);
+  gel(p1, 2) = gcopy(b);
+  e = ellinit(p1, p, prec);
+  o = ellsea(e, 0);
+  if (gequal0(o))
+  {
+    avma = ltop;
+    return gen_0;
+  }
+  G = get_points(e, o, prime_orders);
+  l2 = glength(G);
+  {
+    long X;
+    p3 = cgetg(l2+1, t_VEC);
+    for (X = 1; X <= l2; ++X)
+    {
+      GEN p4 = gen_0;	  /* vec */
+      p4 = cgetg(8, t_VEC);
+      gel(p4, 1) = gcopy(p);
+      gel(p4, 2) = gcopy(a);
+      gel(p4, 3) = gcopy(b);
+      gel(p4, 4) = lift(gel(gel(gel(G, X), 1), 1));
+      gel(p4, 5) = lift(gel(gel(gel(G, X), 1), 2));
+      gel(p4, 6) = gcopy(gel(gel(G, X), 2));
+      gel(p4, 7) = gcopy(gel(gel(G, X), 3));
+      gel(p3, X) = p4;
+    }
+  }
+  p3 = gerepilecopy(ltop, p3);
+  return p3;
+}
+
+/*####################################################################*/
+
+/* E(Fp): y^2 = x^3 + ax + b mod p
+* @returns [p, a, b, G.x, G.y, r, k, P.x, P.y, n]
+*/
+GEN
+small_pubkey(GEN p, GEN a, GEN b, long prec)
+{
+  pari_sp ltop = avma;
+  GEN e = gen_0, o = gen_0, f = gen_0, G = gen_0, n = gen_0, h = gen_0, r = gen_0, P = gen_0;
+  GEN p1 = gen_0, p2 = gen_0;	  /* vec */
+  p1 = cgetg(3, t_VEC);
+  gel(p1, 1) = gcopy(a);
+  gel(p1, 2) = gcopy(b);
+  e = ellinit(p1, p, prec);
+  o = ellsea(e, 0);
+  if (gequal0(o))
+  {
+    avma = ltop;
+    return gen_0;
+  }
+  if (!gequal0(gisprime(o, 0)))
+  {
+    G = genrand(e);
+    n = o;
+    h = gen_1;
+    P = genrand(e);
+  }
+  else
+  {
+    f = factor(o);
+    f = vecsort0(f, NULL, 0);
+    n = gcopy(gcoeff(f, 1, 2));
+    h = gdivent(o, n);
+    /*printf("%s %u %u\n", f, n, h); */
+    {
+      pari_sp btop = avma;
+      do
+      {
+        G = genrand(e);
+        r = ellorder(e, G, NULL);
+        if (gc_needed(btop, 1))
+          gerepileall(btop, 2, &G, &r);
+      } while(!gequal0(gmod(r, n)));
+    }
+    /*printf("%s %s\n", G, r); */
+    P = ellmul(e, G, gdivent(r, n));
+  }
+  p2 = cgetg(11, t_VEC);
+  gel(p2, 1) = gcopy(p);
+  gel(p2, 2) = gcopy(a);
+  gel(p2, 3) = gcopy(b);
+  gel(p2, 4) = lift(gel(G, 1));
+  gel(p2, 5) = lift(gel(G, 2));
+  gel(p2, 6) = gcopy(r);
+  gel(p2, 7) = gdivent(o, r);
+  gel(p2, 8) = lift(gel(P, 1));
+  gel(p2, 9) = lift(gel(P, 2));
+  gel(p2, 10) = gcopy(n);
+  p2 = gerepilecopy(ltop, p2);
+  return p2;
+}
+
+void
+print_params(GEN curve)	  /* void */
+{
+  pari_sp ltop = avma;
+  printf0("%x,%x,%x,%x,%x,%x,%x\n", mkvecn(7, gel(curve, 1), gel(curve, 2), gel(curve, 3), gel(curve, 4), gel(curve, 5), gel(curve, 6), gel(curve, 7)));
+  avma = ltop;
+  return;
+}
+
+void
+print_params_pub(GEN curve)	  /* void */
+{
+  pari_sp ltop = avma;
+  printf0("%x,%x,%x,%x,%x,%x,%x,%x,%x,%x\n", mkvecn(10, gel(curve, 1), gel(curve, 2), gel(curve, 3), gel(curve, 4), gel(curve, 5), gel(curve, 6), gel(curve, 7), gel(curve, 8), gel(curve, 9), gel(curve, 10)));
+  avma = ltop;
+  return;
+}
+
diff --git a/sea.gp b/sea.gp
new file mode 100644
index 0000000..2ed449e
--- /dev/null
+++ b/sea.gp
@@ -0,0 +1,92 @@
+/* E(Fp): y^2 = x^3 + ax + b mod p
+ * @returns [p, a, b, [G.x, G.y], n, h]
+ * @param p
+ * @param a
+ * @param b
+ */
+largest_prime(p, a, b) = {
+	local(e, o, G);
+	e = ellinit([a, b], p);
+	o = ellsea(e);
+	if(!o, return);
+
+	G = get_point(e, o, maxprime_point);
+	return([p, a, b, lift(G[1][1]), lift(G[1][2]), G[2], G[3]]);
+}
+
+/* E(Fp): y^2 = x^3 + ax + b mod p
+ * @returns [p, a, b, G, n, h]
+ * @param p
+ * @param a
+ * @param b
+ */
+smallest_prime(p, a, b) = {
+	local(e, o, G);
+	e = ellinit([a, b], p);
+	o = ellsea(e);
+	if(!o, return);
+
+	G = get_point(e, o, minprime_point);
+	return([p, a, b, lift(G[1][1]), lift(G[1][2]), G[2], G[3]]);
+}
+
+/* E(Fp): y^2 = x^3 + ax + b mod p
+ * @returns vector of domain parameters [p, a, b, G, n, h]  points of all prime orders
+ * @param p
+ * @param a
+ * @param b
+ */
+all_prime(p, a, b) = {
+	local(e, o, G);
+	e = ellinit([a, b], p);
+	o = ellsea(e);
+	if(!o, return);
+
+	G = get_points(e, o, prime_orders);
+	return(vector(length(G),X,[p, a, b, lift(G[X][1][1]), lift(G[X][1][2]), G[X][2], G[X][3]]));
+}
+
+/*####################################################################*/
+
+/* E(Fp): y^2 = x^3 + ax + b mod p
+ * @returns [p, a, b, G.x, G.y, r, k, P.x, P.y, n]
+ */
+small_pubkey(p,a,b) =
+{
+	local(e, o, f, G, n, h, r, P);
+	e = ellinit([a,b],p);
+	o = ellsea(e);
+	if(!o, return);
+
+	if(isprime(o),
+		G = random(e);
+		n = o;
+		h = 1;
+		P = random(e);
+		,
+		f = factor(o);
+		f = vecsort(f);
+		n = f[1,2];
+		h = o\n;
+
+		\\printf("%s %u %u\n", f, n, h);
+		until(r % n == 0,
+			G = random(e);
+			r = ellorder(e, G);
+			\\printf("%s %s\n", G, r);
+		);
+		P = ellmul(e,G,r\n);
+	);
+
+	return([p,a,b,lift(G[1]),lift(G[2]),r,o\r,lift(P[1]),lift(P[2]),n]);
+}
+
+print_params(curve) =
+{
+    printf("%x,%x,%x,%x,%x,%x,%x\n", curve[1], curve[2], curve[3], curve[4], curve[5], curve[6], curve[7]);
+}
+
+print_params_pub(curve) =
+{
+    printf("%x,%x,%x,%x,%x,%x,%x,%x,%x,%x\n", curve[1], curve[2], curve[3], curve[4], curve[5], curve[6], curve[7], curve[8], curve[9], curve[10]);
+}