http://rdf.ncbi.nlm.nih.gov/pubchem/patent/KR-20090113138-A
Outgoing Links
Predicate | Object |
---|---|
assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_8d0fc2b70675ee19bd5fc464f5ae9061 |
classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F7-525 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F7-724 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F7-722 |
classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F7-52 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F7-57 |
filingDate | 2008-04-26-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_2125d602e7a505437626b085b49f841c http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_0b51fec52323c315b33166695e512484 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_ea138c0f349701adfe2a81572dec544d http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_6e3baa43acfaf024b87c08b41c64e15e http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_f7b6d36c56fedb68e77b7c09da4257f7 |
publicationDate | 2009-10-29-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
publicationNumber | KR-20090113138-A |
titleOfInvention | MDS series multiplication system (3 mm) serial multiplication apparatus, method thereof, and recording medium recording the same |
abstract | MSD first A serial multiplication apparatus, a method thereof, and a recording medium recording the same are disclosed.n n n MSD first according to the invention Serial multiplication device, Order on Phosphorus Ternary Polynomial Using the above The sun When, two elements on the finite body , Series multiplication results by multiplying To generate Loop index for MSD first digit serial multiplier end when, Indexes of digits Say, Coefficient of , , Generated from the coefficients of the ternary polynomial And generated according to the coefficients of the ternary term polynomial As the input and Create and remind Using Initial value generating unit for generating a; Loop index end When is calculated Using the first substitution operator And generate the Using the second substitution operator A preprocessing operation unit generating a; A first substitution operator generated by the preprocessor , remind Coefficient of , , And As the input Result of A multiplication unit for generating; Result of MSD first digit serial multiplication in the previous loop , The second substitution operator An adder configured to generate an addition result value by inputting a result value of the multiplier; And a shift register which write-shifts the addition result value and feeds it back to the adder.n n n According to the present invention, in a paying-based cryptographic system to which the ternary term polynomial is applied, it has less time delay than the conventional MSD-first multiplier, does not depend on the number of tables, and operates at high speed compared to the conventional finite field multiplier. In this case, the increased space complexity can be minimized, and therefore, a pairing-based cryptographic system can be designed more efficiently, and in particular, it can be applied to all finite bodies using the ternary agreement polynomial. There is an effect that can be applied. |
priorityDate | 2008-04-26-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 24.