| Publication | Date of Publication | Type |
|---|
Flattening NTRU for evaluation key free homomorphic encryption
Journal of Mathematical Cryptology | 2020-06-24 | Paper |
Homomorphic rank sort using surrogate polynomials
| 2020-03-02 | Paper |
A Provably Secure True Random Number Generator with Built-In Tolerance to Active Attacks
IEEE Transactions on Computers | 2018-06-12 | Paper |
Fully homomorphic encryption from the finite field isomorphism problem
| 2018-05-16 | Paper |
Accelerating LTV based homomorphic encryption in reconfigurable hardware
| 2018-02-14 | Paper |
Sequential Circuit Design for Embedded Cryptographic Applications Resilient to Adversarial Faults
IEEE Transactions on Computers | 2017-11-10 | Paper |
A Custom Accelerator for Homomorphic Encryption Applications
IEEE Transactions on Computers | 2017-06-08 | Paper |
Accelerating Fully Homomorphic Encryption in Hardware
IEEE Transactions on Computers | 2017-05-16 | Paper |
Homomorphic AES evaluation using the modified LTV scheme
Designs, Codes and Cryptography | 2016-09-08 | Paper |
cuHE: a homomorphic encryption accelerator library
Cryptography and Information Security in the Balkans | 2016-04-26 | Paper |
Depth optimized efficient homomorphic sorting
Progress in Cryptology -- LATINCRYPT 2015 | 2015-09-17 | Paper |
Design of cryptographic devices resilient to fault injection attacks using nonlinear robust codes
Information Security and Cryptography | 2013-07-09 | Paper |
Resilient functions: just how resilient are they?
| 2011-05-31 | Paper |
Memory leakage-resilient encryption based on physically unclonable functions
Advances in Cryptology – ASIACRYPT 2009 | 2009-12-15 | Paper |
A versatile Montgomery multiplier architecture with characteristic three support
Computers and Electrical Engineering | 2009-04-17 | Paper |
Optimal Extension Field Inversion in the Frequency Domain
Arithmetic of Finite Fields | 2008-08-19 | Paper |
Optimal tower fields
IEEE Transactions on Computers | 2007-01-09 | Paper |
An efficient optimal normal basis type II multiplier
IEEE Transactions on Computers | 2007-01-09 | Paper |
Constructing composite field representations for efficient conversion
IEEE Transactions on Computers | 2007-01-09 | Paper |
A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers
IEEE Transactions on Computers | 2007-01-09 | Paper |
Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
IEEE Transactions on Computers | 2007-01-09 | Paper |
Mastrovito multiplier for all trinomials
IEEE Transactions on Computers | 2007-01-09 | Paper |
Achieving NTRU with montgomery multiplication
IEEE Transactions on Computers | 2007-01-09 | Paper |
An Efficient Basis Conversion Algorithm for Composite Fields with Given Representations
IEEE Transactions on Computers | 2007-01-09 | Paper |
A Euclidean algorithm for normal bases
Acta Applicandae Mathematicae | 2006-11-06 | Paper |
Cryptographic Hardware and Embedded Systems - CHES 2004
Lecture Notes in Computer Science | 2005-08-23 | Paper |
