Searched refs:Finite (Results 1 – 9 of 9) sorted by relevance
18 of asymmetric algorithms: the FFC (Finite Field Cryptography) and IFC
64 Finite = 0x0004, enumerator68 NumericProperties = (Zero|NonZero|Finite|Infinity|NaN|SignedZero),414 return Zero | PosOrZero | NegOrZero | Finite; in deduce()415 uint32_t Props = (NonZero | Finite); in deduce()426 return (Props & ~NumericProperties) | (Zero|Finite); in deduce()433 Props |= Finite; in deduce()468 if (Ps & ConstantProperties::Finite) in print()1232 if (!(Props & ConstantProperties::Finite)) in evaluateCMPpi()1293 if (!(Props1 & P::Finite) || !(Props2 & P::Finite)) in evaluateCMPpp()
9 Finite field cryptography (FFC) is a method of implementing discrete logarithm
200 * **libarith.a**: this library contains the Natural Numbers (NN) and Finite field over primes293 Since it is possible to use libecc as a NN (**positive** Natural Numbers), Fp (Finite field over pr…1161 >Finite field of prime order (binary fields are
1605 Finite Interval . . . . . . . . . . . . 694--6991608 Finite Field . . . . . . . . . . . . . . 699--6992595 S. J. Hong Convex Hulls of Finite Sets of Points in
12037 …title = "{ACM} Algorithm 468: Algorithm for Automatic Numerical Integration Over a Finite I…12055 title = "{ACM} Algorithm 469: Arithmetic Over a Finite Field",14453 …abstract = "Finite-length reference string of arbitrary structure are considered, and an exact…16438 …keywords = "algorithm; automata theory --- Finite Automata; bibliographic search; computationa…19701 title = "Convex Hulls of Finite Sets of Points in Two and Three Dimensions",
117 - added Finite Cyclic Group field in status code 77 responses
3630 def Finite : FPMathTemplate, GNULibBuiltin<"math.h"> {
8105 Finite field Diffie Hellman is slow and computationally expensive for