Bem eu so sou programador de c# mas aqui vai uma idea:
um pc com uma placa de satelite com um emulador de chaves:
sintoniza-se por exemplo a sport tv cria-se uma prog que vai testando pares de chaves até encontrar o codigo enquanto nao descobrir nao sai do loop.
é possivel isso?
isto é para os mestres.
se for caso de chaves é claro apenas tem que se ter assim dois xeons com 16 gigs de ram axo que ja faz um gflop, é só uma idea. é o chamado very bruteforce attack.
já me ocorreu a mesma ideia mas como dizem que tambbem mudaram a rsa e esta esta sempre a mudar isso não ajudaria muito ( achar as k***)
Fazes a ideia o número de combinações que existem de keys?
Tu nem com um supercomputador encontravas as chaves num tempo util...
2 xeon com 16 gigas olha que da muita computação matematica ja descobri um zip password em bruteforce com 256 caracteres especiais que da assim um biliao de combinações possiveis. demorou 68 dias.
e se nao fazemos uma vaquinha compramos uma ps3 que tem 9 processadores cell :) so estou a dar ideas.
Boas, e porke não fazer tipo folding?? juntos venceremos...
boas
isso sera como encontrar uma agulha no palheiro ou melhor ainda mais dificil.
a ideia do forcebrut :
4 bytes demorariam 16*256 = 4096 segundos = 68 minutos
5 bytes 68*256=1747 horas = 728 dias
agora imagina o resto a calcular.............isto ja te da uma ideia
MathWorld Headline News
RSA-640 Factored
By Eric W. Weisstein
November 8, 2005--A team at the German Federal Agency for Information Technology Security (BSI) recently announced the factorization of the 193-digit number
310 7418240490 0437213507 5003588856 7930037346 0228427275 4572016194 8823206440 5180815045 5634682967 1723286782 4379162728 3803341547 1073108501 9195485290 0733772482 2783525742 3864540146 9173660247 7652346609
known as RSA-640 (Franke 2005). The team responsible for this factorization is the same one that previously factored the 174-digit number known as RSA-576 (MathWorld headline news, December 5, 2003) and the 200-digit number known as RSA-200 (MathWorld headline news, May 10, 2005).
RSA numbers are composite numbers having exactly two prime factors (i.e., so-called semiprimes) that have been listed in the Factoring Challenge of RSA Security®.
While composite numbers are defined as numbers that can be written as a product of smaller numbers known as factors (for example, 6 = 2 x 3 is composite with factors 2 and 3), prime numbers have no such decomposition (for example, 7 does not have any factors other than 1 and itself). Prime factors therefore represent a fundamental (and unique) decomposition of a given positive integer. RSA numbers are special types of composite numbers particularly chosen to be difficult to factor, and they are identified by the number of digits they contain.
While RSA-640 is a much smaller number than the 7,816,230-digit monster Mersenne prime known as M42 (which is the largest prime number known), its factorization is significant because of the curious property that proving or disproving a number to be prime ("primality testing") seems to be much easier than actually identifying the factors of a number ("prime factorization"). Thus, while it is trivial to multiply two large numbers p and q together, it can be extremely difficult to determine the factors if only their product pq is given. With some ingenuity, this property can be used to create practical and efficient encryption systems for electronic data.
RSA Laboratories sponsors the RSA Factoring Challenge to encourage research into computational number theory and the practical difficulty of factoring large integers and also because it can be helpful for users of the RSA encryption public-key cryptography algorithm for choosing suitable key lengths for an appropriate level of security. A cash prize is awarded to the first person to factor each challenge number.
RSA numbers were originally spaced at intervals of 10 decimal digits between one and five hundred digits, and prizes were awarded according to a complicated formula. These original numbers were named according to the number of decimal digits, so RSA-100 was a hundred-digit number. As computers and algorithms became faster, the unfactored challenge numbers were removed from the prize list and replaced with a set of numbers with fixed cash prizes. At this point, the naming convention was also changed so that the trailing number indicates the number of digits in the binary representation of the number. Hence, RSA-640 has 640 binary digits, which translates to 193 digits in decimal.
While RSA-640 has slightly fewer digits than the previously factored RSA-200, its factorization carries the additional benefit of a cash reward of $20,000 from RSA Laboratories to the team responsible for this feat.
RSA numbers received widespread attention when a 129-digit number known as RSA-129 was used by R. Rivest, A. Shamir, and L. Adleman to publish one of the first public-key messages together with a $100 reward for the message's decryption (Gardner 1977). Despite widespread belief at the time that the message encoded by RSA-129 would take millions of years to break, it was factored in 1994 using a distributed computation that harnessed networked computers spread around the globe performing a multiple polynomial quadratic sieve (Leutwyler 1994). The result of all the concentrated number crunching was decryption of the encoded message to yield the profound plain-text message "The magic words are squeamish ossifrage." (An ossifrage is a rare predatory vulture found in the mountains of Europe.)
Factorization of RSA-129 followed earlier factorizations of RSA-100, RSA-110, and RSA-120. The challenge numbers RSA-130, RSA-140, RSA-150, RSA-155, RSA-160, RSA-200, and RSA-576 were also subsequently factored between 1996 and May of 2005.
The factorization of the latest RSA number to fall involved "lattice" sieving done by J. Franke and T. Kleinjung using hardware at the Scientific Computing Institute and the Pure Mathematics Institute at Bonn University, Max Planck Institute of Mathematics in Bonn, and Experimental Mathematics Institute in Essen. The factorization of RSA-640 was accomplished using a prime factorization algorithm known as the general number field sieve. Sieving was done on 80 2.2-GHz Opteron CPUs and took 3 months. The matrix step was performed on a cluster of 80 2.2-GHz Opterons connected via a Gigabit network and took about 1.5 months. The two 97-digit factors found using this sieve are
1634733 6458092538 4844313388 3865090859 8417836700 3309231218 1110852389 3331001045 0815121211 8167511579
x
1900871 2816648221 1312685157 3935413975 4718967899 6851549366 6638539088 0271038021 0449895719 1261465571
These numbers can easily be multiplied to verify that their product is indeed equal to the original number.
As the following table shows, RSA-704 to RSA-2048 remain open, carrying awards from $30,000 to $200,000 to whoever is clever and persistent enough to track them down. A list of the open challenge numbers may be downloaded from RSA or in the form of a Mathematica package from the MathWorld package archive.
so continuando a dar ideas programava-se genero colmeia ex: o seti o poder combinado de maquinas. cada uma fazia uma parte do calculo. sei la faz-se uma exponencia de 10 mil maquinas * uma parte de codigo o prob é que essas 10 mil tinha que ter placa de tv... prontos esqueçam era so uma idea.
É verdade que dá muitos dias uma eternidade mas se formos muitos com um programa desses e cada membro for atribuido um range de pesquisa essa eternidade iria diminuir e muito
Se inventares para copiar o software do cartao e depois fazer uma emulacao do cartao e depois fazeres card sharing ?
Posting Permissions
Reply With Quote