Efficient Hardware Operations for the Residue Number System by Boolean Minimization (Q6181737): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2957295841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4379555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5476871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to the Design of Efficient Residue Generators for Arbitrary Moduli / rank
 
Normal rank
Property / cites work
 
Property / cites work: Residue Number Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular Multiplication Without Trial Division / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5424092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic Hardware and Embedded Systems - CHES 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal architecture for designing efficient modulo 2/sup n/+1 multipliers / rank
 
Normal rank

Latest revision as of 19:36, 23 August 2024

scientific article; zbMATH DE number 7792868
Language Label Description Also known as
English
Efficient Hardware Operations for the Residue Number System by Boolean Minimization
scientific article; zbMATH DE number 7792868

    Statements

    Efficient Hardware Operations for the Residue Number System by Boolean Minimization (English)
    0 references
    0 references
    0 references
    23 January 2024
    0 references
    modular multiplication
    0 references
    modulo function
    0 references
    residue number system
    0 references
    computer arithmetic
    0 references
    Boolean minimization
    0 references

    Identifiers