|
Match
|
Document |
Document Title |
|
|
7599979 |
Apparatus for hybrid multiplier in GF(2m) and method thereof
An apparatus and method for hybrid multiplication in GF(2 m ) by which trade-off between the area and the operation speed of an apparatus for a hybrid multiplier in finite field GF(2 m ) can be...
|
|
|
7580472 |
Generation and detection of non-binary digital sequences
Method and apparatus for generating ternary and multi-valued Gold sequences, are disclosed. Also methods to detect ternary and multi-valued sequences are disclosed. The detection can be performed...
|
|
|
7574469 |
Method for generating the multiplicative inverse in a finite field GF(p)
The essence of the invention is an effective method for generating the multiplicative inverse in a finite field GF(p) where p is prime, i.e. for generating the modular inverse. This method is...
|
|
|
7558817 |
Apparatus and method for calculating a result of a modular multiplication
Apparatus for calculating a result of a modular multiplication of a first operand and a second operand with regard to a modulus, each having a length of 2 n bits, the operands and the modulus are...
|
|
|
7552164 |
Accelerated prime sieving using architecture-optimized partial prime product table
This embodiment teaches a variation of GCD-based sieving, building tables of prime products, but intentionally restricting the size of table entries to fit within a single machine word. This...
|
|
|
7552163 |
Montgomery modular multiplier and method thereof
A method for power reduction and increasing computation speed for a Montgomery modulus multiplication module for performing modulus multiplication. A coding scheme reduces the hamming distance for...
|
|
|
7543012 |
Method and apparatus to perform squaring operation in finite field
A method and apparatus to square an element A when a defining polynomial of a finite field GF(2 n ) is expressed as
f ( x ) = x n + ∑ i = 1 t x k i + 1 ,
and the element A...
|
|
|
7539719 |
Method and apparatus for performing multiplication in finite field GF(2n)
A method of obtaining C=(c 0 , . . . , c n−1 ) of a product of two elements A and B of a finite field GF(2 n ). The method includes permuting the last d coefficients (a n−1 , . . . , a n−d )...
|
|
|
RE40710 |
Data converter for performing exponentiation in polynomial residue class ring with value in finite field as coefficient
A data converter ( 1 ) capable of reducing a size of the total implementation in a device is a processing apparatus that performs secret converting processing predetermined to input data with 64...
|
|
|
7526518 |
Galois field multiplication system and method
A present invention Galois field multiplier system and method utilize lookup tables to generate one partial product term and one feedback term in one clock cycle. In one embodiment, a Galois field...
|
|
|
7519644 |
Finite field serial-serial multiplication/reduction structure and method
A method or cryptographic system for communicating securely over an insecure communication channel of the type which communicates a message from a transmitter to a receiver includes the step of...
|
|
|
7512647 |
Condensed Galois field computing system
A condensed Galois field computing system including a multiplier circuit for multiplying first and second polynomials with coefficients over a Galois field to obtain their product; and a Galois...
|
|
|
7511637 |
Spreading code derived from weil sequences
Methods and systems relating to Weil-based spreading codes are described herein. In an embodiment, a method includes generating a set of Weil sequences, adapting a plurality of sequences of the set...
|
|
|
7509486 |
Encryption processor for performing accelerated computations to establish secure network sessions connections
Methods and apparatus for an encryption processor for performing accelerated computations to establish secure network sessions. The encryption processor includes an execution unit and a decode...
|
|
|
7508936 |
Hardware accelerator for elliptic curve cryptography
An elliptic curve processing apparatus that performs operations on elliptic curves specified over binary polynomial fields includes a functional unit that has a digit serial multiplier with a digit...
|
|
|
7505585 |
Method of generating cryptographic key using elliptic curve and expansion in joint sparse form and using same
A method of generating a cryptographic key between two users. First, the users select an elliptic curve. Next, the users select a point P on the curve. Next, the first user selects integers r a ...
|
|
|
7487194 |
Binary and n-valued LFSR and LFCSR based scramblers, descramblers, sequence generators and detectors in Galois configuration
N-valued with n≧2 scramblers, descramblers, sequence generators and sequence detectors operate with Linear Feedback Shift Registers (LFSRs) in Galois configuration. Detectors and descramblers in...
|
|
|
7483935 |
System and method to implement a matrix multiply unit of a broadband processor
The present invention provides a system and method for improving the performance of general-purpose processors by implementing a functional unit that computes the product of a matrix operand with a...
|
|
|
7464128 |
Methods and apparatus for single stage Galois field operations
Techniques for single function stage Galois field (GF) computations are described. The new single function stage GF multiplication requires only m-bits per internal logic stage, a savings of m−1...
|
|
|
7461115 |
Modular multiplier
Modular multiplication of two elements X(t) and Y(t), over GF(2), where m is a field degree, may utilize field degree to determine, at least in part, the number of iterations. An extra shift...
|
|
|
7447310 |
Lean multiplication of multi-precision numbers over GF(2m)
Multi-precision multiplication methods over GF(2 m ) include representing a first polynomial and a second polynomial as an array of n words. A recursive algorithm may be used to iteratively...
|
|
|
7426529 |
Processor and method for a simultaneous execution of a calculation and a copying process
A processor includes a source register having a source register content, a destination register, a calculating unit for performing a calculation using the source register content, wherein the...
|
|
|
7424504 |
Arithmetic processor for accomodating different field sizes
An arithmetic processor is provided, which comprises an arithmetic logic unit (ALU) containing arithmetic circuitry configured to perform field operations in an underlying field. The circuitry...
|
|
|
7412474 |
Montgomery modular multiplier using a compressor and multiplication method
A Montgomery modular multiplier receiving a multiplicand (A), a modulus (M), and a multiplier (B), using a t-s compressor, where t>3 and s>1, and a multiplication method performed in the...
|
|
|
7404089 |
Method and system for protecting against side channel attacks when performing cryptographic operations
A method and system for protecting against side channel attacks on cryptographic systems that attempt to recover information from externally detectable signals, such as electromagnetic fields or...
|
|
|
7403965 |
Encryption/decryption system for calculating effective lower bits of a parameter for Montgomery modular multiplication
An arithmetic device for Montgomery modular multiplication which quickly calculates a parameter ND, the parameter ND satisfying R×R −1 −N×ND=1 for an integer N and a radix R that is coprime...
|
|
|
7403964 |
Galois field multiplier array for use within a finite field arithmetic unit
A Galois field multiplier array includes a 1 st register, a 2 nd register, a 3 rd register, and a plurality of multiplier cells. The 1 st register stores bits of a 1 st operand. The 2 nd ...
|
|
|
7395295 |
Pipeline core in Montgomery multiplier
A multiplier apparatus is arranged for multiplying a first long integer entity with a second long integer entity modulo a prime number. In particular, the comprises a pipelined multiplier core,...
|
|
|
7373368 |
Multiply execution unit that includes 4:2 and/or 5:3 compressors for performing integer and XOR multiplication
A multiply execution unit that can generate the integer product of a multiplicand and a multiplier and is also operable to generate the XOR product of the multiplicand and the multiplier. The...
|
|
|
7366299 |
Method for encrypting and decrypting data using derivative equations and factors
A data cryptographer encrypts and decrypts character data of any given length using derivative equations and factors. The use of factors and derivative equations introduces the randomness required...
|
|
|
7363336 |
Six-term Karatsuba-variant calculator
A technology generally related to large-scale computations is described herein. An implementation, described herein, employs a new and improved variant of the Karatsuba multiplication approach.
|
|
|
7346834 |
Randomizer systems for producing multiple-symbol randomizing sequences
A system that produces one or more non-repeating randomizer sequences of up to 2 m −1 or more m-bit symbols includes a randomizer circuit that is set up in accordance with a polynomial with...
|
|
|
7346641 |
Method and apparatus for basis conversion in finite field
There are provided efficient basis conversion matrices D sd and D ds and a basis conversion method in a finite field GF(2 n ) using the basis conversion matrices for a case where a defining...
|
|
|
7346159 |
Generic modular multiplier using partial reduction
An apparatus multiplies a first and a second binary polynomial X(t) and Y(t) over GF(2), where an irreducible polynomial M m (t)=t m +a m−1 t m−1 +a m−2 t m−2 t m−2 + . . . +a 1 t+a 0 ,...
|
|
|
7343472 |
Processor having a finite field arithmetic unit utilizing an array of multipliers and adders
A processor includes an instruction memory, arithmetic logic unit, finite field arithmetic unit, at least one digital storage device, and an instruction decoder. The instruction memory temporarily...
|
|
|
7317794 |
Enciphering and deciphering apparatus, and enciphering and deciphering method
The present invention aims at providing a novel enciphering and deciphering apparatus and an enciphering and deciphering method related thereto, which are respectively capable of contracting the...
|
|
|
7313583 |
Galois field arithmetic unit for use within a processor
A Galois field arithmetic unit includes a Galois field multiplier section and a Galois field adder section. The Galois field multiplier section includes a plurality of Galois field multiplier...
|
|
|
7299253 |
System and method for efficient basis conversion
This invention describes a method for evaluating a polynomial in an extension field F q M , wherein the method comprises the steps of partitioning the polynomial into a plurality of parts, each...
|
|
|
7283628 |
Programmable data encryption engine
A programmable data encryption engine for performing the cipher function of the data encryption standard (DES) algorithm includes a Galois field linear transformer system (GFLT) responsive to a...
|
|
|
7278090 |
Correction parameter determination system
An circuit arrangement and method for reducing the number of processing loops needed to generate an error correction parameter used in the Montgomery method. An initial input to a processing loop...
|
|
|
7277540 |
Arithmetic method and apparatus and crypto processing apparatus for performing multiple types of cryptography
An arithmetic apparatus for performing a long product-sum operation includes an integer unit arithmetic circuit, a finite field GF(2^m) based unit arithmetic circuit logically adjacent to the...
|
|
|
7269615 |
Reconfigurable input Galois field linear transformer system
A reconfigurable input Galois field linear transformer system includes a Galois field linear transformer including a matrix of cells; a plurality of storage planes for storing control patterns...
|
|
|
7266577 |
Modular multiplication apparatus, modular multiplication method, and modular exponentiation apparatus
A modular multiplication apparatus comprises a calculation unit which comprises processing units including a multiplier-adder unit and performs a modular multiplication by carrying out pipeline...
|
|
|
7260594 |
Arithmetic logic unit over finite field GF(2m)
Disclosed herein is an arithmetic logic unit over a finite field GF(2 m ). Arithmetic logic units consistent with the present invention are disclosed as implemented using a division algorithm based...
|
|
|
7251325 |
Public key cryptosystem using finite non abelian groups
The present invention relates to a method of encryption and decryption comprises the steps of: selecting a generator and a first element of a first non abelian group, respectively, computing a...
|
|
|
7248700 |
Device and method for calculating a result of a modular exponentiation
In a device for calculating a result of a modular exponentiation, the Chinese Residue Theorem (CRT) is used, wherein two auxiliary exponentiations are calculated using two auxiliary exponents and...
|
|
|
7240204 |
Scalable and unified multiplication methods and apparatus
Scalable and unified multipliers for multiplication of cryptographic parameters represented as elements of either of the prime field (GF(p)) and the binary extension field (GF(2 m )) include...
|
|
|
7240084 |
Generic implementations of elliptic curve cryptography using partial reduction
A reduction operation is utilized in an arithmetic operation on two binary polynomials X(t) and Y(t) over GF(2), where an irreducible polynomial M m (t)=t m +a m−1 t m−1 +a m−2 t m−2 + . ....
|
|
|
7233663 |
Key generation performance improvement
A method, apparatus, and article of manufacture provide the ability to rapidly generate a large prime number to be utilized in a cryptographic key of a cryptographic system. A candidate prime...
|
|
|
7206410 |
Circuit for the inner or scalar product computation in Galois fields
A circuit for computing the inner of scalar product of two vectors in a finite Galois field defined by a generator polynomial, wherein each vector includes at least two elements belonging to said...
|