Ring Cardinal?
 

Hi,

I 'm working on cyclic functions like the power mod in the RSA:
y=y^e mod n give cycling results

The Floyd theorem says when you have make on rotation but don't give the size ou the ring (I call it RC Ring Cardinal)
Is there a method to find it (with e and N of course)
or an approximation?
Thanks

[QUOTE=JohnFullspeed;262340]Hi,

I 'm working on cyclic functions like the power mod in the RSA:
y=y^e mod n give cycling results

The Floyd theorem says when you have make on rotation but don't give the size ou the ring (I call it RC Ring Cardinal)
Is there a method to find it (with e and N of course)
or an approximation?
Thanks[/QUOTE]

I will be gracious and assume that your native language is not English.

However, you are still violating a major rule. This violation earns
a lot of points on the crank-o-meter: Don't try to invent your
own terminology.

However, even in my most general interpretation of what you are
saying I can not discern what you are asking. Please clarify.
When you ask about finding "it", it is not clear what "it" is.

If you are looking for fixed points, Floyd's algorithm will require
O(sqrt(S)) iterations where S is the size of the largest multiplicative
cyclic subgroup of Z/NZ.

Sorry
 

Sorry to don't practice your English: perhaps I can post in French and other Useers make the translation

I think that before to give a lesson you can join me. In France it's so and perhaps I can explain you thet Im blind,dont heard, cannot move and walk
The only communication is the c omputer(in french)
I need one hour to do a post. thanks dont like them


[URL]http://www.ataxia.org/learn/ataxia-diagnosis.aspx[/URL]

I'm still alive and I'm interessing by prme number sorry to not be an English accademician. Soirry to post
you understand my question but yuou an,swer that you can goive the complexity of the FFlod method .
You also have an ACS Ataxie Spyno Cerebeleuse ?


So for the other user I need to know the cardinal of a cycling logarithm like the RSA
French

Je travaiile sur les fonctions cycliques et cherche a connaitree la taille de cycles. J'ai etudie la methode de Floyd mais elle permet juiste de savoir si on a fait un tour pas sa taille
Merci à tous

John


Have a good day....

[QUOTE=JohnFullspeed;262376]Sorry to don't practice your English: perhaps I can post in French and other Useers make the translation

I think that before to give a lesson you can join me. In France it's so and perhaps I can explain you thet Im blind,dont heard, cannot move and walk
The only communication is the c omputer(in french)
I need one hour to do a post. thanks dont like them


[URL]http://www.ataxia.org/learn/ataxia-diagnosis.aspx[/URL]

I'm still alive and I'm interessing by prme number sorry to not be an English accademician. Soirry to post
you understand my question but yuou an,swer that you can goive the complexity of the FFlod method .
You also have an ACS Ataxie Spyno Cerebeleuse ?


So for the other user I need to know the cardinal of a cycling logarithm like the RSA
French

Je travaiile sur les fonctions cycliques et cherche a connaitree la taille de cycles. J'ai etudie la methode de Floyd mais elle permet juiste de savoir si on a fait un tour pas sa taille
Merci à tous

John


Have a good day....[/QUOTE]

Pardonnez-moi. Je parle francais un peux, mais pas tres bien. Je n'avais pas
etudier francais depuis trent-sept annees.

If S is the size of the largest cyclic group, then the algorithm
requires O(sqrt(S)) iterations. The length of the tail is also O(sqrt(S)).
One can not say more, because the exact tail length and number of
iterations is determined by a random starting value.

Note that S = [tex]\lambda(N)[/tex] where lambda is the Carmichael function.

[QUOTE=R.D. Silverman;262378]Pardonnez-moi. Je parle francais un peux, mais pas tres bien. Je n'avais pas
etudier francais depuis trent-sept annees.

If S is the size of the largest cyclic group, then the algorithm
requires O(sqrt(S)) iterations. The length of the tail is also O(sqrt(S)).
One can not say more, because the exact tail length and number of
iterations is determined by a random starting value.

Note that S = [tex]\lambda(N)[/tex] where lambda is the Carmichael function.[/QUOTE]

took me 3 spelling corrections from my extremely limited knowledge of French I was able to figure it out to:

