Primitives For Fast Secure Hash Functions And Stream Ciphers
AssigneeMicrosoft Corporation
InventorsRamarathnam Venkatesan, Matthew Cary
Life of this patent
Estimating the term…
Abstract
Techniques are disclosed to enable efficient implementation of secure hash functions and/or stream ciphers. More specifically, a family of graphs is described that has relatively large girth, large claw, and/or rapid mixing properties. The graphs are suitable for construction of cryptographic primitives such as collision resistant hash functions and stream ciphers, which allow efficient software implementation.
Claims20
In a computing environment, a method comprising:
- providing a graph corresponding to a data input block;
- labeling each outgoing edge of every node in the graph with a label;
- tracing a path through a plurality of labels on the graph, the path being defined by a sequence of elements within the input block;
- and
- using the tracing of the path for encryption in the computing environment wherein the tracing of the path through the plurality of labels facilitates more efficient.
In a computing environment, a method comprising:
- constructing a table of entries, wherein the table of entries include all possible products of a predetermined generator matrix;
- setting an initial matrix to an identity matrix;
- processing input data as one or more blocks of fixed length;
- indexing each block to the generator matrix represented in the table;
- and
- updating the initial matrix.
One or more computer storage media having computer executable instructions embodied thereon, the instructions when executed in a computing environment performing a method comprising:
- labeling each of a plurality of nodes with a matrix, wherein the plurality of nodes make up a graph;
- navigating to a next node of the graph utilizing the label of that next node;
- multiplying each node matrix by at least one of a plurality of generator matrices;
- and
- providing the result of the multiplying each node matrix to a computing environment wherein the result of the multiplying each node matrix facilitates more efficient.
Dependencies are inferred from the claim text.