Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
MLQ
2010
148views more  MLQ 2010»
10 years 9 months ago
Abelian groups and quadratic residues in weak arithmetic
We investigate the provability of some properties of abelian groups and quadratic residues in variants of bounded arithmetic. Specifically, we show that the structure theorem for...
Emil Jerábek
COMBINATORICS
2006
105views more  COMBINATORICS 2006»
10 years 10 months ago
Edge-Magic Group Labellings of Countable Graphs
We investigate the existence of edge-magic labellings of countably infinite graphs by abelian groups. We show for that for a large class of abelian groups, including the integers ...
Nicholas J. Cavenagh, Diana Combe, Adrian M. Nelso...
CIE
2010
Springer
10 years 10 months ago
Computable Ordered Abelian Groups and Fields
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
Alexander G. Melnikov
QCQC
1998
Springer
110views Communications» more  QCQC 1998»
11 years 2 months ago
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
Abstract. A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and hidden ...
Michele Mosca, Artur Ekert
LICS
2003
IEEE
11 years 3 months ago
Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
Hubert Comon-Lundh, Vitaly Shmatikov
RTA
2005
Springer
11 years 4 months ago
Intruder Deduction for AC-Like Equational Theories with Homomorphisms
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
Pascal Lafourcade, Denis Lugiez, Ralf Treinen
EUROCRYPT
2005
Springer
11 years 4 months ago
The RSA Group is Pseudo-Free
We prove, under the strong RSA assumption, that the group of invertible integers modulo the product of two safe primes is pseudo-free. More specifically, no polynomial time algor...
Daniele Micciancio
books