Subversion Repositories xtea

/trunk/LICENSE File deleted \ No newline at end of file

/trunk/testbench.v File deleted \ No newline at end of file

trunk/testbench.v Property changes : Deleted: svn:executable ## -1 +0,0 ## -* \ No newline at end of property Index: trunk/releases/xtea-1.0.zip =================================================================== Cannot display: file marked as a binary type. svn:mime-type = application/octet-stream Index: trunk/releases/xtea-1.0.zip =================================================================== --- trunk/releases/xtea-1.0.zip (revision 5) +++ trunk/releases/xtea-1.0.zip (nonexistent)

trunk/releases/xtea-1.0.zip Property changes : Deleted: svn:mime-type ## -1 +0,0 ## -application/octet-stream \ No newline at end of property Index: trunk/releases/xtea-1.0.tar.gz =================================================================== Cannot display: file marked as a binary type. svn:mime-type = application/octet-stream Index: trunk/releases/xtea-1.0.tar.gz =================================================================== --- trunk/releases/xtea-1.0.tar.gz (revision 5) +++ trunk/releases/xtea-1.0.tar.gz (nonexistent)

trunk/releases/xtea-1.0.tar.gz Property changes : Deleted: svn:mime-type ## -1 +0,0 ## -application/octet-stream \ No newline at end of property Index: trunk/xtea.v =================================================================== --- trunk/xtea.v (revision 5) +++ trunk/xtea.v (nonexistent) @@ -1,192 +0,0 @@ -////////////////////////////////////////////////////////////////////// -//// //// -//// XTEA IP Core //// -//// //// -//// This file is part of the xtea project //// -//// http://www.opencores.org/projects.cgi/web/xtea/overview //// -//// //// -//// An implementation of the XTEA encryption algorithm. //// -//// //// -//// TODO: //// -//// * Write a spec //// -//// * Wishbone compliance //// -//// //// -//// Author: David Johnson, dj@david-web.co.uk //// -//// //// -////////////////////////////////////////////////////////////////////// -//// //// -//// Copyright (C) 2006 David Johnson //// -//// //// -//// This source file is free software; you can redistribute it //// -//// and/or modify it under the terms of the GNU Lesser General //// -//// Public License as published by the Free Software Foundation; //// -//// either version 2.1 of the License, or (at your option) any //// -//// later version. //// -//// //// -//// This source is distributed in the hope that it will be //// -//// useful, but WITHOUT ANY WARRANTY; without even the implied //// -//// warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR //// -//// PURPOSE. See the GNU Lesser General Public License for more //// -//// details. //// -//// //// -//// You should have received a copy of the GNU Lesser General //// -//// Public License along with this source; if not, write to the //// -//// Free Software Foundation, Inc., 51 Franklin Street, Fifth //// -//// Floor, Boston, MA 02110-1301 USA //// -//// //// -////////////////////////////////////////////////////////////////////// -// -// CVS Revision History -// -// $Log: not supported by cvs2svn $ -// - -module xtea(clock, reset, mode, data_in1, data_in2, key_in, data_out1, data_out2, all_done); - -parameter s0 = 8'd0, s1 = 8'd1, s2 = 8'd2, s3 = 8'd3, s4 = 8'd4, s5 = 8'd5, s6 = 8'd6, s7 = 8'd7, s8 = 8'd8, s9 = 8'd9, s10 = 8'd10, - s11 = 8'd11, s12 = 8'd12, s13 = 8'd13, s14 = 8'd14, s15 = 8'd15, s16 = 8'd16, s17 = 8'd17; - -input clock, reset, mode; -input[31:0] data_in1, data_in2; -input[127:0] key_in; -output[31:0] data_out1, data_out2; -output all_done; - -wire clock, reset; -wire[31:0] data_in1, data_in2; -wire[127:0] key_in; -reg all_done, while_flag, modereg; -reg[1:0] selectslice; -reg[7:0] state; -reg[7:0] x; -reg[31:0] data_out1, data_out2, sum, workunit1, workunit2, delta; - -always @(posedge clock or posedge reset) -begin - if (reset) - //reset state - state = s0; - else begin - case (state) - s0: state = s1; - s1: state = s2; - s2: state = s3; - s3: state = while_flag ? s4 : s14; - s4: state = modereg ? s10 : s5; - s5: state = s6; - s6: state = s7; - s7: state = s8; - s8: state = s9; - s9: state = s2; - s10: state = s11; - s11: state = s12; - s12: state = s13; - s13: state = s14; - s14: state = s2; - s15: state = s16; - s16: state = s17; - s17: state = s17; - default: state = 4'bxxxx; - endcase - end -end - -always @(posedge clock or posedge reset) -begin - if (reset) begin - //reset all our outputs and registers - data_out1 = 32'h00000000; - data_out2 = 32'h00000000; - x = 8'b00000000; - sum = 32'h00000000; - while_flag = 1'b0; - workunit1 = 32'h00000000; - workunit2 = 32'h00000000; - selectslice = 1'b0; - all_done = 1'b0; - delta = 32'h00000000; - modereg = 1'b0; - end - else begin - case (state) - s1: begin - //store input values to registers in case they're not stable - workunit1 = data_in1; - workunit2 = data_in2; - delta = 32'h9E3779B9; - sum = 32'hc6ef3720; - modereg = mode; - end - s2: if (x < 8'd32) while_flag = 1'b1; else while_flag = 1'b0; - s3: begin - //This null state was necessary to fix a timing issue. - //s2 sets while_flag and previously the control path read it in the same state - //(but in the next clock cycle), however the reg wasn't set when we tried to - //read it, so this state was inserted to add a delay. This was when running @25MHz. - //FIXME: there's got to be a better solution to this... - end - s4: begin - //This state does nothing in the data path; it's used for an if statement in the - //control path. - end - /* States 5-9 used for decipher operations */ - s5: selectslice = (sum >> 32'd11 & 32'd3); - s6: case (selectslice) - 2'b00: workunit2 = workunit2 - (((workunit1 << 4 ^ workunit1 >> 5) + workunit1) ^ (sum + key_in[127:96])); - 2'b01: workunit2 = workunit2 - (((workunit1 << 4 ^ workunit1 >> 5) + workunit1) ^ (sum + key_in[95:64])); - 2'b10: workunit2 = workunit2 - (((workunit1 << 4 ^ workunit1 >> 5) + workunit1) ^ (sum + key_in[63:32])); - 2'b11: workunit2 = workunit2 - (((workunit1 << 4 ^ workunit1 >> 5) + workunit1) ^ (sum + key_in[31:0])); - default: workunit2 = 32'bzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz; - endcase - s7: sum = sum - delta; - s8: selectslice = (sum & 32'd3); - s9: begin - case (selectslice) - 2'b00: workunit1 = workunit1 - (((workunit2 << 4 ^ workunit2 >> 5) + workunit2) ^ (sum + key_in[127:96])); - 2'b01: workunit1 = workunit1 - (((workunit2 << 4 ^ workunit2 >> 5) + workunit2) ^ (sum + key_in[95:64])); - 2'b10: workunit1 = workunit1 - (((workunit2 << 4 ^ workunit2 >> 5) + workunit2) ^ (sum + key_in[63:32])); - 2'b11: workunit1 = workunit1 - (((workunit2 << 4 ^ workunit2 >> 5) + workunit2) ^ (sum + key_in[31:0])); - default: workunit1 = 32'bzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz; - endcase - x = x + 1'b1; - end - /* States 10-14 used for encipher operations */ - s10: selectslice = (sum & 32'd3); - s11: case (selectslice) - 2'b00: workunit1 = workunit1 + (((workunit2 << 4 ^ workunit2 >> 5) + workunit2) ^ (sum + key_in[127:96])); - 2'b01: workunit1 = workunit1 + (((workunit2 << 4 ^ workunit2 >> 5) + workunit2) ^ (sum + key_in[95:64])); - 2'b10: workunit1 = workunit1 + (((workunit2 << 4 ^ workunit2 >> 5) + workunit2) ^ (sum + key_in[63:32])); - 2'b11: workunit1 = workunit1 + (((workunit2 << 4 ^ workunit2 >> 5) + workunit2) ^ (sum + key_in[31:0])); - default: workunit1 = 32'bzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz; - endcase - s12: sum = sum + delta; - s13: selectslice = (sum >> 32'd11 & 32'd3); - s14: begin - case (selectslice) - 2'b00: workunit2 = workunit2 + (((workunit1 << 4 ^ workunit1 >> 5) + workunit1) ^ (sum + key_in[127:96])); - 2'b01: workunit2 = workunit2 + (((workunit1 << 4 ^ workunit1 >> 5) + workunit1) ^ (sum + key_in[95:64])); - 2'b10: workunit2 = workunit2 + (((workunit1 << 4 ^ workunit1 >> 5) + workunit1) ^ (sum + key_in[63:32])); - 2'b11: workunit2 = workunit2 + (((workunit1 << 4 ^ workunit1 >> 5) + workunit1) ^ (sum + key_in[31:0])); - default: workunit2 = 32'bzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz; - endcase - x = x + 1'b1; - end - s15: begin - //This state was added to fix a timing issue. - //Same issue as above - trying to read workunit1 & workunit2 before they've settled. - end - s16: begin - //set the outputs to the working registers - data_out1 = workunit1; - data_out2 = workunit2; - end - s17: all_done = 1'b1; - default: begin - data_out1 = 32'bzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz; - data_out2 = 32'bzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz; - end - endcase - end -end - -endmodule \ No newline at end of file Index: xtea/trunk/releases/xtea-1.0.tar.gz =================================================================== Cannot display: file marked as a binary type. svn:mime-type = application/octet-stream Index: xtea/trunk/releases/xtea-1.0.tar.gz =================================================================== --- xtea/trunk/releases/xtea-1.0.tar.gz (nonexistent) +++ xtea/trunk/releases/xtea-1.0.tar.gz (revision 6)

