Patents by Inventor Turki F. Al-Somani
Turki F. Al-Somani has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 9565017Abstract: A method and device for protecting elliptic curve cryptography against simple power attacks is disclosed. The method is based on a processor such as a computer equipped to encrypt and decrypt communications and selecting and entering a point P on an elliptic curve in the computer. The processor provides k copies of the point P (kP). The processor is used to divide a string of Ks into two equal length partitions that are scanned from right to left and performing point doubling operation and delay the point addition operation by storing the some doubled points in a buffer for later performing of addition operation.Type: GrantFiled: November 10, 2014Date of Patent: February 7, 2017Assignee: Umm Al-Qura UniversityInventors: Hilal Houssain, Turki F. Al-Somani
-
Patent number: 9419789Abstract: A method of scalar multiplication to obtain the scalar product between a key and a point on an elliptic curve, wherein the secret is m bits long. In selected embodiments, the first step is to partition the secret into two partitions each with m/2 bits. Point-doubling operations are performed on the point and stored into three buffers. Point additions are performed at randomized time intervals thereby preventing the method from being susceptible to differential power analysis attacks.Type: GrantFiled: September 5, 2014Date of Patent: August 16, 2016Assignee: UMM AL-QURA UNIVERSITYInventors: Turki F Al-Somani, Hilal Houssain
-
Publication number: 20160149703Abstract: A method for efficient postcomputation-based generic-point scalar multiplication includes the following steps: providing a plurality of eight elliptic curve cryptoprocessors and using the cryptoprocessors to perform scalar multiplication of a group of points on an elliptic curve in which kP denotes the scalar multiplication and wherein k is an integer and P is a point on the elliptic curve; and, computing scalar multiplication on the plurality of elliptic curve cryptoprocessors by a series of point doubling and point additions that depend on the bit sequence that regenerates the scalar multiplier k; and wherein the multiplier k is partitioned into u partitions that are processed by the plurality of elliptic curve processors as k=(ku?1?k(u?2)? . . . k(0)) (u?1)(u?2).Type: ApplicationFiled: November 26, 2014Publication date: May 26, 2016Inventors: Turki F. Al-Somani, Ayman G. Fayoumi, Mohammed K. Ibrahim
-
Publication number: 20160149704Abstract: An efficient method of parallel-scalar multiplication to obtain the scalar product between a key and a point on an elliptic curve, using parallel processors. In selected embodiments, the key is partitioned into a number of partitions equal to the number of parallel processors. Precomputed points of the point on the elliptic curve are obtained using point-doubling operations, wherein the number of precomputed points also equals the number of parallel processors. Using a binary scalar-product method, intermediate scalar products are obtained when each of the parallel processors computes in parallel the scalar product between a key partition and a corresponding precomputed point. These intermediate scalar products are then aggregated using point-addition operations to obtain the total scalar product of the key and the point.Type: ApplicationFiled: November 25, 2015Publication date: May 26, 2016Applicant: Umm Al-Qura UniversityInventor: Turki F. AL-SOMANI
-
Publication number: 20160134417Abstract: A method and device for protecting elliptic curve cryptography against simple power attacks is disclosed. The method is based on a processor such as a computer equipped to encrypt and decrypt communications and selecting and entering a point P on an elliptic curve in the computer. The processor provides k copies of the point P (kP). The processor is used to divide a string of Ks into two equal length partitions that are scanned from right to left and performing point doubling operation and delay the point addition operation by storing the some doubled points in a buffer for later performing of addition operation.Type: ApplicationFiled: November 10, 2014Publication date: May 12, 2016Inventors: Hilal Houssain, Turki F. Al-Somani
-
Publication number: 20160072622Abstract: A method of scalar multiplication to obtain the scalar product between a key and a point on an elliptic curve, wherein the secret is m bits long. In selected embodiments, the first step is to partition the secret into two partitions each with m/2 bits. Point-doubling operations are performed on the point and stored into three buffers. Point additions are performed at randomized time intervals thereby preventing the method from being susceptible to differential power analysis attacks.Type: ApplicationFiled: September 5, 2014Publication date: March 10, 2016Applicant: UMM AL-QURA UNIVERSITYInventors: Turki F. AL-Somani, Hilal Houssain
-
Publication number: 20150381364Abstract: A method for securing elliptic curve scalar multiplication against power analysis attacks includes the following steps: a) dividing secret key into number of partitions, b) computing reference points, c) associating key partitions with reference points, d) selecting a key partition randomly, e) processing the selected key partition from least to most until reaching the leftmost ‘1’, f) repeating the previous two steps until all key partitions have been processed, g) accumulating the resulting points of processing key partitions to produce the scalar multiplication product kP.Type: ApplicationFiled: June 30, 2014Publication date: December 31, 2015Inventor: Turki F. Al-Somani
-
Patent number: 8755517Abstract: The method for generic-point parallel elliptic curve scalar multiplication replaces the pre-computation overhead of conventional elliptic curve scalar multiplication by post-computations that can be parallelized. This greatly increases the speed and efficiency of scalar multiplication performed in elliptic curve cryptography. According to the method, when scalar multiplication is required, the scalar integer is partitioned into a plurality of partitions, and calculations in each partition are performed simultaneously or in parallel on separate processors using conventional binary protocols. The bit size of each partition is adjusted to balance the load between the processors, i.e., so that each processor performs substantially the same number of point operations. The resulting calculations from each partition are accumulated or summed to produce the point that is the product of the scalar multiplication.Type: GrantFiled: December 8, 2010Date of Patent: June 17, 2014Assignee: Total Technology Solutions Co.Inventors: Turki F. Al-Somani, Mohammad K. Ibrahim
-
Publication number: 20140105381Abstract: The method for generic-point parallel elliptic curve scalar multiplication replaces the pre-computation overhead of conventional elliptic curve scalar multiplication by post-computations that can be parallelized. This greatly increases the speed and efficiency of scalar multiplication performed in elliptic curve cryptography. According to the method, when scalar multiplication is required, the scalar integer is partitioned into a plurality of partitions, and calculations in each partition are performed simultaneously or in parallel on separate processors using conventional binary protocols. The bit size of each partition is adjusted to balance the load between the processors, i.e., so that each processor performs substantially the same number of point operations. The resulting calculations from each partition are accumulated or summed to produce the point that is the product of the scalar multiplication.Type: ApplicationFiled: December 8, 2010Publication date: April 17, 2014Applicant: TOTAL TECHNOLOGY SOLUTIONS CO.Inventors: TURKI F. AL-SOMANI, MOHAMMAD K. IBRAHIM
-
Patent number: 8422685Abstract: The method for elliptic curve scalar multiplication may provide several countermeasures to protect scalar multiplication of a private key k by a point P to produce the product kP from power analysis attacks. First, the private key, k, is partitioned into a plurality of key partitions, which are processed in a random order, the resulting points being accumulated to produce the scalar product kP. Second, in each partition, the encoding is randomly selected to occur in binary form or in Non-Adjacent Form (NAF), with the direction of bit inspection being randomly assigned between most-to-least and least-to-most. Third, in each partition, each zero in the key may randomly perform a dummy point addition operation in addition to the doubling operation. The method may be implemented in software, smart cards, circuits, processors, or application specific integrated circuits (ASICs) designed to carry out the method.Type: GrantFiled: August 22, 2011Date of Patent: April 16, 2013Assignee: King Fahd University of Petroleum and MineralsInventors: Turki F. Al-Somani, Alaaeldin Amin
-
Publication number: 20120008780Abstract: The method for elliptic curve scalar multiplication may provide several countermeasures to protect scalar multiplication of a private key k by a point P to produce the product kP from power analysis attacks. First, the private key, k, is partitioned into a plurality of key partitions, which are processed in a random order, the resulting points being accumulated to produce the scalar product kP. Second, in each partition, the encoding is randomly selected to occur in binary form or in Non-Adjacent Form (NAF), with the direction of bit inspection being randomly assigned between most-to-least and least-to-most. Third, in each partition, each zero in the key may randomly perform a dummy point addition operation in addition to the doubling operation. The method may be implemented in software, smart cards, circuits, processors, or application specific integrated circuits (ASICs) designed to carry out the method.Type: ApplicationFiled: August 22, 2011Publication date: January 12, 2012Applicant: KING FAHD UNIVERSITY OF PETROLEUM AND MINERALSInventors: TURKI F. AL-SOMANI, ALAAELDIN AMIN
-
Publication number: 20090214023Abstract: The method for elliptic curve scalar multiplication may provide several countermeasures to protect scalar multiplication of a private key k by a point P to produce the product kP from power analysis attacks. First, the private key, k, is partitioned into a plurality of key partitions, which are processed in a random order, the resulting points being accumulated to produce the scalar product kP. Second, in each partition, the encoding is randomly selected to occur in binary form or in Non-Adjacent Form (NAF), with the direction of bit inspection being randomly assigned between most-to-least and least-to-most. Third, in each partition, each zero in the key may randomly perform a dummy point addition operation in addition to the doubling operation. The method may be implemented in software, smart cards, circuits, processors, or application specific integrated circuits (ASICs) designed to carry out the method.Type: ApplicationFiled: February 26, 2008Publication date: August 27, 2009Inventors: Turki F. Al-Somani, Alaaeldin Amin