Re: Public Key, Symbolic Calculation

From: Kiuhnm (kiuhnm03_at_yahoo.it.invalid)
Date: 02/08/05 

Date: Tue, 08 Feb 2005 18:11:25 GMT

tomstdenis@gmail.com wrote:
> You do realize this will get unwieldly complicated to work with as the
> polynomial grows right? I can't imagine this scheme [which you really
> haven't described how it works in detail] being any more efficient than
> RSA or ECC.

With polynomials, you only perform simple multiplications and additions.
For example, you can compute x, x^2, x^3, x^4, ... very easily. No
exponentiations are required.

Kiuhnm

Relevant Pages

  • Re: Computer integer division
    ... > You do it by synthetic division of polynomials. ... Imagine you have a ...
    (sci.math.num-analysis)
  • decomposition of polynomials
    ... solutions to find polynomials g and h over Z such that f=gh ... But I have never seen solutions to the problem ... imagine either. ... Helmut Richter ...
    (sci.math)
  • Re: Public Key, Symbolic Calculation
    ... Kiuhnm wrote: ... >> polynomial must belong to a group, ring or field to be ... [e.g. give us real polynomials to work with]. ...
    (sci.crypt)
  • Re: Public Key, Symbolic Calculation
    ... Kiuhnm wrote: ... >Let A, B, p, M be polynomials: ... >p is the public key, ... >We create p and R (what is the best and most secure method?). ...
    (sci.crypt)
Quantcast