All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

9 890 (0,132s)

Result

A Method for Generating the Multiplicative Inverse over a Finite Field GF(p)

The essence of the Invention is an effective method for generating the multiplicative inverse in a finite field GF(p) where p is prime, i.e. for generating the modular inverse. This method is derived from the Extended Eucli...

JC - Počítačový hardware a software

  • 2005
  • P
Result

Algorithm for Computing Modular Inverse Using the Montgomery Almost Inverse Hardware Implementation

We deal with design of algorithm for computation of modular inverse using the AMI and its hardware implementation in FPGA.

JC - Počítačový hardware a software

  • 2003
  • A
Result

How Children and prospective Teachers aditive and multiplikative Twins discover

It is described, how the children/prospective teachers discover the additive and multiplicative twins and which obstacles they must overcome. Two numbers are additive twins iff their sum and the sum of their symmetrical numbers are equal. The multipl...

AM - Pedagogika a školství

  • 2002
  • D
Result

Improved Hardware Architecture for Computing the Modular Inverse Using AMI

This paper concerns a hardware implementation of an algorithm for computing the ordinary multiplicative modular inverse in GF(p).

JC - Počítačový hardware a software

  • 2003
  • D
Result

Improved Hardware Architecture for Computing the Modular Inverse Using AMI

This paper concerns a hardware implementation of an algorithm for computing the ordinery multiplicative modular inverse in GF(p).

JC - Počítačový hardware a software

  • 2003
  • A
Result

Hardware Architecture for Computing the Modular Inverse

Not available...

JC - Počítačový hardware a software

  • 2003
  • D
Result

Subtraction Free Almost Montgomery Inverse in ASIC and FPGA

Computation of the multiplicative modular inverse is a frequently used operation that forms a part of various cryptographic algorithms. This paper summarizes our efforts to develop a fast and hardware-efficient algorithm for Almost ...

JC - Počítačový hardware a software

  • 2006
  • D
Result

Ordinary Modular Inverse Using AMI - Hardware Implementation

Not available...

JC - Počítačový hardware a software

  • 2003
  • D
Result

FPGA Implementation of Ordinary Modular Inverse Calculation Using AMI

We present an FPGA implementation of an algoritm for computing the modular multiplicative inverse over a finite field GF (p).

JC - Počítačový hardware a software

  • 2003
  • D
Result

New Algorithm for Classical Modular Inverse

Not available...

JC - Počítačový hardware a software

  • 2002
  • D
  • 1 - 10 out of 9 890