The following pages link to Vassil S. Dimitrov (Q1675956):
Displaying 38 items.
- (Q935618) (redirect page) (← links)
- A combinatorial interpretation of double base number system and some consequences (Q935619) (← links)
- (Q1199557) (redirect page) (← links)
- On the multiplication of reduced biquaternions and applications (Q1199560) (← links)
- A fast and robust RNS algorithm for evaluating signs of determinants (Q1608439) (← links)
- Efficient computation of tridiagonal matrices largest eigenvalue (Q1675958) (← links)
- Modular hardware architecture for somewhat homomorphic function evaluation (Q1695862) (← links)
- A low-power two-digit multi-dimensional logarithmic number system filterbank architecture for a digital hearing aid (Q2502769) (← links)
- An efficient architecture for a lifted 2D biorthogonal DWT (Q2508506) (← links)
- An algorithm for modular exponentiation. (Q2583553) (← links)
- A Generalization of Addition Chains and Fast Inversions in Binary Fields (Q2982085) (← links)
- VLSI Computational Architectures for the Arithmetic Cosine Transform (Q2982122) (← links)
- Lower bounds on the lengths of double-base representations (Q3093429) (← links)
- (Q3114244) (← links)
- Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation (Q3507888) (← links)
- Generalized Fermat-Mersenne number theoretic transform (Q4308763) (← links)
- The Arithmetic Cosine Transform: Exact and Approximate Algorithms (Q4570298) (← links)
- Complexity and fast algorithms for multiexponentiations (Q4571350) (← links)
- DFT Computation Using Gauss-Eisenstein Basis: FFT Algorithms and VLSI Architectures (Q4589520) (← links)
- Computation of 2D 8×8 DCT Based on the Loeffler Factorization Using Algebraic Integer Encoding (Q4626958) (← links)
- (Q4839853) (← links)
- Hybrid algorithm for the computation of the matrix polynomial I+A+···+A/sup N-1/ (Q4878456) (← links)
- (Q4885901) (← links)
- Provably Sublinear Point Multiplication on Koblitz Curves and Its Hardware Implementation (Q4975066) (← links)
- VLSI Architectures for the 4-Tap and 6-Tap 2-D Daubechies Wavelet Filters Using Algebraic Integers (Q5008560) (← links)
- Fast Inversion in <formula formulatype="inline"><tex Notation="TeX">${\schmi{GF(2^m)}}$</tex></formula> with Normal Basis Using Hybrid-Double Multipliers (Q5268255) (← links)
- A Fast Hardware Architecture for Integer to \tauNAF Conversion for Koblitz Curves (Q5277613) (← links)
- Area-Efficient Multipliers Based on Multiple-Radix Representations (Q5280628) (← links)
- Hybrid Binary-Ternary Number System for Elliptic Curve Cryptosystems (Q5280636) (← links)
- Fault-tolerant computations over replicated finite rings (Q5349671) (← links)
- The double-base number system and its application to elliptic curve cryptography (Q5444319) (← links)
- Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains (Q5451064) (← links)
- A Graph Theoretic Analysis of Double Base Number Systems (Q5458207) (← links)
- Extending Scalar Multiplication Using Double Bases (Q5459075) (← links)
- Fast Generation of RSA Keys Using Smooth Integers (Q5868393) (← links)
- Fragile Watermarking Using Finite Field Trigonometrical Transforms (Q6258696) (← links)
- Fast Matrix Inversion and Determinant Computation for Polarimetric Synthetic Aperture Radar (Q6304472) (← links)
- On the Computation of Neumann Series (Q6511801) (← links)