xtea/trunk/releases/xtea-1.0.tar.gz Property changes : Added: svn:mime-type ## -0,0 +1 ## +application/octet-stream \ No newline at end of property Index: xtea/trunk/releases/xtea-1.0.zip =================================================================== Cannot display: file marked as a binary type. svn:mime-type = application/octet-stream Index: xtea/trunk/releases/xtea-1.0.zip =================================================================== --- xtea/trunk/releases/xtea-1.0.zip (nonexistent) +++ xtea/trunk/releases/xtea-1.0.zip (revision 6)

xtea/trunk/releases/xtea-1.0.zip Property changes : Added: svn:mime-type ## -0,0 +1 ## +application/octet-stream \ No newline at end of property Index: xtea/trunk/LICENSE =================================================================== --- xtea/trunk/LICENSE (nonexistent) +++ xtea/trunk/LICENSE (revision 6) @@ -0,0 +1,502 @@ + GNU LESSER GENERAL PUBLIC LICENSE + Version 2.1, February 1999 + + Copyright (C) 1991, 1999 Free Software Foundation, Inc. + 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + +[This is the first released version of the Lesser GPL. It also counts + as the successor of the GNU Library Public License, version 2, hence + the version number 2.1.] + + Preamble + + The licenses for most software are designed to take away your +freedom to share and change it. By contrast, the GNU General Public +Licenses are intended to guarantee your freedom to share and change +free software--to make sure the software is free for all its users. + + This license, the Lesser General Public License, applies to some +specially designated software packages--typically libraries--of the +Free Software Foundation and other authors who decide to use it. You +can use it too, but we suggest you first think carefully about whether +this license or the ordinary General Public License is the better +strategy to use in any particular case, based on the explanations below. + + When we speak of free software, we are referring to freedom of use, +not price. Our General Public Licenses are designed to make sure that +you have the freedom to distribute copies of free software (and charge +for this service if you wish); that you receive source code or can get +it if you want it; that you can change the software and use pieces of +it in new free programs; and that you are informed that you can do +these things. + + To protect your rights, we need to make restrictions that forbid +distributors to deny you these rights or to ask you to surrender these +rights. These restrictions translate to certain responsibilities for +you if you distribute copies of the library or if you modify it. + + For example, if you distribute copies of the library, whether gratis +or for a fee, you must give the recipients all the rights that we gave +you. You must make sure that they, too, receive or can get the source +code. If you link other code with the library, you must provide +complete object files to the recipients, so that they can relink them +with the library after making changes to the library and recompiling +it. And you must show them these terms so they know their rights. + + We protect your rights with a two-step method: (1) we copyright the +library, and (2) we offer you this license, which gives you legal +permission to copy, distribute and/or modify the library. + + To protect each distributor, we want to make it very clear that +there is no warranty for the free library. Also, if the library is +modified by someone else and passed on, the recipients should know +that what they have is not the original version, so that the original +author's reputation will not be affected by problems that might be +introduced by others. + + Finally, software patents pose a constant threat to the existence of +any free program. We wish to make sure that a company cannot +effectively restrict the users of a free program by obtaining a +restrictive license from a patent holder. Therefore, we insist that +any patent license obtained for a version of the library must be +consistent with the full freedom of use specified in this license. + + Most GNU software, including some libraries, is covered by the +ordinary GNU General Public License. This license, the GNU Lesser +General Public License, applies to certain designated libraries, and +is quite different from the ordinary General Public License. We use +this license for certain libraries in order to permit linking those +libraries into non-free programs. + + When a program is linked with a library, whether statically or using +a shared library, the combination of the two is legally speaking a +combined work, a derivative of the original library. The ordinary +General Public License therefore permits such linking only if the +entire combination fits its criteria of freedom. The Lesser General +Public License permits more lax criteria for linking other code with +the library. + + We call this license the "Lesser" General Public License because it +does Less to protect the user's freedom than the ordinary General +Public License. It also provides other free software developers Less +of an advantage over competing non-free programs. These disadvantages +are the reason we use the ordinary General Public License for many +libraries. However, the Lesser license provides advantages in certain +special circumstances. + + For example, on rare occasions, there may be a special need to +encourage the widest possible use of a certain library, so that it becomes +a de-facto standard. To achieve this, non-free programs must be +allowed to use the library. A more frequent case is that a free +library does the same job as widely used non-free libraries. In this +case, there is little to gain by limiting the free library to free +software only, so we use the Lesser General Public License. + + In other cases, permission to use a particular library in non-free +programs enables a greater number of people to use a large body of +free software. For example, permission to use the GNU C Library in +non-free programs enables many more people to use the whole GNU +operating system, as well as its variant, the GNU/Linux operating +system. + + Although the Lesser General Public License is Less protective of the +users' freedom, it does ensure that the user of a program that is +linked with the Library has the freedom and the wherewithal to run +that program using a modified version of the Library. + + The precise terms and conditions for copying, distribution and +modification follow. Pay close attention to the difference between a +"work based on the library" and a "work that uses the library". The +former contains code derived from the library, whereas the latter must +be combined with the library in order to run. + + GNU LESSER GENERAL PUBLIC LICENSE + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + + 0. This License Agreement applies to any software library or other +program which contains a notice placed by the copyright holder or +other authorized party saying it may be distributed under the terms of +this Lesser General Public License (also called "this License"). +Each licensee is addressed as "you". + + A "library" means a collection of software functions and/or data +prepared so as to be conveniently linked with application programs +(which use some of those functions and data) to form executables. + + The "Library", below, refers to any such software library or work +which has been distributed under these terms. A "work based on the +Library" means either the Library or any derivative work under +copyright law: that is to say, a work containing the Library or a +portion of it, either verbatim or with modifications and/or translated +straightforwardly into another language. (Hereinafter, translation is +included without limitation in the term "modification".) + + "Source code" for a work means the preferred form of the work for +making modifications to it. For a library, complete source code means +all the source code for all modules it contains, plus any associated +interface definition files, plus the scripts used to control compilation +and installation of the library. + + Activities other than copying, distribution and modification are not +covered by this License; they are outside its scope. The act of +running a program using the Library is not restricted, and output from +such a program is covered only if its contents constitute a work based +on the Library (independent of the use of the Library in a tool for +writing it). Whether that is true depends on what the Library does +and what the program that uses the Library does. + + 1. You may copy and distribute verbatim copies of the Library's +complete source code as you receive it, in any medium, provided that +you conspicuously and appropriately publish on each copy an +appropriate copyright notice and disclaimer of warranty; keep intact +all the notices that refer to this License and to the absence of any +warranty; and distribute a copy of this License along with the +Library. + + You may charge a fee for the physical act of transferring a copy, +and you may at your option offer warranty protection in exchange for a +fee. + + 2. You may modify your copy or copies of the Library or any portion +of it, thus forming a work based on the Library, and copy and +distribute such modifications or work under the terms of Section 1 +above, provided that you also meet all of these conditions: + + a) The modified work must itself be a software library. + + b) You must cause the files modified to carry prominent notices + stating that you changed the files and the date of any change. + + c) You must cause the whole of the work to be licensed at no + charge to all third parties under the terms of this License. + + d) If a facility in the modified Library refers to a function or a + table of data to be supplied by an application program that uses + the facility, other than as an argument passed when the facility + is invoked, then you must make a good faith effort to ensure that, + in the event an application does not supply such function or + table, the facility still operates, and performs whatever part of + its purpose remains meaningful. + + (For example, a function in a library to compute square roots has + a purpose that is entirely well-defined independent of the + application. Therefore, Subsection 2d requires that any + application-supplied function or table used by this function must + be optional: if the application does not supply it, the square + root function must still compute square roots.) + +These requirements apply to the modified work as a whole. If +identifiable sections of that work are not derived from the Library, +and can be reasonably considered independent and separate works in +themselves, then this License, and its terms, do not apply to those +sections when you distribute them as separate works. But when you +distribute the same sections as part of a whole which is a work based +on the Library, the distribution of the whole must be on the terms of +this License, whose permissions for other licensees extend to the +entire whole, and thus to each and every part regardless of who wrote +it. + +Thus, it is not the intent of this section to claim rights or contest +your rights to work written entirely by you; rather, the intent is to +exercise the right to control the distribution of derivative or +collective works based on the Library. + +In addition, mere aggregation of another work not based on the Library +with the Library (or with a work based on the Library) on a volume of +a storage or distribution medium does not bring the other work under +the scope of this License. + + 3. You may opt to apply the terms of the ordinary GNU General Public +License instead of this License to a given copy of the Library. To do +this, you must alter all the notices that refer to this License, so +that they refer to the ordinary GNU General Public License, version 2, +instead of to this License. (If a newer version than version 2 of the +ordinary GNU General Public License has appeared, then you can specify +that version instead if you wish.) Do not make any other change in +these notices. + + Once this change is made in a given copy, it is irreversible for +that copy, so the ordinary GNU General Public License applies to all +subsequent copies and derivative works made from that copy. + + This option is useful when you wish to copy part of the code of +the Library into a program that is not a library. + + 4. You may copy and distribute the Library (or a portion or +derivative of it, under Section 2) in object code or executable form +under the terms of Sections 1 and 2 above provided that you accompany +it with the complete corresponding machine-readable source code, which +must be distributed under the terms of Sections 1 and 2 above on a +medium customarily used for software interchange. + + If distribution of object code is made by offering access to copy +from a designated place, then offering equivalent access to copy the +source code from the same place satisfies the requirement to +distribute the source code, even though third parties are not +compelled to copy the source along with the object code. + + 5. A program that contains no derivative of any portion of the +Library, but is designed to work with the Library by being compiled or +linked with it, is called a "work that uses the Library". Such a +work, in isolation, is not a derivative work of the Library, and +therefore falls outside the scope of this License. + + However, linking a "work that uses the Library" with the Library +creates an executable that is a derivative of the Library (because it +contains portions of the Library), rather than a "work that uses the +library". The executable is therefore covered by this License. +Section 6 states terms for distribution of such executables. + + When a "work that uses the Library" uses material from a header file +that is part of the Library, the object code for the work may be a +derivative work of the Library even though the source code is not. +Whether this is true is especially significant if the work can be +linked without the Library, or if the work is itself a library. The +threshold for this to be true is not precisely defined by law. + + If such an object file uses only numerical parameters, data +structure layouts and accessors, and small macros and small inline +functions (ten lines or less in length), then the use of the object +file is unrestricted, regardless of whether it is legally a derivative +work. (Executables containing this object code plus portions of the +Library will still fall under Section 6.) + + Otherwise, if the work is a derivative of the Library, you may +distribute the object code for the work under the terms of Section 6. +Any executables containing that work also fall under Section 6, +whether or not they are linked directly with the Library itself. + + 6. As an exception to the Sections above, you may also combine or +link a "work that uses the Library" with the Library to produce a +work containing portions of the Library, and distribute that work +under terms of your choice, provided that the terms permit +modification of the work for the customer's own use and reverse +engineering for debugging such modifications. + + You must give prominent notice with each copy of the work that the +Library is used in it and that the Library and its use are covered by +this License. You must supply a copy of this License. If the work +during execution displays copyright notices, you must include the +copyright notice for the Library among them, as well as a reference +directing the user to the copy of this License. Also, you must do one +of these things: + + a) Accompany the work with the complete corresponding + machine-readable source code for the Library including whatever + changes were used in the work (which must be distributed under + Sections 1 and 2 above); and, if the work is an executable linked + with the Library, with the complete machine-readable "work that + uses the Library", as object code and/or source code, so that the + user can modify the Library and then relink to produce a modified + executable containing the modified Library. (It is understood + that the user who changes the contents of definitions files in the + Library will not necessarily be able to recompile the application + to use the modified definitions.) + + b) Use a suitable shared library mechanism for linking with the + Library. A suitable mechanism is one that (1) uses at run time a + copy of the library already present on the user's computer system, + rather than copying library functions into the executable, and (2) + will operate properly with a modified version of the library, if + the user installs one, as long as the modified version is + interface-compatible with the version that the work was made with. + + c) Accompany the work with a written offer, valid for at + least three years, to give the same user the materials + specified in Subsection 6a, above, for a charge no more + than the cost of performing this distribution. + + d) If distribution of the work is made by offering access to copy + from a designated place, offer equivalent access to copy the above + specified materials from the same place. + + e) Verify that the user has already received a copy of these + materials or that you have already sent this user a copy. + + For an executable, the required form of the "work that uses the +Library" must include any data and utility programs needed for +reproducing the executable from it. However, as a special exception, +the materials to be distributed need not include anything that is +normally distributed (in either source or binary form) with the major +components (compiler, kernel, and so on) of the operating system on +which the executable runs, unless that component itself accompanies +the executable. + + It may happen that this requirement contradicts the license +restrictions of other proprietary libraries that do not normally +accompany the operating system. Such a contradiction means you cannot +use both them and the Library together in an executable that you +distribute. + + 7. You may place library facilities that are a work based on the +Library side-by-side in a single library together with other library +facilities not covered by this License, and distribute such a combined +library, provided that the separate distribution of the work based on +the Library and of the other library facilities is otherwise +permitted, and provided that you do these two things: + + a) Accompany the combined library with a copy of the same work + based on the Library, uncombined with any other library + facilities. This must be distributed under the terms of the + Sections above. + + b) Give prominent notice with the combined library of the fact + that part of it is a work based on the Library, and explaining + where to find the accompanying uncombined form of the same work. + + 8. You may not copy, modify, sublicense, link with, or distribute +the Library except as expressly provided under this License. Any +attempt otherwise to copy, modify, sublicense, link with, or +distribute the Library is void, and will automatically terminate your +rights under this License. However, parties who have received copies, +or rights, from you under this License will not have their licenses +terminated so long as such parties remain in full compliance. + + 9. You are not required to accept this License, since you have not +signed it. However, nothing else grants you permission to modify or +distribute the Library or its derivative works. These actions are +prohibited by law if you do not accept this License. Therefore, by +modifying or distributing the Library (or any work based on the +Library), you indicate your acceptance of this License to do so, and +all its terms and conditions for copying, distributing or modifying +the Library or works based on it. + + 10. Each time you redistribute the Library (or any work based on the +Library), the recipient automatically receives a license from the +original licensor to copy, distribute, link with or modify the Library +subject to these terms and conditions. You may not impose any further +restrictions on the recipients' exercise of the rights granted herein. +You are not responsible for enforcing compliance by third parties with +this License. + + 11. If, as a consequence of a court judgment or allegation of patent +infringement or for any other reason (not limited to patent issues), +conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot +distribute so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you +may not distribute the Library at all. For example, if a patent +license would not permit royalty-free redistribution of the Library by +all those who receive copies directly or indirectly through you, then +the only way you could satisfy both it and this License would be to +refrain entirely from distribution of the Library. + +If any portion of this section is held invalid or unenforceable under any +particular circumstance, the balance of the section is intended to apply, +and the section as a whole is intended to apply in other circumstances. + +It is not the purpose of this section to induce you to infringe any +patents or other property right claims or to contest validity of any +such claims; this section has the sole purpose of protecting the +integrity of the free software distribution system which is +implemented by public license practices. Many people have made +generous contributions to the wide range of software distributed +through that system in reliance on consistent application of that +system; it is up to the author/donor to decide if he or she is willing +to distribute software through any other system and a licensee cannot +impose that choice. + +This section is intended to make thoroughly clear what is believed to +be a consequence of the rest of this License. + + 12. If the distribution and/or use of the Library is restricted in +certain countries either by patents or by copyrighted interfaces, the +original copyright holder who places the Library under this License may add +an explicit geographical distribution limitation excluding those countries, +so that distribution is permitted only in or among countries not thus +excluded. In such case, this License incorporates the limitation as if +written in the body of this License. + + 13. The Free Software Foundation may publish revised and/or new +versions of the Lesser General Public License from time to time. +Such new versions will be similar in spirit to the present version, +but may differ in detail to address new problems or concerns. + +Each version is given a distinguishing version number. If the Library +specifies a version number of this License which applies to it and +"any later version", you have the option of following the terms and +conditions either of that version or of any later version published by +the Free Software Foundation. If the Library does not specify a +license version number, you may choose any version ever published by +the Free Software Foundation. + + 14. If you wish to incorporate parts of the Library into other free +programs whose distribution conditions are incompatible with these, +write to the author to ask for permission. For software which is +copyrighted by the Free Software Foundation, write to the Free +Software Foundation; we sometimes make exceptions for this. Our +decision will be guided by the two goals of preserving the free status +of all derivatives of our free software and of promoting the sharing +and reuse of software generally. + + NO WARRANTY + + 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO +WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. +EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR +OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY +KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE +LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME +THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN +WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY +AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU +FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR +CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE +LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING +RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A +FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF +SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH +DAMAGES. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Libraries + + If you develop a new library, and you want it to be of the greatest +possible use to the public, we recommend making it free software that +everyone can redistribute and change. You can do so by permitting +redistribution under these terms (or, alternatively, under the terms of the +ordinary General Public License). + + To apply these terms, attach the following notices to the library. It is +safest to attach them to the start of each source file to most effectively +convey the exclusion of warranty; and each file should have at least the +"copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This library is free software; you can redistribute it and/or + modify it under the terms of the GNU Lesser General Public + License as published by the Free Software Foundation; either + version 2.1 of the License, or (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Lesser General Public License for more details. + + You should have received a copy of the GNU Lesser General Public + License along with this library; if not, write to the Free Software + Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA + +Also add information on how to contact you by electronic and paper mail. + +You should also get your employer (if you work as a programmer) or your +school, if any, to sign a "copyright disclaimer" for the library, if +necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright interest in the + library `Frob' (a library for tweaking knobs) written by James Random Hacker. + + , 1 April 1990 + Ty Coon, President of Vice + +That's all there is to it! \ No newline at end of file Index: xtea/trunk/testbench.v =================================================================== --- xtea/trunk/testbench.v (nonexistent) +++ xtea/trunk/testbench.v (revision 6) @@ -0,0 +1,309 @@ +////////////////////////////////////////////////////////////////////// +//// //// +//// XTEA IP Core //// +//// //// +//// This file is part of the xtea project //// +//// http://www.opencores.org/projects.cgi/web/xtea/overview //// +//// //// +//// Test-bench for the XTEA encryption algorithm. //// +//// //// +//// TODO: //// +//// * Update for new combined encipher/decipher module //// +//// * Tidy //// +//// * Add interconnections //// +//// //// +//// Author: David Johnson, dj@david-web.co.uk //// +//// //// +////////////////////////////////////////////////////////////////////// +//// //// +//// Copyright (C) 2006 David Johnson //// +//// //// +//// This source file is free software; you can redistribute it //// +//// and/or modify it under the terms of the GNU Lesser General //// +//// Public License as published by the Free Software Foundation; //// +//// either version 2.1 of the License, or (at your option) any //// +//// later version. //// +//// //// +//// This source is distributed in the hope that it will be //// +//// useful, but WITHOUT ANY WARRANTY; without even the implied //// +//// warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR //// +//// PURPOSE. See the GNU Lesser General Public License for more //// +//// details. //// +//// //// +//// You should have received a copy of the GNU Lesser General //// +//// Public License along with this source; if not, write to the //// +//// Free Software Foundation, Inc., 51 Franklin Street, Fifth //// +//// Floor, Boston, MA 02110-1301 USA //// +//// //// +////////////////////////////////////////////////////////////////////// +// +// CVS Revision History +// +// $Log: not supported by cvs2svn $ +// + +module cipher_testbench (clock, reset, all_done_encipher, all_done_decipher, data_out_encipher1, data_out_encipher2, data_out_decipher1, data_out_decipher2, data_in_encipher1, data_in_encipher2, data_in_decipher1, data_in_decipher2, key_out, result, reset_out); + +input clock, reset, all_done_encipher, all_done_decipher; +input[31:0] data_in_encipher1, data_in_encipher2, data_in_decipher1, data_in_decipher2; +output result, reset_out; +output[31:0] data_out_encipher1, data_out_encipher2, data_out_decipher1, data_out_decipher2; +output[127:0] key_out; + +reg result, reset_out, test_ciphertext, test_plaintext; +reg[7:0] state; +reg[31:0] data_out_encipher1, data_out_encipher2, data_out_decipher1, data_out_decipher2, tempdata1, tempdata2; +reg[127:0] key_out; + +parameter s0 = 0, s1 = 1, s2 = 2, s3 = 3, s4 = 4, s5 = 5, s6 = 6, s7 = 7, s8 = 8, s9 = 9, + s10 = 10, s11 = 11, s12 = 12, s13 = 13, s14 = 14, s15 = 15, s16 = 16, s17 = 17, s18 = 18, s19 = 19, + s20 = 20, s21 = 21, s22 = 22, s23 = 23, s24 = 24, s25 = 25, s26 = 26, s27 = 27, s28 = 28, s29 = 29, + s30 = 30, s31 = 31, s32 = 32, s33 = 33, s34 = 34, s35 = 35, s36 = 36, s37 = 37, s38 = 38, s39 = 39, + s40 = 40, s41 = 41, s42 = 42, s43 = 43, s44 = 44, s45 = 45, s46 = 46, s47 = 47, s48 = 48, s49 = 49; + +always @(posedge clock or posedge reset) +begin + if (reset) + state = s0; + else + begin + case (state) + s0: state = s1; + s1: state = s2; + s2: state = all_done_encipher ? s3 : s2; + s3: state = s4; + s4: state = s5; + s5: state = all_done_decipher ? s6 : s5; + s6: state = s7; + s7: state = s8; + s8: state = s9; + s9: state = all_done_encipher ? s10 : s9; + s10: state = s11; + s11: state = s12; + s12: state = all_done_decipher ? s13 : s12; + s13: state = s14; + s14: state = s15; + s15: state = s16; + s16: state = all_done_encipher ? s17 : s16; + s17: state = s18; + s18: state = s19; + s19: state = all_done_decipher ? s20 : s19; + s20: state = s21; + s21: state = s22; + s22: state = s23; + s23: state = all_done_encipher ? s24 : s23; + s24: state = s25; + s25: state = s26; + s26: state = all_done_decipher ? s27 : s26; + s27: state = s28; + s28: state = s29; + s29: state = s30; + s30: state = all_done_encipher ? s31 : s30; + s31: state = s32; + s32: state = s33; + s33: state = all_done_decipher ? s34 : s33; + s34: state = s35; + s35: state = s36; + s36: state = s37; + s37: state = all_done_encipher ? s38 : s37; + s38: state = s39; + s39: state = s40; + s40: state = all_done_decipher ? s41 : s40; + s41: state = s42; + s42: state = s43; + s43: state = s44; + s44: state = all_done_encipher ? s45 : s44; + s45: state = s46; + s46: state = s47; + s47: state = all_done_decipher ? s48 : s47; + s48: state = s49; + s49: state = s49; + default: state = 1'bz; + endcase + end +end + +always @(posedge clock or posedge reset) +begin + if (reset) + begin + result = 1'b0; + reset_out = 1'b0; + test_ciphertext = 1'b0; + test_plaintext = 1'b0; + data_out_encipher1 = 32'bxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx; + data_out_encipher2 = 32'bxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx; + data_out_decipher1 = 32'bxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx; + data_out_decipher2 = 32'bxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx; + key_out = 128'bxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx; + end + else begin + case (state) + //Test 1 + s1: begin + reset_out = 1'b1; + data_out_encipher1 = 32'h00000000; + data_out_encipher2 = 32'h00000000; + key_out = 128'h00000000000000000000000000000000; + end + s2: reset_out = 1'b0; + s3: begin + test_ciphertext = ((data_in_encipher1 == 32'hdee9d4d8) && (data_in_encipher2 == 32'hf7131ed9)); + tempdata1 = data_in_encipher1; + tempdata2 = data_in_encipher2; + end + s4: begin + reset_out = 1'b1; + data_out_decipher1 = tempdata1; + data_out_decipher2 = tempdata2; + end + s5: reset_out = 1'b0; + s6: test_plaintext = ((data_in_decipher1 == 32'h00000000) && (data_in_decipher2 == 32'h00000000)); + s7: result = (test_ciphertext && test_plaintext); + //Test 2 + s8: begin + result = 1'b0; + reset_out = 1'b1; + data_out_encipher1 = 32'h00000000; + data_out_encipher2 = 32'h00000000; + key_out = 128'h11111111222222223333333344444444; + end + s9: reset_out = 1'b0; + s10: begin + test_ciphertext = ((data_in_encipher1 == 32'hf07ac290) && (data_in_encipher2 == 32'h23c92672)); + tempdata1 = data_in_encipher1; + tempdata2 = data_in_encipher2; + end + s11: begin + reset_out = 1'b1; + data_out_decipher1 = tempdata1; + data_out_decipher2 = tempdata2; + end + s12: reset_out = 1'b0; + s13: test_plaintext = ((data_in_decipher1 == 32'h00000000) && (data_in_decipher2 == 32'h00000000)); + s14: result = (test_ciphertext && test_plaintext); + //Test 3 + s15: begin + result = 1'b0; + reset_out = 1'b1; + data_out_encipher1 = 32'h12345678; + data_out_encipher2 = 32'h9abcdeff; + key_out = 128'h6a1d78c88c86d67f2a65bfbeb4bd6e46; + end + s16: reset_out = 1'b0; + s17: begin + test_ciphertext = ((data_in_encipher1 == 32'h99bbb92b) && (data_in_encipher2 == 32'h3ebd1644)); + tempdata1 = data_in_encipher1; + tempdata2 = data_in_encipher2; + end + s18: begin + reset_out = 1'b1; + data_out_decipher1 = tempdata1; + data_out_decipher2 = tempdata2; + end + s19: reset_out = 1'b0; + s20: test_plaintext = ((data_in_decipher1 == 32'h12345678) && (data_in_decipher2 == 32'h9abcdeff)); + s21: result = (test_ciphertext && test_plaintext); + //Test 4 + s22: begin + result = 1'b0; + reset_out = 1'b1; + data_out_encipher1 = 32'h00000001; + data_out_encipher2 = 32'h00000001; + key_out = 128'h62ee209f69b7afce376a8936cdc9e923; + end + s23: reset_out = 1'b0; + s24: begin + test_ciphertext = ((data_in_encipher1 == 32'he57220dd) && (data_in_encipher2 == 32'h2622745b)); + tempdata1 = data_in_encipher1; + tempdata2 = data_in_encipher2; + end + s25: begin + reset_out = 1'b1; + data_out_decipher1 = tempdata1; + data_out_decipher2 = tempdata2; + end + s26: reset_out = 1'b0; + s27: test_plaintext = ((data_in_decipher1 == 32'h00000001) && (data_in_decipher2 == 32'h00000001)); + s28: result = (test_ciphertext && test_plaintext); + //Test 5 + s29: begin + result = 1'b0; + reset_out = 1'b1; + data_out_encipher1 = 32'h77777777; + data_out_encipher2 = 32'h98765432; + key_out = 128'hbc3a7de2845846cf2794a1276b8ea8b8; + end + s30: reset_out = 1'b0; + s31: begin + test_ciphertext = ((data_in_encipher1 == 32'hda6b0b0a) && (data_in_encipher2 == 32'ha15e9758)); + tempdata1 = data_in_encipher1; + tempdata2 = data_in_encipher2; + end + s32: begin + reset_out = 1'b1; + data_out_decipher1 = tempdata1; + data_out_decipher2 = tempdata2; + end + s33: reset_out = 1'b0; + s34: test_plaintext = ((data_in_decipher1 == 32'h77777777) && (data_in_decipher2 == 32'h98765432)); + s35: result = (test_ciphertext && test_plaintext); + //Test 6 + s36: begin + result = 1'b0; + reset_out = 1'b1; + data_out_encipher1 = 32'hffffffff; + data_out_encipher2 = 32'hffffffff; + key_out = 128'h6a1d78c88c86d6712a65bfbeb4bd6e46; + end + s37: reset_out = 1'b0; + s38: begin + test_ciphertext = ((data_in_encipher1 == 32'h674e0539) && (data_in_encipher2 == 32'h5ad31ab8)); + tempdata1 = data_in_encipher1; + tempdata2 = data_in_encipher2; + end + s39: begin + reset_out = 1'b1; + data_out_decipher1 = tempdata1; + data_out_decipher2 = tempdata2; + end + s40: reset_out = 1'b0; + s41: test_plaintext = ((data_in_decipher1 == 32'hffffffff) && (data_in_decipher2 == 32'hffffffff)); + s42: result = (test_ciphertext && test_plaintext); + //Test 7 + s43: begin + result = 1'b0; + reset_out = 1'b1; + data_out_encipher1 = 32'hffffffff; + data_out_encipher2 = 32'hffffffff; + key_out = 128'hffffffffffffffffffffffffffffffff; + end + s44: reset_out = 1'b0; + s45: begin + test_ciphertext = ((data_in_encipher1 == 32'h28fc2891) && (data_in_encipher2 == 32'he623566a)); + tempdata1 = data_in_encipher1; + tempdata2 = data_in_encipher2; + end + s46: begin + reset_out = 1'b1; + data_out_decipher1 = tempdata1; + data_out_decipher2 = tempdata2; + end + s47: reset_out = 1'b0; + s48: test_plaintext = ((data_in_decipher1 == 32'hffffffff) && (data_in_decipher2 == 32'hffffffff)); + s49: result = (test_ciphertext && test_plaintext); + //End tests + default: begin + reset_out = 1'b1; + data_out_encipher1 = 32'bzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz; + data_out_encipher2 = 32'bzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz; + data_out_decipher1 = 32'bzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz; + data_out_decipher2 = 32'bzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz; + key_out = 128'bzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz; + result = 1'bz; + end + endcase + end +end + +endmodule \ No newline at end of file

