Search results
From MaRDI portal
- on complement representation and canonical recoding 2011-01-20 Paper Fast binary multiplication by performing dot counting and complement recoding 2010-09-01...10 bytes (14 words) - 13:45, 6 October 2023
- exponent in half Fast modular multiplication based on complement representation and canonical recoding A low-complexity LUT-based squaring algorithm On optimal...15 bytes (376 words) - 18:10, 4 February 2024
- Recommendations New methods for binary multiplication π π Fast modular multiplication based on complement representation and canonical recoding π π Inefficiency...15 bytes (309 words) - 20:23, 30 January 2024
- performing dot counting and complement recoding An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques Fast...15 bytes (233 words) - 05:11, 7 February 2024
- common-multiplicand method to the Montgomery algorithm for speeding up exponentiation. Optimal left-to-right binary signed-digit recoding Fast exponentiation...15 bytes (211 words) - 21:47, 3 February 2024
- arithmetic Fast binary multiplication by performing dot counting and complement recoding Fast exponentiation based on common-multiplicand-multiplication and...15 bytes (390 words) - 21:07, 30 January 2024
- reduction Fast binary multiplication by performing dot counting and complement recoding Certifying assembly with formal security proofs: the case of BBS Fast...15 bytes (1,006 words) - 14:27, 4 February 2024
- exponentiation algorithm by using signed-digit-recoding and folding techniques Efficient realization of large size two's complement multipliers using embedded blocks...15 bytes (340 words) - 14:36, 3 February 2024
- Cited In (10) Fast modular multiplication based on complement representation and canonical recoding Title not available (Why is that?) Fast exponentiation...15 bytes (225 words) - 08:06, 3 February 2024
- exponent in half Fast modular multiplication based on complement representation and canonical recoding Title not available (Why is that?) Binary Addition...15 bytes (287 words) - 21:50, 3 February 2024
- modified chaotic cryptographic method Cited In (7) Fast binary multiplication by performing dot counting and complement recoding Self-shrinking chaotic stream...15 bytes (261 words) - 07:39, 1 February 2024
- multiplication Fast modular multiplication based on complement representation and canonical recoding This page was built for publication: Compact SD: a...15 bytes (212 words) - 04:54, 7 March 2024
- cryptographyHamming weightmulti-exponentiationcomplex arithmeticsigned-digit recoding Mathematics Subject Classification ID Data encryption (aspects in computer...15 bytes (413 words) - 15:50, 30 January 2024
- counting and complement recoding New frameworks for Montgomeryβs modular multiplication method Another look at some fast modular arithmetic methods An optimization...15 bytes (200 words) - 18:37, 30 January 2024
- Work Optimal left-to-right binary signed-digit recoding Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation Cited In (1) Algorithm...15 bytes (186 words) - 07:06, 8 February 2024
- algorithm by using signed-digit-recoding and folding techniques π π An efficient common-multiplicand-multiplication method to the Montgomery algorithm for...15 bytes (234 words) - 03:07, 3 February 2024
- In (5) Fast binary multiplication by performing dot counting and complement recoding Title not available (Why is that?) New results in binary multiple...15 bytes (135 words) - 17:17, 7 February 2024
- microcomputers π π New methods for binary multiplication π π Fast binary multiplication by performing dot counting and complement recoding π π Reducing the...15 bytes (186 words) - 01:45, 5 February 2024
- algorithmic solutions to character dependency. This is complemented by empirical analyses using a recoded dataset on palaeognathid birds. We find that in small...11 bytes (372 words) - 21:33, 29 January 2026
- applications Fast binary multiplication by performing dot counting and complement recoding Recommendations Title not available (Why is that?) π π Title not...15 bytes (170 words) - 16:18, 4 February 2024