Java efficient implementation of a finite field (for cryptography use)

1,105

You can check Rings Java library (http://ringsalgebra.io). It has quite efficient support for Galois fields $GF(p, k)$ (both for small and for arbitrary large $p$).

Share:
1,105

Related videos on Youtube

Bush
Author by

Bush

Updated on December 04, 2020

Comments

  • Bush
    Bush almost 3 years

    Is there any popular robust implementation for a finite field in java? (An implementation of prime fields ,i.e. $GF(p)$ might also be good.

  • Bush
    Bush about 9 years
    Can you post a link? C++ might be okay also, I can use JNI. Forgot to mention, I need to use it with very large fields (for cryptography matters), does it efficient enough?
  • Olórin
    Olórin about 9 years
    I don't know if it would suit your need, as I was using it to construct quasi-numbers. A link ? Google is your friend, and typing "Givaro c++" in it may surprise you.