| http://dbpedia.org/ontology/abstract
|
The carry-less product of two binary numbe … The carry-less product of two binary numbersis the result of carry-less multiplication of these numbers.This operation conceptually works like long multiplicationexcept for the fact that the carryis discarded instead of applied to the more significant position.It can be used to model operations over finite fields,in particular multiplication of polynomials from GF(2)[X],the polynomial ring over GF(2). The operation is also known as an XOR multiplication, as carry-discarding addition is equivalent to an exclusive or.addition is equivalent to an exclusive or.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/An_illustration_of_the_carry-less_product.svg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageID
|
52360425
|
| http://dbpedia.org/ontology/wikiPageLength
|
5313
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1125013300
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Cryptography +
, http://dbpedia.org/resource/Power_of_two +
, http://dbpedia.org/resource/Galois/Counter_Mode +
, http://dbpedia.org/resource/Category:Binary_arithmetic +
, http://dbpedia.org/resource/Polynomial_ring +
, http://dbpedia.org/resource/Long_multiplication +
, http://dbpedia.org/resource/Exclusive_or +
, http://dbpedia.org/resource/Radix +
, http://dbpedia.org/resource/Finite_field_arithmetic +
, http://dbpedia.org/resource/GF%282%29 +
, http://dbpedia.org/resource/Category:Computer_arithmetic +
, http://dbpedia.org/resource/X86 +
, http://dbpedia.org/resource/File:An_illustration_of_the_carry-less_product.svg +
, http://dbpedia.org/resource/CLMUL_instruction_set +
, http://dbpedia.org/resource/Binary_number +
, http://dbpedia.org/resource/Category:Multiplication +
, http://dbpedia.org/resource/Carry_%28arithmetic%29 +
, http://dbpedia.org/resource/X86-64 +
, http://dbpedia.org/resource/Finite_field +
, http://dbpedia.org/resource/Checksum +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Refimprove +
, http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Binary_arithmetic +
, http://dbpedia.org/resource/Category:Multiplication +
, http://dbpedia.org/resource/Category:Computer_arithmetic +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Carry-less_product?oldid=1125013300&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/An_illustration_of_the_carry-less_product.svg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Carry-less_product +
|
| owl:sameAs |
http://yago-knowledge.org/resource/Carry-less_product +
, https://global.dbpedia.org/id/2eQBa +
, http://www.wikidata.org/entity/Q28456327 +
, http://dbpedia.org/resource/Carry-less_product +
|
| rdfs:comment |
The carry-less product of two binary numbe … The carry-less product of two binary numbersis the result of carry-less multiplication of these numbers.This operation conceptually works like long multiplicationexcept for the fact that the carryis discarded instead of applied to the more significant position.It can be used to model operations over finite fields,in particular multiplication of polynomials from GF(2)[X],the polynomial ring over GF(2). The operation is also known as an XOR multiplication, as carry-discarding addition is equivalent to an exclusive or.addition is equivalent to an exclusive or.
|
| rdfs:label |
Carry-less product
|
