1 .\" Michael Haardt (michael@cantor.informatik.rwth.aachen.de)
2 .\" Sat Sep 3 22:00:30 MET DST 1994
4 .\" %%%LICENSE_START(GPLv2+_DOC_FULL)
5 .\" This is free documentation; you can redistribute it and/or
6 .\" modify it under the terms of the GNU General Public License as
7 .\" published by the Free Software Foundation; either version 2 of
8 .\" the License, or (at your option) any later version.
10 .\" The GNU General Public License's references to "object code"
11 .\" and "executables" are to be interpreted as the output of any
12 .\" document formatting or typesetting system, including
13 .\" intermediate and printed output.
15 .\" This manual is distributed in the hope that it will be useful,
16 .\" but WITHOUT ANY WARRANTY; without even the implied warranty of
17 .\" MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 .\" GNU General Public License for more details.
20 .\" You should have received a copy of the GNU General Public
21 .\" License along with this manual; if not, see
22 .\" <http://www.gnu.org/licenses/>.
25 .\" Sun Feb 19 21:32:25 1995, faith@cs.unc.edu edited details away
27 .\" TO DO: This manual page should go more into detail how DES is perturbed,
28 .\" which string will be encrypted, and what determines the repetition factor.
29 .\" Is a simple repetition using ECB used, or something more advanced? I hope
30 .\" the presented explanations are at least better than nothing, but by no
33 .\" added _XOPEN_SOURCE, aeb, 970705
34 .\" added GNU MD5 stuff, aeb, 011223
36 .TH CRYPT 3 2021-03-22 "" "Linux Programmer's Manual"
38 crypt, crypt_r \- password and data encryption
41 .B #include <unistd.h>
43 .BI "char *crypt(const char *" key ", const char *" salt );
47 .BI "char *crypt_r(const char *" key ", const char *" salt ,
48 .BI " struct crypt_data *restrict " data );
51 Link with \fI\-lcrypt\fP.
54 Feature Test Macro Requirements for glibc (see
55 .BR feature_test_macros (7)):
62 Glibc 2.27 and earlier:
73 is the password encryption function.
74 It is based on the Data Encryption
75 Standard algorithm with variations intended (among other things) to
76 discourage use of hardware implementations of a key search.
79 is a user's typed password.
82 is a two-character string chosen from the set
83 [\fBa\-zA\-Z0\-9./\fP].
84 This string is used to
85 perturb the algorithm in one of 4096 different ways.
87 By taking the lowest 7 bits of each of the first eight characters of the
89 a 56-bit key is obtained.
90 This 56-bit key is used to encrypt repeatedly a
91 constant string (usually a string consisting of all zeros).
93 value points to the encrypted password, a series of 13 printable ASCII
94 characters (the first two characters represent the salt itself).
95 The return value points to static data whose content is
96 overwritten by each call.
98 Warning: the key space consists of
101 equal 7.2e16 possible values.
102 Exhaustive searches of this key space are
103 possible using massively parallel computers.
106 is available which will search the portion of this key space that is
107 generally used by humans for passwords.
108 Hence, password selection should,
109 at minimum, avoid common words and names.
112 program that checks for crackable passwords during the selection process is
115 The DES algorithm itself has a few quirks which make the use of the
117 interface a very poor choice for anything other than password
119 If you are planning on using the
121 interface for a cryptography project, don't do it: get a good book on
122 encryption and one of the widely available DES libraries.
125 is a reentrant version of
127 The structure pointed to by
129 is used to store result data and bookkeeping information.
130 Other than allocating it,
131 the only thing that the caller should do with this structure is to set
132 .I data\->initialized
133 to zero before the first call to
136 On success, a pointer to the encrypted password is returned.
137 On error, NULL is returned.
142 has the wrong format.
147 function was not implemented, probably because of U.S.A. export restrictions.
148 .\" This level of detail is not necessary in this man page. . .
150 .\" When encrypting a plain text P using DES with the key K results in the
151 .\" encrypted text C, then the complementary plain text P' being encrypted
152 .\" using the complementary key K' will result in the complementary encrypted
155 .\" Weak keys are keys which stay invariant under the DES key transformation.
156 .\" The four known weak keys 0101010101010101, fefefefefefefefe,
157 .\" 1f1f1f1f0e0e0e0e and e0e0e0e0f1f1f1f1 must be avoided.
159 .\" There are six known half weak key pairs, which keys lead to the same
160 .\" encrypted data. Keys which are part of such key clusters should be
162 .\" Sorry, I could not find out what they are.
165 .\" Heavily redundant data causes trouble with DES encryption, when used in the
171 .\" interface should be used only for its intended purpose of password
172 .\" verification, and should not be used as part of a data encryption tool.
174 .\" The first and last three output bits of the fourth S-box can be
175 .\" represented as function of their input bits. Empiric studies have
176 .\" shown that S-boxes partially compute the same output for similar input.
177 .\" It is suspected that this may contain a back door which could allow the
178 .\" NSA to decrypt DES encrypted data.
180 .\" Making encrypted data computed using crypt() publicly available has
181 .\" to be considered insecure for the given reasons.
184 .I /proc/sys/crypto/fips_enabled
186 and an attempt was made to use a weak encryption type, such as DES.
188 For an explanation of the terms used in this section, see
196 Interface Attribute Value
199 T} Thread safety MT-Unsafe race:crypt
202 T} Thread safety MT-Safe
209 POSIX.1-2001, POSIX.1-2008, SVr4, 4.3BSD.
213 .SS Availability in glibc
219 functions are part of the POSIX.1-2008 XSI Options Group for Encryption
221 If the interfaces are not available, then the symbolic constant
223 is either not defined,
224 or it is defined to \-1 and availability can be checked at run time with
226 This may be the case if the downstream distribution has switched from glibc
229 When recompiling applications in such distributions,
230 the programmer must detect if
232 is not available and include
234 for the function prototypes;
237 is an ABI-compatible drop-in replacement.
238 .SS Features in glibc
239 The glibc version of this function supports additional
240 encryption algorithms.
244 is a character string starting with the characters "$\fIid\fP$"
245 followed by a string optionally terminated by "$",
246 then the result has the form:
249 $\fIid\fP$\fIsalt\fP$\fIencrypted\fP
253 identifies the encryption method used instead of DES and this
254 then determines how the rest of the password string is interpreted.
255 The following values of
264 2a | Blowfish (not in mainline glibc; added in some
265 | Linux distributions)
266 .\" openSUSE has Blowfish, but AFAICS, this option is not supported
267 .\" natively by glibc -- mtk, Jul 08
270 .\" glibc doesn't appear to natively support Sun MD5; I don't know
271 .\" if any distros add the support.
272 5 | SHA-256 (since glibc 2.7)
273 6 | SHA-512 (since glibc 2.7)
277 Thus, $5$\fIsalt\fP$\fIencrypted\fP and $6$\fIsalt\fP$\fIencrypted\fP
278 contain the password encrypted with, respectively, functions
279 based on SHA-256 and SHA-512.
281 "\fIsalt\fP" stands for the up to 16 characters
282 following "$\fIid\fP$" in the salt.
283 The "\fIencrypted\fP"
284 part of the password string is the actual computed password.
285 The size of this string is fixed:
289 SHA-256 | 43 characters
290 SHA-512 | 86 characters
293 The characters in "\fIsalt\fP" and "\fIencrypted\fP" are drawn from the set
294 [\fBa\-zA\-Z0\-9./\fP].
295 In the MD5 and SHA implementations the entire
297 is significant (instead of only the first
301 .\" glibc commit 9425cb9eea6a62fc21d99aafe8a60f752b934b05
302 the SHA-256 and SHA-512 implementations support a user-supplied number of
303 hashing rounds, defaulting to 5000.
304 If the "$\fIid\fP$" characters in the salt are
305 followed by "rounds=\fIxxx\fP$", where \fIxxx\fP is an integer, then the
309 $\fIid\fP$\fIrounds=yyy\fP$\fIsalt\fP$\fIencrypted\fP
312 where \fIyyy\fP is the number of hashing rounds actually used.
313 The number of rounds actually used is 1000 if
318 is greater than 999999999, and