A Pipelined Camellia Architecture for Compact Hardware Implementation

Date

2010-07-09

Author

Kavun, Elif Bilge
Yalcin, Tolga

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

191
views

0
downloads

In this paper, we present a compact and fast pipelined implementation of the block cipher Camellia for 128-bit data and 128-bit key lengths. The implementation is suitable for both Field Programmable Gate Array (FPGA) and Application Specific Integrated Circuit (ASIC) platforms, and is targeted for low area and low power applications. To obtain a compact design, pipelining principles are exploited and platform specific optimizations are made. The design requires only 321 slices with a throughput of 32.96 Mbps based on Xilinx Spartan-S XC3S50-5 chip and 4.31K gates with a throughput of 81 Mbps based on 0.13-mu m CMOS standard cell library.

Subject Keywords

Camellia, Block cipher, FPGA, ASIC, Efficient implementation, Cryptography, Cryptographic hardware

URI

https://hdl.handle.net/11511/65294

Conference Name

21st IEEE International Conference on Application-Specific Systems, Architectures and Processors

Collections

Graduate School of Applied Mathematics, Conference / Seminar

Suggestions

OpenMETU
Core

A two-level variational multiscale method for convection-dominated convection-diffusion equations Volker, John; Kaya Merdan, Songül; Layton, William (2006-01-01) This paper studies the error in, the efficient implementation of and time stepping methods for a variational multiscale method (VMS) for solving convection-dominated problems. The VMS studied uses a fine mesh C-O finite element space X-h to approximate the concentration and a coarse mesh discontinuous vector finite element space L-H for the large scales of the flux in the two scale discretization. Our tests show that these choices lead to an efficient VMS whose complexity is further reduced if a (locally) L...
A Lightweight Implementation of Keccak Hash Function for Radio-Frequency Identification Applications Kavun, Elif Bilge; Yalcin, Tolga (2010-06-09) In this paper, we present a lightweight implementation of the permutation Keccak-f[200] and Keccak-f[400] of the SHA-3 candidate hash function Keccak. Our design is well suited for radio-frequency identification (RFID) applications that have limited resources and demand lightweight cryptographic hardware. Besides its low-area and low-power, our design gives a decent throughput. To the best of our knowledge, it is also the first lightweight implementation of a sponge function, which differentiates it from th...
Efficient interleaved Montgomery modular multiplication for lattice-based cryptography AKLEYLEK, SEDAT; Tok, Zaliha Yuce (2014-01-01) In this paper, we give modified version of interleaved Montgomery modular multiplication method for lattice-based cryptography. With the proposed algorithms, we improve the multiplication complexity and embed the conversion operation into the algorithm with almost free cost. We implement the proposed methods for the quotient ring (Z/qZ)[x]/(x(n) - 1) and (Z/pZ)[x]/(x(n) + 1) on the GPU (NVIDIA Quadro 600) using the CUDA platform. NTRUEncrypt is accelerated approximately 35% on the GPU by using the proposed ...
Sparse polynomial multiplication for lattice-based cryptography with small complexity Akleylek, Sedat; Alkim, Erdem; Tok, Zaliha Yuce (2016-02-01) In this paper, we propose efficient modular polynomial multiplication methods with applications in lattice-based cryptography. We provide a sparse polynomial multiplication to be used in the quotient ring (Z/pZ)[x]/(x(n) + 1). Then, we modify this algorithm with sliding window method for sparse polynomial multiplication. Moreover, the proposed methods are independent of the choice of reduction polynomial. We also implement the proposed algorithms on the Core i5-3210M CPU platform and compare them with numbe...
A modular regularized variational multiscale proper orthogonal decomposition for incompressible flows Eroglu, Fatma G.; Kaya Merdan, Songül; Rebholz, Leo G. (Elsevier BV, 2017-10-01) In this paper, we propose, analyze and test a post-processing implementation of a projection-based variational multiscale (VMS) method with proper orthogonal decomposition (POD) for the incompressible Navier-Stokes equations. The projection-based VMS stabilization is added as a separate post-processing step to the standard POD approximation, and since the stabilization step is completely decoupled, the method can easily be incorporated into existing codes, and stabilization parameters can be tuned independe...

Citation Formats

E. B. Kavun and T. Yalcin, “A Pipelined Camellia Architecture for Compact Hardware Implementation,” Rennes, FRANCE, 2010, p. 0, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65294.