Notation: What does $bf{Z}^*_R$ mean in the context of groups?












0












$begingroup$


I recently stumbled upon the following definition for a hash function:




To get this we define $hat{h}=hat{h}_{r}: {{0,1}}^* rightarrow {bf Z}_R$
as follows:
$$ hat{h}_r(m) = ({sum_{i=1}^{k} m_i cdot r^{i-1}}) bmod R $$
where $R$ is a 161-bit prime, $r$ (the key of $hat{h}$) is a uniformly distributed
element in ${bf Z}_{R}^*, [...]$




Source: http://www.wisdom.weizmann.ac.il/~naor/p_r_func/pr/pr.html



As far as I understand, $textbf{Z}_R$ is the additive group of integers $mod R$. Is this the case?



If so, then what is $textbf{Z}^*_R$?










share|cite|improve this question









$endgroup$












  • $begingroup$
    It's the group of invertibles of $mathbb{Z}_R$: en.wikipedia.org/wiki/Unit_(ring_theory) In case when $R$ is prime it is simply $mathbb{Z}_Rbackslash{0}$.
    $endgroup$
    – freakish
    Jan 24 at 16:50












  • $begingroup$
    Thank you, that answered the question :)
    $endgroup$
    – CryptoFan
    Jan 24 at 16:52










  • $begingroup$
    It's a theorem that $mathbf{Z}_R^*$ is cyclic if $R$ is prime. (This is often exploited by simple random number generators - see Knuth, The Art of Computer Programming, Vol.2?.)
    $endgroup$
    – user1729
    Jan 24 at 17:19


















0












$begingroup$


I recently stumbled upon the following definition for a hash function:




To get this we define $hat{h}=hat{h}_{r}: {{0,1}}^* rightarrow {bf Z}_R$
as follows:
$$ hat{h}_r(m) = ({sum_{i=1}^{k} m_i cdot r^{i-1}}) bmod R $$
where $R$ is a 161-bit prime, $r$ (the key of $hat{h}$) is a uniformly distributed
element in ${bf Z}_{R}^*, [...]$




Source: http://www.wisdom.weizmann.ac.il/~naor/p_r_func/pr/pr.html



As far as I understand, $textbf{Z}_R$ is the additive group of integers $mod R$. Is this the case?



If so, then what is $textbf{Z}^*_R$?










share|cite|improve this question









$endgroup$












  • $begingroup$
    It's the group of invertibles of $mathbb{Z}_R$: en.wikipedia.org/wiki/Unit_(ring_theory) In case when $R$ is prime it is simply $mathbb{Z}_Rbackslash{0}$.
    $endgroup$
    – freakish
    Jan 24 at 16:50












  • $begingroup$
    Thank you, that answered the question :)
    $endgroup$
    – CryptoFan
    Jan 24 at 16:52










  • $begingroup$
    It's a theorem that $mathbf{Z}_R^*$ is cyclic if $R$ is prime. (This is often exploited by simple random number generators - see Knuth, The Art of Computer Programming, Vol.2?.)
    $endgroup$
    – user1729
    Jan 24 at 17:19
















0












0








0





$begingroup$


I recently stumbled upon the following definition for a hash function:




To get this we define $hat{h}=hat{h}_{r}: {{0,1}}^* rightarrow {bf Z}_R$
as follows:
$$ hat{h}_r(m) = ({sum_{i=1}^{k} m_i cdot r^{i-1}}) bmod R $$
where $R$ is a 161-bit prime, $r$ (the key of $hat{h}$) is a uniformly distributed
element in ${bf Z}_{R}^*, [...]$




Source: http://www.wisdom.weizmann.ac.il/~naor/p_r_func/pr/pr.html



As far as I understand, $textbf{Z}_R$ is the additive group of integers $mod R$. Is this the case?



If so, then what is $textbf{Z}^*_R$?










share|cite|improve this question









$endgroup$




