Polynomial solution to Discrete Logarithm Problem in Interval-valued computing
| dc.contributor.author | Vályi, Sándor | |
| dc.contributor.author | Nagy, Benedek | |
| dc.date.accessioned | 2012-06-05T11:25:18Z | |
| dc.date.available | 2012-06-05T11:25:18Z | |
| dc.date.conferenceend | 2011 | |
| dc.date.conferencestart | 2011 | |
| dc.date.issued | 2012-06-05 | |
| dc.description.abstract | We show that discrete logarithm can be computed in the frame- work of interval-valued computations by a polynomial computation. This new com- puting device is of highly parallel nature: it operates on so-called interval- values which are nite unions of subintervals of [0,1) and constitute an in - nite Boolean algebra. The computation process is modelled in the style of Boolean networks but some non-Boolean operators are also allowed: shifts in both directions and a kind of zooming called product. This paradigm in an restricted form has the computation power of PSPACE as shown in [1] when it is used to decision problems. In [2] it is de ned how interval-valued computa- tions can be used to calculate discrete functions. In that paper the prime factorization was shown to be computable by a quadratic size interval-valued computation. The calculation of discrete logarithm also an important topic of cryptography. In this talk, we demonstrate an analogous result for the calculation of discrete logarithm. | en_US |
| dc.description.city | Debrecen | en_US |
| dc.description.conferencetype | National | en_US |
| dc.identifier.uri | http://hdl.handle.net/123456789/38 | |
| dc.language.iso | en | en_US |
| dc.subject | massively parallel computing | en_US |
| dc.subject | interval-valued computing | en_US |
| dc.subject | cryptography | en_US |
| dc.title | Polynomial solution to Discrete Logarithm Problem in Interval-valued computing | en_US |
| dc.title.conference | 11th Central European Conference on Cryptology | en_US |
| dc.type.class | Lecture | en_US |
| dc.type.specification | Scientific | en_US |