xtea/trunk/testbench.v Property changes : Added: svn:executable ## -0,0 +1 ## +* \ No newline at end of property Index: xtea/trunk/xtea.v =================================================================== --- xtea/trunk/xtea.v (nonexistent) +++ xtea/trunk/xtea.v (revision 6) @@ -0,0 +1,192 @@ +////////////////////////////////////////////////////////////////////// +//// //// +//// XTEA IP Core //// +//// //// +//// This file is part of the xtea project //// +//// http://www.opencores.org/projects.cgi/web/xtea/overview //// +//// //// +//// An implementation of the XTEA encryption algorithm. //// +//// //// +//// TODO: //// +//// * Write a spec //// +//// * Wishbone compliance //// +//// //// +//// Author: David Johnson, dj@david-web.co.uk //// +//// //// +////////////////////////////////////////////////////////////////////// +//// //// +//// Copyright (C) 2006 David Johnson //// +//// //// +//// This source file is free software; you can redistribute it //// +//// and/or modify it under the terms of the GNU Lesser General //// +//// Public License as published by the Free Software Foundation; //// +//// either version 2.1 of the License, or (at your option) any //// +//// later version. //// +//// //// +//// This source is distributed in the hope that it will be //// +//// useful, but WITHOUT ANY WARRANTY; without even the implied //// +//// warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR //// +//// PURPOSE. See the GNU Lesser General Public License for more //// +//// details. //// +//// //// +//// You should have received a copy of the GNU Lesser General //// +//// Public License along with this source; if not, write to the //// +//// Free Software Foundation, Inc., 51 Franklin Street, Fifth //// +//// Floor, Boston, MA 02110-1301 USA //// +//// //// +////////////////////////////////////////////////////////////////////// +// +// CVS Revision History +// +// $Log: not supported by cvs2svn $ +// + +module xtea(clock, reset, mode, data_in1, data_in2, key_in, data_out1, data_out2, all_done); + +parameter s0 = 8'd0, s1 = 8'd1, s2 = 8'd2, s3 = 8'd3, s4 = 8'd4, s5 = 8'd5, s6 = 8'd6, s7 = 8'd7, s8 = 8'd8, s9 = 8'd9, s10 = 8'd10, + s11 = 8'd11, s12 = 8'd12, s13 = 8'd13, s14 = 8'd14, s15 = 8'd15, s16 = 8'd16, s17 = 8'd17; + +input clock, reset, mode; +input[31:0] data_in1, data_in2; +input[127:0] key_in; +output[31:0] data_out1, data_out2; +output all_done; + +wire clock, reset; +wire[31:0] data_in1, data_in2; +wire[127:0] key_in; +reg all_done, while_flag, modereg; +reg[1:0] selectslice; +reg[7:0] state; +reg[7:0] x; +reg[31:0] data_out1, data_out2, sum, workunit1, workunit2, delta; + +always @(posedge clock or posedge reset) +begin + if (reset) + //reset state + state = s0; + else begin + case (state) + s0: state = s1; + s1: state = s2; + s2: state = s3; + s3: state = while_flag ? s4 : s14; + s4: state = modereg ? s10 : s5; + s5: state = s6; + s6: state = s7; + s7: state = s8; + s8: state = s9; + s9: state = s2; + s10: state = s11; + s11: state = s12; + s12: state = s13; + s13: state = s14; + s14: state = s2; + s15: state = s16; + s16: state = s17; + s17: state = s17; + default: state = 4'bxxxx; + endcase + end +end + +always @(posedge clock or posedge reset) +begin + if (reset) begin + //reset all our outputs and registers + data_out1 = 32'h00000000; + data_out2 = 32'h00000000; + x = 8'b00000000; + sum = 32'h00000000; + while_flag = 1'b0; + workunit1 = 32'h00000000; + workunit2 = 32'h00000000; + selectslice = 1'b0; + all_done = 1'b0; + delta = 32'h00000000; + modereg = 1'b0; + end + else begin + case (state) + s1: begin + //store input values to registers in case they're not stable + workunit1 = data_in1; + workunit2 = data_in2; + delta = 32'h9E3779B9; + sum = 32'hc6ef3720; + modereg = mode; + end + s2: if (x < 8'd32) while_flag = 1'b1; else while_flag = 1'b0; + s3: begin + //This null state was necessary to fix a timing issue. + //s2 sets while_flag and previously the control path read it in the same state + //(but in the next clock cycle), however the reg wasn't set when we tried to + //read it, so this state was inserted to add a delay. This was when running @25MHz. + //FIXME: there's got to be a better solution to this... + end + s4: begin + //This state does nothing in the data path; it's used for an if statement in the + //control path. + end + /* States 5-9 used for decipher operations */ + s5: selectslice = (sum >> 32'd11 & 32'd3); + s6: case (selectslice) + 2'b00: workunit2 = workunit2 - (((workunit1 << 4 ^ workunit1 >> 5) + workunit1) ^ (sum + key_in[127:96])); + 2'b01: workunit2 = workunit2 - (((workunit1 << 4 ^ workunit1 >> 5) + workunit1) ^ (sum + key_in[95:64])); + 2'b10: workunit2 = workunit2 - (((workunit1 << 4 ^ workunit1 >> 5) + workunit1) ^ (sum + key_in[63:32])); + 2'b11: workunit2 = workunit2 - (((workunit1 << 4 ^ workunit1 >> 5) + workunit1) ^ (sum + key_in[31:0])); + default: workunit2 = 32'bzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz; + endcase + s7: sum = sum - delta; + s8: selectslice = (sum & 32'd3); + s9: begin + case (selectslice) + 2'b00: workunit1 = workunit1 - (((workunit2 << 4 ^ workunit2 >> 5) + workunit2) ^ (sum + key_in[127:96])); + 2'b01: workunit1 = workunit1 - (((workunit2 << 4 ^ workunit2 >> 5) + workunit2) ^ (sum + key_in[95:64])); + 2'b10: workunit1 = workunit1 - (((workunit2 << 4 ^ workunit2 >> 5) + workunit2) ^ (sum + key_in[63:32])); + 2'b11: workunit1 = workunit1 - (((workunit2 << 4 ^ workunit2 >> 5) + workunit2) ^ (sum + key_in[31:0])); + default: workunit1 = 32'bzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz; + endcase + x = x + 1'b1; + end + /* States 10-14 used for encipher operations */ + s10: selectslice = (sum & 32'd3); + s11: case (selectslice) + 2'b00: workunit1 = workunit1 + (((workunit2 << 4 ^ workunit2 >> 5) + workunit2) ^ (sum + key_in[127:96])); + 2'b01: workunit1 = workunit1 + (((workunit2 << 4 ^ workunit2 >> 5) + workunit2) ^ (sum + key_in[95:64])); + 2'b10: workunit1 = workunit1 + (((workunit2 << 4 ^ workunit2 >> 5) + workunit2) ^ (sum + key_in[63:32])); + 2'b11: workunit1 = workunit1 + (((workunit2 << 4 ^ workunit2 >> 5) + workunit2) ^ (sum + key_in[31:0])); + default: workunit1 = 32'bzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz; + endcase + s12: sum = sum + delta; + s13: selectslice = (sum >> 32'd11 & 32'd3); + s14: begin + case (selectslice) + 2'b00: workunit2 = workunit2 + (((workunit1 << 4 ^ workunit1 >> 5) + workunit1) ^ (sum + key_in[127:96])); + 2'b01: workunit2 = workunit2 + (((workunit1 << 4 ^ workunit1 >> 5) + workunit1) ^ (sum + key_in[95:64])); + 2'b10: workunit2 = workunit2 + (((workunit1 << 4 ^ workunit1 >> 5) + workunit1) ^ (sum + key_in[63:32])); + 2'b11: workunit2 = workunit2 + (((workunit1 << 4 ^ workunit1 >> 5) + workunit1) ^ (sum + key_in[31:0])); + default: workunit2 = 32'bzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz; + endcase + x = x + 1'b1; + end + s15: begin + //This state was added to fix a timing issue. + //Same issue as above - trying to read workunit1 & workunit2 before they've settled. + end + s16: begin + //set the outputs to the working registers + data_out1 = workunit1; + data_out2 = workunit2; + end + s17: all_done = 1'b1; + default: begin + data_out1 = 32'bzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz; + data_out2 = 32'bzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz; + end + endcase + end +end + +endmodule \ No newline at end of file Index: xtea/trunk =================================================================== --- xtea/trunk (nonexistent) +++ xtea/trunk (revision 6)

xtea/trunk Property changes : Added: svn:mergeinfo ## -0,0 +0,0 ## Index: xtea/web_uploads =================================================================== --- xtea/web_uploads (nonexistent) +++ xtea/web_uploads (revision 6)

xtea/web_uploads Property changes : Added: svn:mergeinfo ## -0,0 +0,0 ## Index: xtea/branches =================================================================== --- xtea/branches (nonexistent) +++ xtea/branches (revision 6)

xtea/branches Property changes : Added: svn:mergeinfo ## -0,0 +0,0 ## Index: xtea/tags =================================================================== --- xtea/tags (nonexistent) +++ xtea/tags (revision 6)

xtea/tags Property changes : Added: svn:mergeinfo ## -0,0 +0,0 ##