1 citations · 2 across the 24 of their papers we have counts for
6 papers · 1 filter
Subsets of groups in public-key cryptography
André Carvalho, António Malheiro
We suggest the usage of algebraic subsets instead of subgroups in public-key cryptography. In particular, we present the subset version of two protocols introduced by Shpilrain and…
Computing centralizers in [f.g. free]-by-cyclic groups
André Carvalho
We prove that centralizers of elements in [f.g. free]-by-cyclic groups are computable. As a corollary we get that, given two conjugate elements in a [f.g. free]-by-cyclic group, th…
Decidability of the Brinkmann Problems for endomorphisms of the free group
André Carvalho, Jordi Delgado
We show that both the Brinkmann Problem (BrP) and the Brinkmann Conjugacy Problem (BrCP) are decidable for endomorphisms of the free group Fn.
On the dynamics of endomorphisms of the direct product of two free groups
André Carvalho
We prove that Brinkmann's problems are decidable for endomorphisms of : given and , it is decidable wh…
Quantifying Brinkmann's problem: relative -order and -spectrum
André Carvalho
We prove that the stable image of an endomorphism of a virtually free group is computable. For an endomorphism , an element and a subset , we say that the…
On the intersection of fixed subgroups of
André Carvalho
We prove that, although it is undecidable if a subgroup fixed by an automorphism intersects nontrivially an arbitrary subgroup of , there is an algorithm that, takin…