Quantum Property Testing
A language $L$ has a property tester if there exists a probabilistic algorithm that given an input $x$ queries only a small number of bits of $x$ and distinguishes the cases as to whether $x$ is in $...
A language $L$ has a property tester if there exists a probabilistic algorithm that given an input $x$ queries only a small number of bits of $x$ and distinguishes the cases as to whether $x$ is in $...
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
We present an improved “cooling schedule” for simulated annealing algorithms for combinatorial counting problems. Under our new schedule the rate of cooling accelerates as the temperature...
We present an improved “cooling schedule” for simulated annealing algorithms for combinatorial counting problems. Under our new schedule the rate of cooling accelerates as the temperature...
You are not logged in to this journal. Log in
Compression in Finite Fields and Torus-Based Cryptography
SIAM J. Comput. Volume 37, Issue 5, pp. 1401-1428 (2008)
Published January 18, 2008
Connotea
CiteULike
del.icio.us
BibSonomy
We present efficient compression algorithms for subgroups of multiplicative groups of finite fields, we use our compression algorithms to construct efficient public key cryptosystems called $\T_2$ and CEILIDH, we disprove some conjectures, and we use the theory of algebraic tori to give a better understanding of our cryptosystems, the Lucas-based, XTR, and Gong–Harn cryptosystems, and conjectured generalizations.
©2008 Society for Industrial and Applied Mathematics| History: | Received November 28, 2006; accepted July 9, 2007; published January 18, 2008 |
| Permalink: | http://dx.doi.org/10.1137/060676155 |
KEYWORDS and AMS
94A60, 68P25, 14G50, 11T71
PUBLICATION DATA
0097-5397 (print)
1095-7111 (online)
SIAM