Invention Grant
- Patent Title: Reduced complexity modular polynomial multiplication for R-LWE cryptosystems
-
Application No.: US17531208Application Date: 2021-11-19
-
Publication No.: US11750366B2Publication Date: 2023-09-05
- Inventor: Xinmiao Zhang , Keshab K. Parhi
- Applicant: Regents of the University of Minnesota , Ohio State Innovation Foundation
- Applicant Address: US MN Minneapolis
- Assignee: Regents of the University of Minnesota,Ohio State Innovation Foundation
- Current Assignee: Regents of the University of Minnesota,Ohio State Innovation Foundation
- Current Assignee Address: US MN Minneapolis; US OH Columbus
- Agency: Westman, Champlin & Koehler, P.A.
- Agent Theodore M. Magee
- Main IPC: H04L9/00
- IPC: H04L9/00 ; H04L9/30

Abstract:
A method includes receiving a first polynomial and a second polynomial, both of order n−1 and forming d polynomial segments from both the first polynomial and the second polynomial such that each polynomial segment is of order (n/d)−1. The polynomial segments of the first polynomial and the d polynomial segments of the second polynomial are used to form segment products. Each segment product is divided into a first polynomial substructure of order n/d and a second polynomial substructure of order (n/d)−1. A first polynomial substructure containing the first n/d coefficients of a product of the first polynomial and the second polynomial is summed with a second polynomial substructure to form a sum substructure. The sum substructure is used multiple times to determine coefficients of a polynomial representing the modulo xn+1 of the product of the first polynomial and the second polynomial.
Public/Granted literature
- US20230163944A1 REDUCED COMPLEXITY MODULAR POLYNOMIAL MULTIPLICATION FOR R-LWE CRYPTOSYSTEMS Public/Granted day:2023-05-25
Information query