The following pages link to Berk Sunar (Q310239):
Displaying 21 items.
- Homomorphic AES evaluation using the modified LTV scheme (Q310240) (← links)
- (Q850784) (redirect page) (← links)
- A Euclidean algorithm for normal bases (Q850785) (← links)
- A versatile Montgomery multiplier architecture with characteristic three support (Q1013337) (← links)
- Accelerating LTV based homomorphic encryption in reconfigurable hardware (Q1695865) (← links)
- Fully homomorphic encryption from the finite field isomorphism problem (Q1749277) (← links)
- Flattening NTRU for evaluation key free homomorphic encryption (Q2191204) (← links)
- Homomorphic rank sort using surrogate polynomials (Q2303114) (← links)
- Design of Cryptographic Devices Resilient to Fault Injection Attacks Using Nonlinear Robust Codes (Q2838307) (← links)
- Depth Optimized Efficient Homomorphic Sorting (Q2946441) (← links)
- Accelerating Fully Homomorphic Encryption in Hardware (Q2982223) (← links)
- A Custom Accelerator for Homomorphic Encryption Applications (Q2989526) (← links)
- (Q3000894) (← links)
- An efficient optimal normal basis type II multiplier (Q3417003) (← links)
- Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields (Q3417016) (← links)
- Achieving NTRU with montgomery multiplication (Q3417018) (← links)
- Mastrovito multiplier for all trinomials (Q3417023) (← links)
- An Efficient Basis Conversion Algorithm for Composite Fields with Given Representations (Q3417028) (← links)
- A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers (Q3417031) (← links)
- Optimal tower fields (Q3417057) (← links)
- Constructing composite field representations for efficient conversion (Q3417060) (← links)
