| Patent application number | Description | Published |
|---|
| 20090052657 | Method for Scalar Multiplication in Elliptic Curve Groups Over Binary Polynomial Fields for Side-Channel Attack-Resistant Cryptosystems - A method for transforming data with a secret parameter in an elliptic curve cryptosystem based on an elliptic curve defined over an underlying binary polynomial field, includes multiplying a point of the elliptic curve, and representing the data to be transformed by a scalar representing the secret parameter, wherein the multiplying includes performing at least one point addition operation and at least one point doubling operation on points of the elliptic curve. The point addition operation includes a first sequence of elementary field operations, and the point doubling operation includes a second sequence of elementary field operations, both the first and the second sequences of elementary field operations including a field inversion of coordinates of the elliptic curve points. A representation of the elliptic curve points in affine coordinates is provided and the first and second sequences of elementary field operations are balanced. The field inversion of coordinates is performed by the extended Euclidean algorithm and the balancing includes balancing the extended Euclidean algorithm by adding at least one dummy operation. | 02-26-2009 |
| 20090112896 | Method And Related Device For Hardware-Oriented Conversion Between Arithmetic And Boolean Random Masking - A method for secure conversion between two different random markings used for cryptographic functions, converts a first binary data word, masked by a binary mask word according to a first masking process, into a corresponding second binary data word, masked by said binary mask word according to a second masking process, the first and second binary data words and the binary mask word including corresponding pluralities of bits, wherein each of the pluralities of the bits includes a least significant bit, a first bit, and at least one i-th bit i≧2. | 04-30-2009 |
| 20090214025 | Method for Scalar Multiplication in Elliptic Curve Groups Over Prime Fields for Side-Channel Attack Resistant Cryptosystems - A method and device for transforming data with a secret parameter in an elliptic curve cryptosystem based on an elliptic curve defined over an underlying prime field, includes multiplying a point of the elliptic curve; representing the data to be transformed, by a scalar representing the secret parameter, wherein the multiplying includes performing at least one point addition operation and at least one point doubling operation on points of the elliptic curve; providing a representation in affine coordinates of the elliptic curve point to be multiplied and a representation in projective coordinates of intermediate elliptic curve points obtained during the multiplying; performing both the point addition operation and the point doubling operation by means of a sequence of elementary prime field operation types, the elementary prime field operation types including: a first type of prime field operations including field multiplication and field squaring of coordinates of the elliptic curve points and a second type of prime field operations including field addition, field doubling, and field subtraction of coordinates of the elliptic curve points. | 08-27-2009 |
| 20100017618 | METHOD AND SYSTEM FOR BIOMETRIC AUTHENTICATION AND ENCRYPTION - A biometric user authentication method, includes enrolling a user based on user's biometric samples to generate user's reference data; and authenticating the user based on a user's live biometric sample and the user's reference data; wherein enrolling a user includes acquiring the user's biometric samples; extracting an enrollment feature vector from each user's biometric sample; computing a biometric reference template vector as a mean vector based on the enrollment feature vectors; computing a variation vector based on the enrollment feature vectors and the mean vector; randomly generating an enrollment secret vector; computing an enrollment code vector based on the enrollment secret vector and the variation vector; computing a difference vector as a wrap-around difference between the enrollment code vector and the mean vector; computing an error correction vector based on the enrollment secret vector to enable error correction during the user authentication phase according to a given error tolerance level, wherein the error correction vector is not computed if the error tolerance level is equal to zero; and storing the variation vector, the difference vector, and the error correction vector as a part of the user's reference data to be used during the user authentication phase. | 01-21-2010 |
| 20100284282 | METHOD OF DETECTING ANOMALIES IN A COMMUNICATION SYSTEM USING SYMBOLIC PACKET FEATURES - A method of detecting anomalies in a communication system includes: providing a first packet flow portion and a second packet flow portion; extracting samples of a symbolic packet feature associated with a traffic status of the first and second packet flow portions; computing from the extracted samples a first statistical concentration quantity and a second statistical concentration quantity of the symbolic feature associated with the first and second packet flow portions, respectively; computing from the concentration quantities a variation quantity representing a concentration change from the first packet flow portion to the second packet flow portion; comparing the variation quantity with a comparison value; and detecting an anomaly in the system in response to the comparison. | 11-11-2010 |
| 20100284283 | METHOD OF DETECTING ANOMALIES IN A COMMUNICATION SYSTEM USING NUMERICAL PACKET FEATURES - A method of detecting anomalies in a communication system, includes: providing a first packet flow portion and a second packet flow portion; extracting samples of a numerical feature associated with a traffic status of the first and second packet flow portions; computing from said extracted samples a first statistical dispersion quantity and a second statistical dispersion quantity of the numerical feature associated with the first and second packet flow portions, respectively; computing from the dispersion quantities a variation quantity representing a dispersion change from the first packet flow portion to the second packet flow portion; comparing the variation quantity with a comparison value; and detecting an anomaly in the system in response to said comparison. | 11-11-2010 |