I recently stumbled upon the following definition for a hash function:




To get this we define $hat{h}=hat{h}_{r}: {{0,1}}^* rightarrow {bf Z}_R$
as follows:
$$ hat{h}_r(m) = ({sum_{i=1}^{k} m_i cdot r^{i-1}}) bmod R $$
where $R$ is a 161-bit prime, $r$ (the key of $hat{h}$) is a uniformly distributed
element in ${bf Z}_{R}^*, [...]$




Source: http://www.wisdom.weizmann.ac.il/~naor/p_r_func/pr/pr.html



As far as I understand, $textbf{Z}_R$ is the additive group of integers $mod R$. Is this the case?



If so, then what is $textbf{Z}^*_R$?







group-theory notation






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Jan 24 at 16:46









CryptoFanCryptoFan

1




1












  • $begingroup$
    It's the group of invertibles of $mathbb{Z}_R$: en.wikipedia.org/wiki/Unit_(ring_theory) In case when $R$ is prime it is simply $mathbb{Z}_Rbackslash{0}$.
    $endgroup$
    – freakish
    Jan 24 at 16:50












  • $begingroup$
    Thank you, that answered the question :)
    $endgroup$
    – CryptoFan
    Jan 24 at 16:52










  • $begingroup$
    It's a theorem that $mathbf{Z}_R^*$ is cyclic if $R$ is prime. (This is often exploited by simple random number generators - see Knuth, The Art of Computer Programming, Vol.2?.)
    $endgroup$
    – user1729
    Jan 24 at 17:19




















  • $begingroup$
    It's the group of invertibles of $mathbb{Z}_R$: en.wikipedia.org/wiki/Unit_(ring_theory) In case when $R$ is prime it is simply $mathbb{Z}_Rbackslash{0}$.
    $endgroup$
    – freakish
    Jan 24 at 16:50












  • $begingroup$
    Thank you, that answered the question :)
    $endgroup$
    – CryptoFan
    Jan 24 at 16:52










  • $begingroup$
    It's a theorem that $mathbf{Z}_R^*$ is cyclic if $R$ is prime. (This is often exploited by simple random number generators - see Knuth, The Art of Computer Programming, Vol.2?.)
    $endgroup$
    – user1729
    Jan 24 at 17:19


















$begingroup$
It's the group of invertibles of $mathbb{Z}_R$: en.wikipedia.org/wiki/Unit_(ring_theory) In case when $R$ is prime it is simply $mathbb{Z}_Rbackslash{0}$.
$endgroup$
– freakish
Jan 24 at 16:50






$begingroup$
It's the group of invertibles of $mathbb{Z}_R$: en.wikipedia.org/wiki/Unit_(ring_theory) In case when $R$ is prime it is simply $mathbb{Z}_Rbackslash{0}$.
$endgroup$
– freakish
Jan 24 at 16:50














$begingroup$
Thank you, that answered the question :)
$endgroup$
– CryptoFan
Jan 24 at 16:52




$begingroup$
Thank you, that answered the question :)
$endgroup$
– CryptoFan
Jan 24 at 16:52












$begingroup$
It's a theorem that $mathbf{Z}_R^*$ is cyclic if $R$ is prime. (This is often exploited by simple random number generators - see Knuth, The Art of Computer Programming, Vol.2?.)
$endgroup$
– user1729
Jan 24 at 17:19






$begingroup$
It's a theorem that $mathbf{Z}_R^*$ is cyclic if $R$ is prime. (This is often exploited by simple random number generators - see Knuth, The Art of Computer Programming, Vol.2?.)
$endgroup$
– user1729
Jan 24 at 17:19












0






active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3086105%2fnotation-what-does-bfz-r-mean-in-the-context-of-groups%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3086105%2fnotation-what-does-bfz-r-mean-in-the-context-of-groups%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

MongoDB - Not Authorized To Execute Command

in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith

How to fix TextFormField cause rebuild widget in Flutter