.dsy:it. (http://www.dsy.it/forum/)
- Algoritmi e strutture dati (http://www.dsy.it/forum/forumdisplay.php?forumid=207)
-- [C] Codifica parole con un long double (http://www.dsy.it/forum/showthread.php?threadid=17049)

COdifica parole con un long double

Ciao ragazzi,
nuovo quesito. Qualcuno saprebbe dirmi se esiste una funzione che, data una parola la codifica con un 'long double', ad esempio con una numerazione base 26 (dalla a alla z), e dato il codice riesce a restituirmi la stringa contenente la parola ?

Il codice ANSI C è sempre il benvenuto.

Buona giornata.

In ANSI ho seri dubbi che ci sia una funzione gia` pronta.

Pero` ci sono sicuramente librerie che utilizzano DES e gli altri metodi di cifratura.

__________________
~ get Debian! ~ get FreeBSD! ~ get OpenBSD! ~

Ci rinuncio.

grazie

come ti arrendi in fretta

Se programmi in ambiente *nix:

#man crypt

NAME
crypt - password and data encryption

SYNOPSIS
#define _XOPEN_SOURCE
#include <unistd.h>

char *crypt(const char *key, const char *salt);

DESCRIPTION
crypt is the password encryption function. It is based on the Data
Encryption Standard algorithm with variations intended (among other
things) to discourage use of hardware implementations of a key search.

key is a user’s typed password.

salt is a two-character string chosen from the set [a–zA–Z0–9./]. This
string is used to perturb the algorithm in one of 4096 different ways.

By taking the lowest 7 bits of each of the first eight characters of
the key, a 56-bit key is obtained. This 56-bit key is used to encrypt
repeatedly a constant string (usually a string consisting of all
zeros). The returned value points to the encrypted password, a series f 13 printable ASCII characters (the first two characters represent
the salt itself). The return value points to static data whose content
is overwritten by each call.

Warning: The key space consists of 2**56 equal 7.2e16 possible values.
Exhaustive searches of this key space are possible using massively par-
allel computers. Software, such as crack(1), is available which will
search the portion of this key space that is generally used by humans
for passwords. Hence, password selection should, at minimum, avoid
common words and names. The use of a passwd(1) program that checks for
crackable passwords during the selection process is recommended.

The DES algorithm itself has a few quirks which make the use of the
crypt(3) interface a very poor choice for anything other than password
authentication. If you are planning on using the crypt(3) interface
for a cryptography project, don’t do it: get a good book on encryption
and one of the widely available DES libraries.

RETURN VALUE
A pointer to the encrypted password is returned. On error, NULL is
returned.

ERRORS
ENOSYS The crypt function was not implemented, probably because of
U.S.A. export restrictions.

GNU EXTENSION
The glibc2 version of this function has the following additional fea-
tures. If salt is a character string starting with the three charac-
ters "$1$" followed by at most eight characters, and optionally termi-
nated by "$", then instead of using the DES machine, the glibc crypt
function uses an MD5-based algorithm, and outputs up to 34 bytes,
namely "$1$<string>$", where "<string>" stands for the up to 8 charac-
ters following "$1$" in the salt, followed by 22 bytes chosen from the
set [a–zA–Z0–9./]. The entire key is significant here (instead of only
the first 8 bytes).

Programs using this function must be linked with -lcrypt.

CONFORMING TO
SVID, X/OPEN, BSD 4.3, POSIX 1003.1-2001

SEE ALSO
login(1), passwd(1), encrypt(3), getpass(3), passwd(5)

__________________
~ get Debian! ~ get FreeBSD! ~ get OpenBSD! ~

la saga continua.......

Purtroppo devo sviluppare sotto windows in ANSI C quindi......
mi dovrei inventare tutto in poco tempo, getto la spugna e valuto diversamente il problema.

bye

strtoul ?

__________________

code:
  , ,  | |  Me@Flickr
 [ov0] | |   my photo Blog
 {| |} |@| Pallavolo La Nuova Rossa Milano 
--"-"--| |
-------| |   "If You Can't Open It, You Don't Own It"  

mmm ma poi come fa a riconvertirla nella stringa di partenza?

__________________
~ get Debian! ~ get FreeBSD! ~ get OpenBSD! ~

Codifica

Applicando inversamente la funzione di decodifica.
es. se per codificare converto ogni lettera (da a a z sono 26) considerando a = 1 e z = 26 e moltiplico per una potenza di 26 (base 26) sommandone i risultati per ritornare alla parola data faccio il contrario ne più ne meno come le numerazioni binaria, ottale, esadecimale, decimale e così via. Il discorso è che così facendo dopo poche lettere avrò un numero esageratamente grande quindi vorrei trovare una funzione più 'economica' esempio: da 0 a 25 prima lettera + da 0 a 25 +26 la seconda lettera e così via....

comunque ho cambiato strategia....