M. Knezevic

Publications81
h-index15
Citations2,122
Highly Influential Citations226
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • I. Verbauwhede
  • 514 Publications, 17,617 Citations
  • C. Paar
  • 423 Publications, 18,422 Citations
  • V. Rijmen
  • 267 Publications, 13,701 Citations
  • G. Leander
  • 152 Publications, 7,293 Citations
  • Publications
  • Influence
KATAN and KTANTAN - A Family of Small and Efficient Hardware-Oriented Block Ciphers
TLDR
In this paper we propose a new family of very efficient hardware oriented block ciphers divided into two flavors. Expand
  • 648
  • 77
  • PDF
PRINCE - A Low-latency Block Cipher for Pervasive Computing Applications (Full version)
  • 191
  • 42
spongent: A Lightweight Hash Function
TLDR
This paper proposes spongent - a family of lightweight hash functions with hash sizes of 88 (for preimage resistance only), 128, 160, 224, and 256 bits based on a sponge construction instantiated with a present-type permutation, following the hermetic sponge strategy. Expand
  • 268
  • 33
  • PDF
PRINCE - A Low-Latency Block Cipher for Pervasive Computing Applications - Extended Abstract
TLDR
This paper presents a block cipher that is optimized with respect to latency with a very competitive chip area compared to known solutions. Expand
  • 386
  • 31
  • PDF
Fides: Lightweight Authenticated Cipher with Side-Channel Resistance for Constrained Hardware
TLDR
We present a novel lightweight authenticated cipher optimized for hardware implementations called Fides. Expand
  • 87
  • 8
  • PDF
SPONGENT: The Design Space of Lightweight Cryptographic Hashing
TLDR
We explore the design space of lightweight hash functions based on the sponge construction instantiated with present-type permutations. Expand
  • 79
  • 8
  • PDF
Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods
TLDR
This paper proposes two improved interleaved modular multiplication algorithms based on Barrett and Montgomery modular reduction. Expand
  • 49
  • 7
  • PDF
Fair and Consistent Hardware Evaluation of Fourteen Round Two SHA-3 Candidates
TLDR
We propose a platform, a design strategy, and evaluation criteria for a fair and consistent hardware evaluation of the second-round SHA-3 candidates. Expand
  • 45
  • 4
  • PDF
Prototyping platform for performance evaluation of SHA-3 candidates
TLDR
The objective of the SHA-3 NIST competition is to select, from multiple competing candidates, a standard algorithm for cryptographic hashing. Expand
  • 22
  • 3
  • PDF
Low-Latency ECDSA Signature Verification—A Road Toward Safer Traffic
TLDR
An application-specified integrated circuit implementation of a dedicated ECDSA verification engine that can reach verification rates of up to 27 000 verifications per second, which is by far the fastest implementation on a single core reported in the literature. Expand
  • 25
  • 2
  • PDF