• Publications
  • Influence
Analyzing and comparing Montgomery multiplication algorithms
Montgomery multiplication methods constitute the core of modular exponentiation, the most popular operation for encrypting and signing digital data in public-key cryptography. In this article, weExpand
  • 555
  • 43
  • Open Access
Montgomery Multiplication in GF(2k)
We show that the multiplication operation c=a · b · r-1 in the field GF(2k can be implemented significantly faster in software than the standard multiplication, where r is a special fixed element ofExpand
  • 292
  • 37
  • Open Access
Affine Pairings on ARM
We report on relative performance numbers for affine and projective pairings on a dual-core Cortex A9 ARM processor. Using a fast inversion in the base field and doing inversion in extension fieldsExpand
  • 27
  • 7
  • Open Access
Cryptographic Agility and Its Relation to Circular Encryption
We initiate a provable-security treatment of cryptographic agility. A primitive (for example PRFs, authenticated encryption schemes or digital signatures) is agile when multiple, individually secureExpand
  • 65
  • 3
  • Open Access
Fast software exponentiation in GF(2/sup k/)
  • Ç. K. Koç, Tolga Acar
  • Mathematics, Computer Science
  • Proceedings 13th IEEE Sympsoium on Computer…
  • 6 March 1997
The authors present a new algorithm for computing a/sup e/ where a/spl isin/GF(2/sup k/) and e is a positive integer. The proposed algorithm is more suitable for implementation in software, andExpand
  • 17
  • 2
  • Open Access
Montgomery Multiplication in Gf2
We show that the multiplication operation c = a br ,1 in the eld GF2 k can be implemented signiicantly faster in software than the standard multiplication, where r is a special xed element of theExpand
  • 8
  • 2
  • Open Access
Montgomery Multplication in GF(2k)
  • 28
  • 1
Blind MIMO System Estimation Based on PARAFAC Decomposition of Higher Order Output Tensors
We present a novel framework for the identification of a multiple-input multiple-output (MIMO) system driven by white, mutually independent unobservable inputs. Samples of the system frequencyExpand
  • 26
  • 1
  • Open Access
Accumulators and U-Prove Revocation
This work introduces the most efficient universal accumulator known today. For the first time, we have an accumulator which does not depend on hidden order groups, does not require anyExpand
  • 16
  • 1
  • Open Access
Modular Reduction without Pre-computation for Special Moduli
We present Montgomery modular multiplication algorithms for special moduli that do not require the pre-computation step. We generalize previous approaches and remove pre-computation steps where theExpand
  • 13
  • 1
  • Open Access