- Fileward 1 1 14 – High Strength Data Encryption Tool
- Fileward 1 1 14 – High Strength Data Encryption Device
- Fileward 1 1 14 – High Strength Data Encryption Decryption
- Fileward 1 1 14 – High Strength Data Encryption Software
FileWard is a handy tool designed to bring high strength data encryption to Macintosh users. FileWard uses the cryptography libraries of OpenSSL to make six industrial strength encryption ciphers available in an easy to use drag and drop application. Since October 31, 2018, Office 365 no longer supports TLS 1.0 and 1.1. This means that Microsoft will not fix new issues that are found in clients, devices, or services that connect to Office 365 by using TLS 1.0 and 1.1. Official deprecation for GCC High and DoD environments began January 15, 2020. Since October 31, 2018, Office 365 no longer supports TLS 1.0 and 1.1. This means that Microsoft will not fix new issues that are found in clients, devices, or services that connect to Office 365 by using TLS 1.0 and 1.1. Official deprecation for GCC High and DoD environments began January 15, 2020.
FIPS PUB 46-2Supersedes FIPS PUB 46-1
![Fileward 1 1 14 – high strength data encryption software Fileward 1 1 14 – high strength data encryption software](https://img.magimg.com/uploads/fileward.jpg)
Processing Standards Publication 46-2
1993 December 30
Federal Information Processing Standards Publications (FIPS PUBS)are issued by the National Bureau of Standards in accordance withsection 111 (f) (2) of the Federal Property and AdministrativeServices Act of 1949, as amended, Public Law 89-306 (79 Stat1127), Executive Order 11717 (38 FR 12315, dated May 11, 1973),and Part 6 of Title 15 Code of Federal Regulations.
![Strength Strength](https://cdn2.hubspot.net/hub/441818/file-3159697355-jpg/blog-files/image-2-new-20150303.jpg)
Fileward 1 1 14 – High Strength Data Encryption Tool
1. Name of Standard. Data Encryption Standard (DES).2. Category of Standard. Computer Security.
3. Explanation. The Data Encryption Standard (DES) specifiesa FIPS approved cryptographic algorithm as required by FIPS140-1. This publication provides a complete description of amathematical algorithm for encrypting (enciphering) anddecrypting (deciphering) binary coded information. Encryptingdata converts it to an unintelligible form called cipher. Decrypting cipher converts the data back to its original form called plaintext. The algorithm described in this standardspecifies both enciphering and deciphering operations which arebased on a binary number called a key.
A key consists of 64 binary digits ('O's or '1's) of which 56bits are randomly generated and used directly by the algorithm. The other 8 bits, which are not used by the algorithm, are usedfor error detection. The 8 error detecting bits are set to makethe parity of each 8-bit byte of the key odd, i.e., there is anodd number of '1's in each 8-bit byte1.Authorized users ofencrypted computer data must have the key that was used toencipher the data in order to decrypt it. The encryptionalgorithm specified in this standard is commonly known amongthose using the standard. The unique key chosen for use in aparticular application makes the results of encryptingdata using the algorithm unique. Selection of a different keycauses the cipher that is produced for any given set of inputs tobe different. The cryptographic security of the data depends onthe security provided for the key used to encipher and decipherthe data.
Data can be recovered from cipher only by using exactly the samekey used to encipher it. Unauthorized recipients of the cipherwho know the algorithm but do not have the correct key cannotderive the original data algorithmically. However, anyone whodoes have the key and the algorithm can easily decipher thecipher and obtain the original data. A standard algorithmbased on a secure key thus provides a basis for exchangingencrypted computer data by issuing the key used to encipher it tothose authorized to have the data.
Data that is considered sensitive by the responsible authority,data that has a high value, or data that represents a high valueshould be cryptographically protected if it is vulnerable tounauthorized disclosure or undetected modification duringtransmission or while in storage. A risk analysis should beperformed under the direction of a responsible authority todetermine potential threats. The costs of providingcryptographic protection using this standard as well asalternative methods of providing this protection and theirrespective costs should be projected. A responsible authoritythen should make a decision, based on these analyses, whether ornot to use cryptographic protection and this standard.
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Fileward 1 1 14 – High Strength Data Encryption Device
1Sometimes keys aregenerated in an encryptedform. A random 64-bite number is generated and defined to be the cipherformed by the encryptionof a key using a key encrypting key. In this case the parity bits of theencrypted key cannot be setuntil after the key is decrypted.~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
4. Approving Authority. Secretary of Commerce.
5. Maintenance Agency. U.S. Department of Commerce, NationalInstitute of Standards and Technology, Computer SystemsLaboratory.
Fileward 1 1 14 – High Strength Data Encryption Decryption
6. Applicability. This standard may be used by Federaldepartments and agencies when the following conditions apply:
- An authorized official or manager responsible for data security or the security of any computer system decides that cryptographic protection is required; and
- 2. The data is not classified according to the National Security Act of 1947, as amended, or the Atomic Energy Act of 1954, as amended.Federal agencies or departments which use cryptographic devicesfor protecting data classified according to either of these actscan use those devices for protecting unclassified data in lieuof the standard.
Other FIPS approved cryptographic algorithms may be used inaddition to, or in lieu of, this standard when implemented inaccordance with FIPS 140-1.
In addition, this standard may be adopted and used by non-FederalGovernment organizations. Such use is encouraged when itprovides the desired security for commercial and privateorganizations.
7. Applications. Data encryption (cryptography) is utilizedin various applications and environments. The specificutilization of encryption and the implementation of the DES willbe based on many factors particular to the computer system andits associated components. In general, cryptography is used toprotect data while it is being communicated between two points orwhile it is stored in a medium vulnerable to physical theft. Communication security provides protection to data by encipheringit at the transmitting point and deciphering it at the receivingpoint. File security provides protection to data by encipheringit when it is recorded on a storage medium and deciphering itwhen it is read back from the storage medium. In the first case,the key must be available at the transmitter and receiversimultaneously during communication. In the second case, the keymust be maintained and accessible for the duration of the storageperiod. FIPS 171 provides approved methods for managing the keysused by the algorithm specified in this standard.
8. Implementations. Cryptographic modules which implement thisstandard shall conform to the requirements of FIPS 140-1. Thealgorithm specified in this standard may be implemented insoftware, firmware, hardware, or any combination thereof. Thespecific implementation may depend on several factors such as theapplication, the environment, the technology used, etc. Implementations which may comply with this standard includeelectronic devices (e.g., VLSI chip packages), micro-processorsusing Read Only Memory (ROM), Programmable Read Only Memory(PROM), or Electronically Erasable Read Only Memory (EEROM), andmainframe computers using Random Access Memory (RAM). Whenthe algorithm is implemented in software or firmware, theprocessor on which the algorithm runs must be specified as partof the validation process. Implementations of the algorithmwhich are tested and validated by NIST will be considered ascomplying with the standard. Note that FIPS 140-1 placesadditional requirements on cryptographic modules forGovernment use. Information about devices that have beenvalidated and procedures for testing and validating equipment forconformance with this standard and FIPS 140-1 are available fromthe National Institute of Standards and Technology, ComputerSystems Laboratory, Gaithersburg, MD 20899.
9. Export Control. Cryptographic devices and technical dataregarding them are subject to Federal Government export controlsas specified in Title 22, Code of Federal Regulations, Parts 120through 128. Some exports of cryptographic modules implementingthis standard and technical data regarding them must comply withthese Federal regulations and be licensed by the U.S. Departmentof State. Other exports of cryptographic modules implementingthis standard and technical data regarding them fall under thelicensing authority of the Bureau of Export Administration of theU.S. Department of Commerce. The Department of Commerce isresponsible for licensing cryptographic devices used forauthentication, access control, proprietary software, automaticteller machines (ATMs), and certain devices used in otherequipment and software. For advice concerning which agency haslicensing authority for a particular cryptographic device, pleasecontact the respective agencies.
10. Patents. Cryptographic devices implementing this standardmay be covered by U.S. and foreign patents issued to theInternational Business Machines Corporation. However, IBM hasgranted nonexclusive, royalty-free licenses under the patents tomake, use and sell apparatus which complies with the standard. The terms, conditions and scope of the licenses are set out innotices published in the May 13, 1975 and August 31, 1976 issuesof the Official Gazette of the United States Patent and TrademarkOffice (934 O.G. 452 and 949 O.G. 1717).
11. Alternative Modes of Using the DES. FIPS PUB 81, DES Modesof Operation, describes four different modes for using thealgorithm described in this standard. These four modes arecalled the Electronic Codebook (ECB) mode, the Cipher BlockChaining (CBC) mode, the Cipher Feedback (CFB) mode, and theOutput Feedback (OFB) mode. ECB is a direct application of theDES algorithm to encrypt and decrypt data; CBC is an enhancedmode of ECB which chains together blocks of cipher text; CFB usespreviously generated cipher text as input to the DES to generatepseudorandom outputs which are combined with the plaintext toproduce cipher, thereby chaining together the resulting cipher;OFB is identical to CFB except that the previous output of theDES is used as input in OFB while the previous cipher is used asinput in CFB. OFB does not chain the cipher.
12. Implementation of this standard. This standard becameeffective July 1977. It was reaffirmed in 1983, 1988, and 1993. It applies to all Federal agencies, contractors of Federalagencies, or other organizations that process information (usinga computer or telecommunications system) on behalf of the FederalGovernment to accomplish a Federal function. Each Federalagency or department may issue internal directives for the use ofthis standard by their operating units based on their datasecurity requirement determinations. FIPS 46-2 which revises theimplementation of the Data Encryption Algorithm to includesoftware, firmware, hardware, or any combination thereof, iseffective June 30, 1994. This revised standard may be used inthe interim period before the effective date.
NIST provides technical assistance to Federal agencies inimplementing data encryption through the issuance of guidelinesand through individual reimbursable projects. The NationalSecurity Agency assists Federal departments and agencies incommunications security for classified applications and indetermining specific security requirements. Instructions andregulations for procuring data processing equipment utilizingthis standard are included in the Federal Information ResourcesManagement Regulation (FIRMR) Subpart 201-8.111-1.
13. Specifications. Federal Information Processing Standard(FIPS) 46-2, Data Encryption Standard (DES) (affixed).
14. Cross Index.- a. Federal Information Resources Management Regulations (FIRMR) subpart 201.20.303, Standards, and subpart 201.39.1002, Federal Standards.
- b. FIPS PUB 31, Guidelines to ADP Physical Security and Risk Management.
- c. FIPS PUB 41, Computer Security Guidelines for Implementing the Privacy Act of 1974.
- d. FIPS PUB 65, Guideline for Automatic Data Processing Risk Analysis.
- e. FIPS PUB 73, Guidelines for Security of Computer Applications.
- f. FIPS PUB 74, Guidelines for Implementing and Using the NBS Data Encryption Standard.
- g. FIPS PUB 81, DES Modes of Operation.
- h. FIPS PUB 87, Guidelines for ADP Contingency Planning.
- i. FIPS PUB 112, Password Usage.
- j. FIPS PUB 113, Computer Data Authentication.
- k. FIPS PUB 140-1, Security Requirements for Cryptographic Modules.
- l. FIPS PUB 171, Key Management Using ANSI X9.17.
- m. Other FIPS and Federal Standards are applicable to the implementation and use of this standard. In particular, the Code for Information Interchange, Its Representations, Subsets, and Extensions (FIPS PUB 1-2) and other related data storage media or data communications standards should be used in conjunction with this standard. A list of currently approved FIPS may be obtained from the National Institute of Standards and Technology, Computer Systems Laboratory, Gaithersburg, MD 20899.
15. Qualifications. The cryptographic algorithm specified inthis standard transforms a 64-bit binary value into a unique64-bit binary value based on a 56-bit variable. If the complete64-bit input is used (i.e., none of the input bits should bepredetermined from block to block) and if the 56-bit variable israndomly chosen, no technique other than trying all possible keysusing known input and output for the DES will guarantee findingthe chosen key. As there are over 70,000,000,000,000,000(seventy quadrillion) possible keys of 56 bits, the feasibilityof deriving a particular key in this way is extremely unlikely intypical threat environments. Moreover, if the key is changedfrequently, the risk of this event is greatly diminished. However, users should be aware that it is theoretically possibleto derive the key in fewer trials (with a correspondingly lowerprobability of success depending on the number of keys tried) andshould be cautioned to change the key as often as practical. Users must change the key and provide it a high level ofprotection in order to minimize the potential risks of itsunauthorized computation or acquisition. The feasibility ofcomputing the correct key may change with advances in technology.
A more complete description of the strength of this algorithmagainst various threats is contained in FIPS PUB 74, Guidelinesfor Implementing and Using the NBS Data Encryption Standard.
When correctly implemented and properly used, this standard willprovide a high level of cryptographic protection to computerdata. NIST, supported by the technical assistance of Governmentagencies responsible for communication security, has determinedthat the algorithm specified in this standard will provide a highlevel of protection for a time period beyond the normal lifecycle of its associated equipment. The protection provided bythis algorithm against potential new threats will be reviewedwithin 5 years to assess its adequacy (See Special InformationSection). In addition, both the standard and possible threatsreducing the security provided through the use of this standardwill undergo continual review by NIST and other cognizant Federalorganizations. The new technology available at that time will beevaluated to determine its impact on the standard. In addition,the awareness of any breakthrough in technology or anymathematical weakness of the algorithm will cause NIST toreevaluate this standard and provide necessary revisions.
At the next review (1998), the algorithm specified in thisstandard will be over twenty years old. NIST will consideralternatives which offer a higher level of security. One ofthese alternatives may be proposed as a replacement standard atthe 1998 review.
16. Comments. Comments and suggestions regarding this standardand its use are welcomed and should be addressed to the NationalInstitute of Standards and Technology, Attn: Director, ComputerSystems Laboratory, Gaithersburg, MD 20899.
17. Waiver Procedure. Under certain exceptional circumstances,the heads of Federal departments and agencies may approve waiversto Federal Information Processing Standards (FIPS). The head ofsuch agency may redelegate such authority only to a seniorofficial designated pursuant to section 3506(b) of Title 44,United States Code. Waiver shall be granted only when:- a. Compliance with a standard would adversely affect the accomplishment of the mission of an operator of a Federal computer system; or
- b. Compliance with a standard would cause a major adverse financial impact on the operator which is not offset by Government-wide savings.
In addition, notice of each waiver granted and each delegation ofauthority to approve waivers shall be sent promptly to theCommittee on Government Operations of the House ofRepresentatives and the Committee on Government Affairs of theSenate and shall be published promptly in the Federal Register.
When the determination on a waiver applies to the procurement ofequipment and/or services, a notice of the waiver determinationmust be published in the Commerce Business Daily as a part of thenotice of solicitation for offers of an acquisition or, if thewaiver determination is made after that notice is published, byamendment to such notice.
A copy of the waiver, any supporting documents, the documentapproving the waiver and any accompanying documents, with suchdeletions as the agency is authorized and decides to make under 5United States Code Section 552(b), shall be part of theprocurement documentation and retained by the agency.
18. Special Information. In accordance with the QualificationsSection of this standard, reviews of this standard have beenconducted every 5 years since its adoption in 1977. The standardwas reaffirmed during each of those reviews. This revision tothe text of the standard contains changes which allow softwareimplementations of the algorithm and which permit the use ofother FIPS approved cryptographic algorithms.
19. Where to Obtain Copies of the Standard. Copies of thispublication are for sale by the National Technical InformationService, U.S. Department of Commerce, Springfield, VA 22161. When ordering, refer to Federal Information Processing StandardsPublication 46-2 (FIPS PUB 46-2), and identify the title. Whenmicrofiche is desired, this should be specified. Prices arepublished by NTIS in current catalogs and other issuances. Payment may be made by check, money order, deposit account orcharged to a credit card accepted by NTIS.
FIPS PUB 44-2
Supersedes FIPS PUB 46-1
1988 January 22Federal Information
Processing Standards Publication 46-2
1993 December 30Specifications for The Data Encryption Standard (DES) shall consist of the following DataEncryption Algorithm to be implemented in special purpose electronicdevices. These devices shall be designed in such a way that they may be usedin a computer system or network to provide cryptographic protection tobinary coded data. The method of implementation will depend on theapplication and environment. The devices shall be implemented in such a waythat they may be tested and validated as accurately performing thetransformations specified in the following algorithm.DATA ENCRYPTION ALGORITHM IntroductionThe algorithm is designed to encipher and decipher blocks of data consistingof 64 bits under control of a 64-bit key.** Deciphering must be accomplishedby using the same key as for enciphering, but with the schedule of addressingthe key bits altered so that the deciphering process is the reverse of theenciphering process. A block to be enciphered is subjected to an initialpermutation IP, then to a complex key-dependent computation andfinally to a permutation which is the inverse of the initial permutationIP-1. The key-dependentcomputation can be simply defined in terms of a function f,called the cipher function, and a function KS, called the key schedule. A description of the computation is given first, along with details as to how thealgorithm is used for encipherment. Next, the use of the algorithm fordecipherment is described. Finally, a definition of the cipher functionf is given in terms of primitive functions which are called theselection functions Si and thepermutation function P. Si, P andKS of the algorithm are contained in the Appendix.The following notation is convenient: Given two blocks L andR of bits, LR denotes the block consisting of the bits ofL followed by the bits of R. Since concatenation isassociative, B1B2 ..B8, for example,denotes the block consisting of the bits of B1followed by the bits of B2..followed by thebits of B8.
** Blocks are composed of bits numbered from left to right, i.e., the left mostbit of a block is bit one.
Figure 1. Enciphering computation.EncipheringA sketch of the enciphering computation is given in Figure 1.The 64 bits of the input block to be enciphered are first subjected to thefollowing permutation, called the initial permutation IP:That is the permuted input has bit 58 of the input as its first bit, bit 50 as itssecond bit, and so on with bit 7 as its last bit. The permuted input block isthen the input to a complex key-dependent computation described below. Theoutput of that computation, called the preoutput, is then subjected to thefollowing permutation which is the inverse of the initial permutation:That is, the output of the algorithm has bit 40 of the preoutput block as itsfirst bit, bit 8 as its second bit, and so on, until bit 25 of the preoutput block isthe last bit of the output.The computation which uses the permuted input block as its input to producethe preoutput block consists, but for a final interchange of blocks, of 16iterations of a calculation that is described below in terms of the cipherfunction f which operates on two blocks, one of 32 bits andone of 48 bits, and produces a block of 32 bits.Let the 64 bits of the input block to an iteration consist of a 32 bit blockL followed by a 32 bit block R. Using the notation definedin the introduction, the input block is then LR.Let K be a block of 48 bits chosen from the 64-bit key. Then theoutput L'R' of an iteration with input LR is definedby:where (+) denotes bit-by-bit addition modulo 2.As remarked before, the input of the first iteration of the calculation is thepermuted input block. If L'R' is the output of the 16th iteration thenR'L' is the preoutput block. At each iteration a different blockK of key bits is chosen from the 64-bit key designated byKEY.With more notation we can describe the iterations of the computation in moredetail. Let KS be a function which takes an integer n in therange from 1 to 16 and a 64-bit block KEY as input and yields asoutput a 48-bit block Kn which is apermuted selection of bits from KEY. That iswith Kn determined by the bits in48 distinct bit positions of KEY. KS is called the keyschedule because the block K used in the n'th iteration of (1)is the block Kn determined by (2).As before, let the permuted input block be LR. Finally, letL() and R() be respectively L and R and letLn and Rn be respectively L' and R' of (1) when L and R are respectivelyLn-1 and Rn-1 and K is Kn ; that is, when n is in the range from 1 to16,The preoutput block is then R16 L16.The key schedule KS of the algorithm is described in detail in theAppendix. The key schedule produces the 16 Kn which are required for the algorithm.DecipheringThe permutation IP-1 applied tothe preoutput block is the inverse of the initial permutation IPapplied to the input. Further, from (1) it follows that:Consequently, to decipher it is only necessary to apply the verysame algorithm to an enciphered message block, taking care that at eachiteration of the computation the same block of key bits K is usedduring decipherment as was used during the encipherment of the block. Using the notation of the previous section, this can be expressed by theequations:where now R16L16 is the permuted input block for the decipheringcalculation and L() andR() is the preoutput block. That is,for the decipherment calculation with R16 L16 as thepermuted input, K16 is used in thefirst iteration, K15 in the second,and so on, with K1 used in the 16thiteration.The Cipher Function fA sketch of the calculation of f(R,K) is given in Figure2.
Figure 2. Calculation of f(R,K).Let E denote a function which takes a block of 32 bits as input andyields ablock of 48 bits as output. Let E be such that the 48 bits of its output,writtenas 8 blocks of 6 bits each, are obtained by selecting the bits in its inputs inorder according to the following table:Thus the first three bits of E(R) are the bits in positions 32, 1 and 2 ofR whilethe last 2 bits of E(R) are the bits in positions 32 and 1.Each of the unique selection functions S1 ,S2,..,S8 , takes a 6-bit block as inputand yields a 4-bit block as output and is illustrated by using a table containingthe recommended S1:If S1 is the function defined in thistable and B is a block of 6 bits, then S1 (B)isdetermined as follows: The first and last bits of B represent in base 2anumber in the range 0 to 3. Let that number be i. The middle 4 bits ofB represent in base 2 a number in the range 0 to 15. Let that numberbe j. Look up in the table the number in the i'th row and j'th column. It is anumber in the range 0 to 15 and is uniquely represented by a 4 bit block. That block is the output S1(B) ofS1 for the input B. Forexample, for input011011 the row is 01, that is row 1, and the column is determined by 1101, thatis column 13. In row 1 column 13 appears 5 so that the output is 0101. Selection functions S1 ,S2,..,S8 of the algorithm appear in the Appendix.The permutation function P yields a 32-bit output from a 32-bit input bypermuting the bits of the input block. Such a function is defined by thefollowing table:The output P(L) for the function P defined by this table isobtained from theinput L by taking the 16th bit of L as the first bit ofP(L), the 7th bit as thesecond bit of P(L), and so on until the 25th bit of L is takenas the 32nd bit ofP(L). The permutation function P of the algorithm is repeated in theAppendix.Now let S1,..,S8 be eight distinct selection functions, let Pbe the permutationfunction and let E be the function defined above.To define f(R,K) we first define B1 ,..,B8 to beblocks of 6 bits each for whichThe block f(R,K) is then defined to beThus K(+)E(R) is first divided into the 8 blocks as indicated in (6). Then eachBi is taken as an input toSi and the 8 blocks (S1(B1)S2(B2)..S8(B8) of 4 bitseach are consolidated into a single block of 32 bits which forms the input toP. The output (7) is then the output of the function f for theinputs R and K.APPENDIX PRIMITIVE FUNCTIONS FOR THE DATA ENCRYPTION ALGORITHMThe choice of the primitive functions KS, S1 ,..,S8 andP is critical to thestrength of an encipherment resulting from the algorithm. Specified below isthe recommended set of functions, describing S1 ,..,S8 andP in the same waythey are described in the algorithm. For the interpretation of the tablesdescribing these functions, see the discussion in the body of the algorithm.The primitive functions S1 ,..,S8 are:The primitive function P is:Recall that Kn, for 1< than or =to n < than or = to16, is the block of 48 bits in (2) of the algorithm. Hence, to describe KS, it is sufficient to describe the calculation ofKn fromKEY for n = 1, 2,.., 16. That calculation is illustrated inFigure 3. Tocomplete the definition of KS it is therefore sufficient to describe thetwopermuted choices, as well as the schedule of left shifts. One bit in each 8-bitbyte of the KEY may be utilized for error detection in keygeneration,distribution and storage. Bits 8, 16,.., 64 are for use in assuring that eachbyte is of odd parity.Permuted choice 1 is determined by the following table:The table has been divided into two parts, with the first part determining howthe bits of C() are chosen, and thesecond part determining how the bits of D() are chosen. The bits of KEY are numbered 1 through 64. The bits ofC() arerespectively bits 57, 49, 41,.., 44 and 36 of KEY, with the bits ofD() being bits63, 55, 47,.., 12 and 4 of KEY.With C() and D() defined, we now define how the blocksCn and Dn areobtained from the blocks Cn-1 andDn-1, respectively, for n =1, 2,.., 16. Thatis accomplished by adhering to the following schedule of left shifts of theindividual blocks: For example, C3 andD3 are obtained fromC2 and D
Figure 3. Key schedule calculation.2 , respectively, by twoleftshifts, and C16 andD16 are obtained fromC15 and D15 , respectively, by oneleftshift. In all cases, by a single left shift is meant a rotation of the bits one placeto the left, so that after one left shift the bits in the 28 positions are the bitsthat were previously in positions 2, 3,.., 28, 1.Permuted choice 2 is determined by the following table:Therefore, the first bit of Kn is the14th bit of CnDn , the second bit the 17th,and so on with the 47th bit the 29th, and the 48th bit the 32nd.The Foreword, Abstract, and Key Words follow: FIPS PUB 46-2
FEDERAL INFORMATION
PROCESSING STANDARDS PUBLICATION
1993 December 30
U.S. DEPARTMENT OF COMMERCE/National Institute of Standards andTechnology
U.S. DEPARTMENT OF COMMERCE, Ronald H. Brown,SecretaryDATA ENCRYPTION STANDARD (DES)
Technology Administration, Mary L. Good,Under Secretary forTechnlogy
National Institute of Standards and Techology, Arati Prabhakar,DirectorForeword The Federal Information Processing Standards Publication Seriesof the National Bureau of Standards (NBS) is the officialpublication relating to standards, guidelines, and documents adoptedand promulgated under the provisions of Public Law 89-306 (BrooksAct) and under Part 6 of Title 15, Code of Federal Regulations.These legislative and executive mandates have given the Secretary ofCommerce important responsibilities for improving the utilizationand management of computers and automatic data processing in theFederal Government. To carry out the Secretary's responsibilities,the NBS, through its Institute for Computer Sciences and Technology,provides leadership, technical guidance, and coordination ofGovernment efforts in the development of standards, guide-lines anddocuments in these areas.
Comments concerning Federal Information Processing StandardsPublications are welcomed and should be addressed to the Director,Institute for Computer Sciences and Technology, National Bureau ofStandards, Gaithersburg, MD 20899.
James H. Burrows, Director
Institute for Computer Sciences andTechnologyAbstract The selective application of technological and related procedual safeguards isan importantresponsibility of every Federal organization in providing adequate security toits elecctronic datasystems. This publication specifies a cryptographic algorithm which may beused by Federalorganizations to protect sensitive data. Protectin of data during transmissionor while in storagemaybe necessary to maintain the confidentiality and integrity of the informatinrepresented by the data. Thealgorithm uniquely defines the mathematical steps required to transform datainto a cryptographiccipher and also to transform the cipher back to the original form. The DataEncryptino Standard isbeing made available for use by Federal agencies within the context of a totalsecurity programconsisting of physical security procedures, good information managementpractices, and computersystem/network access controls. This revision supersedes FIPS 46-1 in itsentirety.
Key words:computer security; data encryption standard; encryption;Federal InformationProcessing Standard (FIPS); security.Return to the FIPS
Home Page
Speed up your Mac and secure it with the Hi Speed Bundle! Buy Catalina Cache Cleaner and Appriority together and save! Get them both for just $14.99. Hurry, offer ends soon.Order now!
Fileward 1 1 14 – High Strength Data Encryption Software
Introducing our new privacy tool - MuteMic. Instantly or automatically turn off your computer's microphone and camera. Learn more here.
Catalina Cache Cleaner has been voted as a leading Anti-Malware Tool for Mac by MacUpdate readers! Read it here.
Luxion keyshot pro 8 1. Now updated for macOS 10.15 .. Catalina Cache Cleaner! Award winning OS X Maintenance, Customization, and Optimization unsurpassed by any other utility. Stronger and faster than ever! Get it Now!
Need Faster Apps and Longer Battery Life? Appriority is here! Learn about it now.
Available Now. Easy to use, Industrial Strength Personal Encryption for Macintosh. Learn about FileWard.
Lights Out is back and better than ever! Get it here!
Check out ClipDoubler, our ultimate clipboard enhancement utility. Click to learn more.
New from Northern Softworks .. UTC Clock. A simple UTC clock for your desktop.Get it Free right here!Speed up websurfing, block ads, cookies and more. Put the power of a Hosts file to work for you.Check out Hostal.
Put a trashcan and file shredder on the Mac OS X desktop with Trash X. Calendarpro for google 2 2 3. Check it out here.
Newtek lightwave 3d.
Newtek lightwave 3d.