Aadarshhh
Anonymous
The naiv implememtation is a good starting point to understand real world implementations
Ariana
Choose 2 random primes, p,q(here just use like 20ish probabilistic tests)
Let n=pq, then φ(n)=(p-1)(q-1)
Let e=a fermat prime is usually preferred, any number usually work though
Find d such that de=1 mod φ(n), check if 64d^4>N, if so choose another e(to prevent wiener attack)
To encrypt do
m^e mod n
To decrypt do
c^d mod n
Modular exponential can be done in log(n) time, it’s basically square and multiply
In the real world, chinese remainder theorem can be used to speed the exponentiation up
There are many other attacks to beware off, to list a few:
Related message(several similar messages, usually differing by a linear term) reuse(with different n, exponent) or coppersmith short pad attack
Rsa bit decryption oracle(like if one of the bits for the decrypted msg is used to check for something, the whole msg can be decrypted)
Blinding(forging messages)
Small private exponent attack(wiener)
Timing attacks
Fault attacks(just one error in decryption can reveal the private key)
Side channel attack(if you use vanilla rsa it is extremely easy to get the exponent during exponentiation by looking at the total power taken by the machine)
For pkcs1 theres this fancy attack which tbh i cant rlly understand called the Bleichenbacher attack
Anonymous
Hm
Anonymous
I've seen chinese guys implementing there own DES while reversing android apps
Anonymous
They used the word "public key" in the implementation. And it was absolutly broken xD Don't use your own crypto
Anonymous
It was a weird mix of DES and asymmetric crypto
Ariana
lol des
Anonymous
Yeee
Ariana
Choose 2 random primes, p,q(here just use like 20ish probabilistic tests)
Let n=pq, then φ(n)=(p-1)(q-1)
Let e=a fermat prime is usually preferred, any number usually work though
Find d such that de=1 mod φ(n), check if 64d^4>N, if so choose another e(to prevent wiener attack)
To encrypt do
m^e mod n
To decrypt do
c^d mod n
Modular exponential can be done in log(n) time, it’s basically square and multiply
In the real world, chinese remainder theorem can be used to speed the exponentiation up
There are many other attacks to beware off, to list a few:
Related message(several similar messages, usually differing by a linear term) reuse(with different n, exponent) or coppersmith short pad attack
Rsa bit decryption oracle(like if one of the bits for the decrypted msg is used to check for something, the whole msg can be decrypted)
Blinding(forging messages)
Small private exponent attack(wiener)
Timing attacks
Fault attacks(just one error in decryption can reveal the private key)
Side channel attack(if you use vanilla rsa it is extremely easy to get the exponent during exponentiation by looking at the total power taken by the machine)
For pkcs1 theres this fancy attack which tbh i cant rlly understand called the Bleichenbacher attack
> i think rsa is safe
Anonymous
Best app I ever decompiled
Ariana
https://www.youtube.com/watch?v=dcR1dkZJ7iU
rsa in assembly
Anonymous
Noice
Anonymous
Yea ThanQ
Anonymous
Please send me some c++ essentials
Anonymous
I want to learn coding
Anonymous
‘m fresher here
Dima
I can give you the first assignment
Dima
it’s super essential
Dima
www.google.com
Dima
Anonymous
I'll give up and just ask basic questions everywhere
Friend
I am also a beginner in c++
Friend
Help me to do a better coding
Dima
Friend
What is this
disrupt_the_flow
Friend
Nothing inside
Friend
I thik its a c/c++ programming courses group
Anonymous
You think wrong
kapil
Hi, can anyone recommend a good book for C? Better if its For BCA student (optional) . Also better if its with lot of examples. I learn Better with examples. Very basic concepts are clear. Have to start from array.
Arrays are bit familiar as well. But i feel like i need to understand it better. Feel like i don't yet understand arrays like i should. Loops, if else statements and basics before array are clear enough.
I already bought hard copy of let us c by yashwant kanetkar. Is that enough? or should i also buy some other book as well.
Ariana
whats that book lol
^being brutally honest
kapil
Its, let us c. Not, let us learn c. My mistake.. Edited
Here is the link
https://www.amazon.in/Let-Us-C-Yashavant-Kanetkar/dp/8183331637
Ariana
https://stackoverflow.com/questions/562303/the-definitive-c-book-guide-and-list
klimi
BinaryByter
Ariana
BinaryByter
understanding arrays implies pointers
BinaryByter
for now, its enough to accept that they are a blackbox
Ariana
tru
Ariana
lol etf
Ariana
turbo c
Aakriti kaur
Hello admin
Is JAVA use pointer concept??
Anonymous
Huh, you can understand the idea behind arrays without understanding pointers
Ariana
wtf
Ariana
why
BinaryByter
Ariana
hello admin
Ariana
what
BinaryByter
Ariana
what
klimi
Ariana
Do you know whats java lol
BinaryByter
Aakriti kaur
Zeus
Hey
BinaryByter
klimi
/saved
BinaryByter
How sir?
i said no. not "its possible with black magic"
Anonymous
Saying "you don't need to understand arrays" is big bullshit
klimi
#bingo
klimi
14
Ariana
tho in high lvl arrays arent pointers anymore
klimi
BinaryByter
BinaryByter
Dima
Anonymous
Mat
You don't need to understand :P
Zeus
Hey do u know any array that changes size apart from pointers and lists/vector
Ariana
huh
Ariana
Ok here you need to know wtf is an array
BinaryByter