Take the 2-minute tour ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

In general it's hard to calculate the roots of a given polynomial P(x). But the other way back calculating the coefficients is much easier (Vieta's formulas).

If this is a one-way function, is it possible to create a public-key cryptosystem based on these facts? Or does it already exist?

share|improve this question
5  
Actually, it is easy to compute the roots of a polynomial $P(x)$ defined over a finite field. –  poncho Mar 19 at 16:58
1  
Ok, but what about non-finite fields? –  RomeoAndJuliet Mar 19 at 17:07
7  
With an infinite field, $P(x)$ may not be expressible in a fixed number of bits (or, depending on the field, even a bounded number of bits). That puts rather a crimp in the cryptographical applications. –  poncho Mar 19 at 17:44
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.