[QUOTE]I work on cyclic functions and seeks to know the size of cycles. I studied the method of Floyd but it just allows to know if it was not a round size
Thank you all[/QUOTE]

still pretty good for blind and deaf if I read correctly.

[QUOTE=science_man_88;262379]took me 3 spelling corrections from my extremely limited knowledge of French I was able to figure it out to:



still pretty good for blind and deaf if I read correctly.[/QUOTE]

best rewording I can get by hand ( on the english I got back) is:

I am working on cyclic functions and I want to know how to get the size of cycles. I've studied the Floyd's method but it only tells how to know if it was not a round size
Thank you all

Who is JohnFullspeed?
 

who i'm.

I never go to university I not ended HighSchool so i'm
more then bad in mlath: I don't know wha is a Log...
I dont understand:

Note that S = lambda(N) where lambda is the Carmichael function.
I do'nt know how to read the complexity

But no matter : I hace a son at home 25 years: informatic ingeniuerr, two Master on architecure processor
He work for the US Amy reprogrammoinng spy statellite

I'm a specialist of speed on computer. It's not easy to saidd it but for example I find a speed new method to ccompute primes using atb start Erastjhhtène sieve...
I need YOUR JOB to write code
I have probably write the most speed Sudoku solver
I find but I cannot prove it why you can not have less than 17 'revelés' in a sudoku....

Give me the RSA 768(Congratulatiopns) and I think that I can divide the time by two WITHOUT fcanging the logic just the code.

I have make a RSA attack on the 'log discret
Before to publish it I have a little problem with the ring
(my question: I devellop a method but perhaps there is better solutions))

I find a soluce to go back to small key (2^32) un facvtorisable with the RSA. But the RSA laboratory don't answer(6 messages) so perhaps they read this forum factoring
and they contact me. Therafore I publish the attaq and perhaps I will havee an answer

So it' clear that I never think that the job of other is bad but I think that you are not informatcian but mathemetician and perhaps I can help you in your reseach

I Work in Pascal and a little in ASM , on Windows XP so in 32 bits
I have a INTEL core 2 at 2.4, 2 Giga of RAM
but I have also 3 sons and a daughter.
The ataxi begin when I was 35 . Before I have a 'normal life: I have been a military.

I go back to the primes numbers; i find a method for Twin I must try it

John

Who is JohnFullspeed?
 

who i'm.

I never go to university I not ended HighSchool so i'm
more then bad in mlath: I don't know wha is a Log...
I dont understand:

Note that S = lambda(N) where lambda is the Carmichael function.
I do'nt know how to read the complexity

But no matter : I hace a son at home 25 years: informatic ingeniuerr, two Master on architecure processor
He work for the US Amy reprogrammoinng spy statellite

I'm a specialist of speed on computer. It's not easy to saidd it but for example I find a speed new method to ccompute primes using atb start Erastjhhtène sieve...
I need YOUR JOB to write code
I have probably write the most speed Sudoku solver
I find but I cannot prove it why you can not have less than 17 'revelés' in a sudoku....

Give me the RSA 768(Congratulatiopns) and I think that I can divide the time by two WITHOUT fcanging the logic just the code.

I have make a RSA attack on the 'log discret
Before to publish it I have a little problem with the ring
(my question: I devellop a method but perhaps there is better solutions))

I find a soluce to go back to small key (2^32) un facvtorisable with the RSA. But the RSA laboratory don't answer(6 messages) so perhaps they read this forum factoring
and they contact me. Therafore I publish the attaq and perhaps I will havee an answer

So it' clear that I never think that the job of other is bad but I think that you are not informatcian but mathemetician and perhaps I can help you in your reseach

I Work in Pascal and a little in ASM , on Windows XP so in 32 bits
I have a INTEL core 2 at 2.4, 2 Giga of RAM
but I have also 3 sons and a daughter.
The ataxi begin when I was 35 . Before I have a 'normal life: I have been a military.

I go back to the primes numbers; i find a method for Twin I must try it

John


Some times my message have to many mistake so the mederator edit them and make them good. No matter for me.
I 'm thre first to laugth of my ataxi but please try to forget it:

Merci a tous

John