Show Posts

This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.

Messages - D4rk$!d3

Pages: [1]

Beginner's Corner / Career

« on: July 12, 2015, 06:03:47 PM »

I may sound like a noob, but I am quite sorry for that. My question is, how do I become a good Cyber-security Researcher and what are the degrees I would be requiring after completing my B.Tech ? I have been personally dedicating time on learning how to code (C, C++, C#, Python and Assembly Language Ofcourse !!) and in my final year I plan to cover concepts on Operating Systems, Networking and stuff.....And is it okay if I start my career as a developer ?? .Please help me out guys, your responses are most welcome....
P.S :: Googled a lot but I am still confused

Beginner's Corner / Re: Algorithm

« on: June 30, 2015, 04:04:15 PM »

Code: [Select]

int modExp(int b, int e, int m){int remainder;int x = 1;while (e != 0){remainder = e % 2;e= e/2;if (remainder == 1)x = (x * b) % m;b= (b * b) % m; // New base equal b^2 % m} return x;
}

Beginner's Corner / Re: Algorithm

« on: June 30, 2015, 03:59:11 PM »

Quote from: reqq456 on June 29, 2015, 02:11:54 AM

I don't know of which dimension you are speaker if you say very very big.

But haskell is fast in that one:
Code: [Select]
Prelude> mod (10240000^10240000) 560 400 (3.22 secs, 546365816 bytes)
If I add another 0 it takes much longer :/
Code: [Select]
Prelude> mod (102400000^102400000) 560 480 (44.51 secs, 5975936856 bytes)

Oops, Sorry I wanted the algorithm for the C++ language...! Haskell ? No Idea dude !

Beginner's Corner / Algorithm

« on: June 28, 2015, 09:03:12 PM »

a,b,c are long long int datatypes. How do I solve (a^b)%c in a really efficient manner and in the fastest possible way ?

Assembly - Embedded / Re: Assembly tutorials and links

« on: May 30, 2015, 08:22:58 PM »

For those who haven't downloaded it yet. Or if you want to go deeper...

Pages: [1]