object GF2_192
- Alphabetic
- By Inheritance
- GF2_192
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
add(res: GF2_192, a: GF2_192, b: GF2_192): Unit
Computes a plus b and puts the result into res.
Computes a plus b and puts the result into res.
- res
output; must be not null; may be equal to a and/or b
- a
multiplicand; may be equal to res, in which case will get overwritten
- b
multiplier; may be equal to res, in which case will get overwritten
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def invert(res: GF2_192, z: GF2_192): Unit
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
mul(res: GF2_192, a: GF2_192, b: GF2_192): Unit
Computes a times b and puts the result into res.
Computes a times b and puts the result into res. Uses table lookups, which may not preserve the secrecy of the inputs in case of side-channel attacks.
- res
output; must be not null; may be equal to a and/or b
- a
multiplicand; may be equal to res, in which case will get overwritten
- b
multiplier; may be equal to res, in which case will get overwritten
-
def
mul(res: GF2_192, a: GF2_192, b: Byte): Unit
Computes a times b and puts the result into res.
Computes a times b and puts the result into res. More efficient than mul(res, a, new GF2_192(b))
- res
output; must be not null; may be equal to a and/or b
- a
multiplicand; may be equal to res, in which case will get overwritten
- b
multiplier; may be equal to res, in which case will get overwritten
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
power2To2ToK(res: GF2_192, z: GF2_192, k: Int): Unit
Raises z to the power 2{2k} and puts the result into res.
Raises z to the power 2{2k} and puts the result into res. Same sqr(z, z) 2^k times. Takes only about as much time as mul(res, z, z) (even more efficient implementations are possible, but not provided here because of risk of side-channel attacks)
- res
output; must be not null; may be equal to z
- z
input to be squared; may be equal to res, in which case will get overwritten
-
def
sqr(res: GF2_192, z: GF2_192): Unit
Squares z and puts the result into res.
Squares z and puts the result into res. Same as power2To2ToK(res, z, 0). About same efficiency as mul(res, z, z) (more efficient implementations are possible, but not provided here because of risk of side-channel attacks)
- res
output; must be not null; may be equal to z
- z
input to be squared; may be equal to res, in which case will get overwritten
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()