On area, time, and the right trade-off
Recently one of the most active fields of cryptography has been the design of lightweight algorithms. Often the explicit goal is to minimise the physical area for an implementation. While reducing area is an important consideration, beyond a certain threshold there is little point minimising area fu...
Saved in:
Main Authors: | Poschmann, A., Robshaw, M. J. B. |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/99703 http://hdl.handle.net/10220/17587 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Standardized signature algorithms on ultra-constrained 4-bit MCU
by: Chen, Chien-Ning, et al.
Published: (2013) -
Combinatorial algorithms for scheduling jobs to minimize server usage time
by: Ren, Runtian
Published: (2018) -
A subquadratic-time algorithm for decremental single-source shortest paths
by: Nanongkai, Danupon, et al.
Published: (2015) -
Complexity analysis of accelerated MCMC methods for Bayesian inversion
by: Hoang, Viet Ha., et al.
Published: (2014) -
Efficient implementations of the BP heuristic for the shortest linear program (SLP) problem
by: Liu, Shuqing
Published: (2021)