A note on the average number of RSA fixed points
نویسندگان
چکیده
منابع مشابه
a note on fixed points of automorphisms of infinite groups
motivated by a celebrated theorem of schur, we show that if~$gamma$ is a normal subgroup of the full automorphism group $aut(g)$ of a group $g$ such that $inn(g)$ is contained in $gamma$ and $aut(g)/gamma$ has no uncountable abelian subgroups of prime exponent, then $[g,gamma]$ is finite, provided that the subgroup consisting of all elements of $g$ fixed by $gamma$ has finite index. so...
متن کاملA Note on Lattices and Fixed Points
We define complete lattices, and discuss the existence and construction of fixed points of monotone functions on these lattices. We also demonstrate how these results can be used for solving equational systems.
متن کاملOn Fixed Points of Order K of RSA
In this paper, we gave a preliminary dynamical analysis on the RSA cryptosystem and obtained a computational formulae of the number of the fixed points of k order of the RSA. Thus, the problem in [8, 9] has been solved.
متن کاملA note on the Roman domatic number of a digraph
Roman dominating function} on a digraph $D$ with vertex set $V(D)$ is a labeling$fcolon V(D)to {0, 1, 2}$such that every vertex with label $0$ has an in-neighbor with label $2$. A set ${f_1,f_2,ldots,f_d}$ ofRoman dominating functions on $D$ with the property that $sum_{i=1}^d f_i(v)le 2$ for each $vin V(D)$,is called a {em Roman dominating family} (of functions) on $D$....
متن کاملOn the fixed number of graphs
A set of vertices $S$ of a graph $G$ is called a fixing set of $G$, if only the trivial automorphism of $G$ fixes every vertex in $S$. The fixing number of a graph is the smallest cardinality of a fixing set. The fixed number of a graph $G$ is the minimum $k$, such that every $k$-set of vertices of $G$ is a fixing set of $G$. A graph $G$ is called a $k$-fixed graph, if its fix...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.03.013