Hi,
i have a program that need a hasp hl 2.17 for working. I read in this forum and another that for dump this is necessary to find h5dmp. Locky, now i have.
I try to use and obtain 2 files, dump.dmp and hhl-mem.dmp. Next i use universal dump to reg, but what is the correct emulator?

Chingachguk?
Glasha?
Toro?

Whot is the correct? Tank you for answare!

Have you tried reading the FAQ?

4tom: nothing universal emul for hasp hl.

to tom:
for hasp hl protected programs emulation, you need a log made by a hasp hl logger, and a good hasp hl emulator.
see my shared aladdin monitor in exetools for usbfilter, it is good enough to make a log file for any hasp hl protected program. and then you must try to find an emulator , as there are not any free emulator, you must start to write one yourself.
TORO

4tom:

you can find a free accessible Hasp HL emulator on the web; checkout http://www.software-key.org/haspsbs.html and download HaspHL2oo7.zip.

there is just a little problem to solve; this nice proggy uses RSA-512 for licensing, try solving it first .

how to do for this problem? thanks

You set up a brute forcer in a Quantum computer, then sit and wait a mere 10^8 years for the solution.

Much better than the 10^54 years it takes with a regular computer.

@jb1968:
As naides said, solving RSA-512 is not possible today; when I first downloaded this emulator (HaspHL2oo6), I completely un-scrambled its driver in the hope of keygenning it, but faced a damn RSA-515 and soon gave up; then thought about patching it; this is quite possible, but there is one problem; this nice emulator uses the same structure of EDStruc (replaced with keyword TimeHash) for En\Decode calculation and it is encrypted with RSA too...
Well, I think coding a filter driver is easier than patching all RSA'ed stuff on this emulator

Regards

http://mathworld.wolfram.com/news/2005-11-08/rsa-640/

http://en.wikipedia.org/wiki/RSA-200

That's 200 digits - 663 bits

asteri, thx for the link; I correct myself and say that it is possible to solve RSA-512, but the price is very HIGH !!!!!!!!

"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"

maybe we should ask their help for this problem

Chingachguk is what you need. If there is anything decrypeted in key, use toro monitor and create Q/A Table into regfile.
Don't forget, you must have vusbbus.sys version 0.15.

It works perfectly.

I dont know if u people know it or not but hasphl2007 is already cracked

Is it joke...?

check exetools edge has already keygenned it

saber:

You need to be careful with your terminology. What has been "released" on Exetools are various "emulators" for "HASP/Hardlock Emulator 2007" (one by EDGE) and a couple of varities of "emulators" for "HASPHL2008".

There is no "keygen." The difference is important.

Regards,

Correct, but slight footnote to JMI's comment. The name of the emulator is HASPHL200X (being the year). Edge keygenned this particular emulator which is a commercial emulator named "HASPHL2008" (this years and 2007's)However, the naming convention is confusing because of the naming used by Alladin Systems and other emulators. The keygen edge made is a keygen for calculating the seeds for the hasp dongle and for the rsa key, same with the sentinel emulator (seeds and rsakey) from the same company (Soft Key Solutions). There are other emulators which are non commercial out in the wild which of course dont require a keygen as they are from fellow talented reverse engineers and we like these just as much. Of course with these free emulators one still needs to know how to calculate the seeds, which were infact already accomidated in the edge keygen. Just remember when in doubt,

DONGS

Thanks for the clarification, Sab. Always helps to get "all" the details correct, so everyone knows "exactly what we are talking about.

Regards,

@ jmi
@sab

Thanks for correcting me and giving the valuable info.