scientific article; zbMATH DE number 2081069
From MaRDI portal
Publication:4474178
zbMath1067.94563MaRDI QIDQ4474178
Akashi Satoh, Kohji Takano, Sumio Morioka, Seiji Munetoh
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2248/22480239.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Mathematical problems of computer architecture (68M07)
Related Items (24)
A First-Order Leak-Free Masking Countermeasure ⋮ A New Difference Method for Side-Channel Analysis with High-Dimensional Leakage Models ⋮ Logic minimization techniques with applications to cryptology ⋮ Atomic-AES: A Compact Implementation of the AES Encryption/Decryption Core ⋮ Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\) ⋮ Higher-Order Side Channel Security and Mask Refreshing ⋮ On the Anonymization of Cocks IBE Scheme ⋮ Spin me right round rotational symmetry for FPGA-specific AES: extended version ⋮ A Very Compact “Perfectly Masked” S-Box for AES ⋮ From unbalanced to perfect: implementation of low energy stream ciphers ⋮ Ultra-Lightweight Implementations for Smart Devices – Security for 1000 Gate Equivalents ⋮ Resource allocation in rooted trees for VLSI applications ⋮ Using Normal Bases for Compact Hardware Implementations of the AES S-Box ⋮ Об эксплуатационных качествах одного перспективного блочного шифра типа LSX ⋮ Robust Encryption, Revisited ⋮ How Fast Can Higher-Order Masking Be in Software? ⋮ Higher-Order Masking in Practice: A Vector Implementation of Masked AES for ARM NEON ⋮ Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions ⋮ Cryptanalysis of CLEFIA Using Differential Methods with Cache Trace Patterns ⋮ A Fast and Cache-Timing Resistant Implementation of the AES ⋮ Exploring Energy Efficiency of Lightweight Block Ciphers ⋮ Efficient systolic multiplications in composite fields for cryptographic systems ⋮ Cancellation-free circuits in unbounded and bounded depth ⋮ Implementing Grover oracles for quantum key search on AES and LowMC
This page was built for publication: