153 results on '"Arnaud Tisserand"'
Search Results
2. Using Hierarchical Approach to Speed-up RNS Base Extensions in Homomorphic Encryption Context.
3. Processor Extensions for Hardware Instruction Replay against Fault Injection Attacks.
4. FPGA Implementation and Comparison of Protections Against SCAs for RLWE.
5. Evaluation of variable bit-width units in a RISC-V processor for approximate computing.
6. Hierarchical Approach in RNS Base Extension for Asymmetric Cryptography.
7. Evaluation of approximate operators case study: sobel filter application executed on an approximate RISC-V platform.
8. Microcontroller Implementation of Simultaneous Protections Against Observation and Perturbation Attacks for ECC.
9. Architecture Level Optimizations for Kummer Based HECC on FPGAs.
10. Hyper-threaded multiplier for HECC.
11. An efficient framework for design and assessment of arithmetic operators with Reduced-Precision Redundancy.
12. Fast polynomial arithmetic for Somewhat Homomorphic Encryption operations in hardware with Karatsuba algorithm.
13. Hybrid Position-Residues Number System.
14. Exploration of polynomial multiplication algorithms for homomorphic encryption schemes.
15. Asynchronous Charge Sharing Power Consistent Montgomery Multiplier.
16. Single Base Modular Multiplication for Efficient Hardware RNS Implementations of ECC.
17. Fast and Secure Finite Field Multipliers.
18. Small FPGA Based Multiplication-Inversion Unit for Normal Basis Representation in GF(2m).
19. RNS modular multiplication through reduced base extensions.
20. Robust sub-powered asynchronous logic.
21. Improving Modular Inversion in RNS Using the Plus-Minus Method.
22. On-the-Fly Multi-base Recoding for ECC Scalar Multiplication without Pre-computations.
23. Analysis of GF (2233) multipliers regarding elliptic curve cryptosystem applications.
24. $\textrm{GF}(2^m)$ Finite-Field Multipliers with Reduced Activity Variations.
25. A Comparison on FPGA of Modular Multipliers Suitable for Elliptic Curve Cryptography over GF(p) for Specific p Values.
26. Multiplication in GF(2m): Area and time dependency/efficiency/complexity analysis.
27. Comparison of Modular Arithmetic Algorithms on GPUs.
28. Power Consumption of GPUs from a Software Perspective.
29. Error Detection for Borrow-Save Adders Dedicated to ECC Unit.
30. Fast and accurate activity evaluation in multipliers.
31. SPA resistant Elliptic Curve Cryptosystem using Addition Chains.
32. Multi-Mode Operator for SHA-2 Hash Functions.
33. Carry Prediction and Selection for Truncated Multiplication.
34. Towards the System-on-Chip Realization of a Sensorless Vector Controller with Microsecond-order Computation Time.
35. Hardware Operator for Simultaneous Sine and Cosine Evaluation.
36. Small FPGA polynomial approximations with 3-bit coefficients and low-precision estimations of the powers of x.
37. Division by Constant for the ST100 DSP Microprocessor.
38. Some Optimizations of Hardware Multiplication by Constant Matrices.
39. Small Multiplier-Based Multiplication and Division Operators for Virtex-II Devices.
40. Some Improvements on Multipartite Table Methods .
41. An On-Line Arithmetic Based FPGA for Low-Power Custom Computing.
42. Field Programmable Processor Arrays.
43. FPGA implementation of real-time digital controllers using on-line arithmetic.
44. Semi-Logarithmic Number Systems.
45. Lattice-based Cryptosystems on FPGA: Parallelization and Comparison using HLS
46. Computation of 2D 8×8 DCT Based on the Loeffler Factorization Using Algebraic Integer Encoding
47. FPGA Implementation and Comparison of Protections against SCAs for RLWE
48. Computing machine-efficient polynomial approximations
49. Generation of Finely-Pipelined GF(P ) Multipliers for Flexible Curve based Cryptography on FPGAs
50. Hierarchical Approach in RNS Base Extension for Asymmetric Cryptography
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.