Ñò
é~_>c @ sv d Z d Z d d k l Z d d d „ ƒ YZ e d j o6d Z d GHe GHd GHg Z d
Z x8 e d e
e ƒ e ƒ D] Z e i e e e e !ƒ qv Wd GHd d
k
l Z l Z d Z g Z e D]% Z e e i e e d e ƒi ƒ qÄ [ Z e
e ƒ e
e ƒ j p t ‚ g Z e d e e
e ƒ ƒ e e ƒ Z e GHx- e D]% \ Z Z Z e i e e e f ƒ qEWd GHe d d d d ƒ Z e i e ƒ Z d d k l! Z! g Z" d GHxŠ e D]‚ \ Z Z Z e i e e d e ƒZ# e# i ƒ Z$ e$ e j o d Z% e" i e ƒ n d Z% e% Gd e Ge& e ƒ Ge! e ƒ d GHq¹Wd GHd i' e" ƒ Z( e( e j o d GHqrd GHn d S( s£ This file implements the chaffing algorithm.
Winnowing and chaffing is a technique for enhancing privacy without requiring
strong encryption. In short, the technique takes a set of authenticated
message blocks (the wheat) and adds a number of chaff blocks which have
randomly chosen data and MAC fields. This means that to an adversary, the
chaff blocks look as valid as the wheat blocks, and so the authentication
would have to be performed on every block. By tailoring the number of chaff
blocks added to the message, the sender can make breaking the message
computationally infeasible. There are many other interesting properties of
the winnow/chaff technique.
For example, say Alice is sending a message to Bob. She packetizes the
message and performs an all-or-nothing transformation on the packets. Then
she authenticates each packet with a message authentication code (MAC). The
MAC is a hash of the data packet, and there is a secret key which she must
share with Bob (key distribution is an exercise left to the reader). She then
adds a serial number to each packet, and sends the packets to Bob.
Bob receives the packets, and using the shared secret authentication key,
authenticates the MACs for each packet. Those packets that have bad MACs are
simply discarded. The remainder are sorted by serial number, and passed
through the reverse all-or-nothing transform. The transform means that an
eavesdropper (say Eve) must acquire all the packets before any of the data can
be read. If even one packet is missing, the data is useless.
There's one twist: by adding chaff packets, Alice and Bob can make Eve's job
much harder, since Eve now has to break the shared secret key, or try every
combination of wheat and chaff packet to read any of the message. The cool
thing is that Bob doesn't need to add any additional code; the chaff packets
are already filtered out because their MACs don't match (in all likelihood --
since the data and MACs for the chaff packets are randomly chosen it is
possible, but very unlikely that a chaff MAC will match the chaff data). And
Alice need not even be the party adding the chaff! She could be completely
unaware that a third party, say Charles, is adding chaff packets to her
messages as they are transmitted.
For more information on winnowing and chaffing see this paper:
Ronald L. Rivest, "Chaffing and Winnowing: Confidentiality without Encryption"
http://theory.lcs.mit.edu/~rivest/chaffing.txt
s: $Id: Chaffing.py,v 1.7 2003/02/28 15:23:21 akuchling Exp $iÿÿÿÿ( t
bytes_to_longt Chaffc B s/ e Z d Z d d d „ Z d „ Z d „ Z RS( sR Class implementing the chaff adding algorithm.
Methods for subclasses:
_randnum(size):
Returns a randomly generated number with a byte-length equal
to size. Subclasses can use this to implement better random
data and MAC generating algorithms. The default algorithm is
probably not very cryptographically secure. It is most
important that the chaff data does not contain any patterns
that can be used to discern it from wheat data without running
the MAC.
g ð?i c C s[ d | j o
d j n p
t d ‚ n | d j o
t d ‚ n | | _ | | _ d S( sÐ Chaff(factor:float, blocksper:int)
factor is the number of message blocks to add chaff to,
expressed as a percentage between 0.0 and 1.0. blocksper is
the number of chaff blocks to include for each block being
chaffed. Thus the defaults add one chaff block to every
message block. By changing the defaults, you can adjust how
computationally difficult it could be for an adversary to
brute-force crack the message. The difficulty is expressed
as:
pow(blocksper, int(factor * number-of-blocks))
For ease of implementation, when factor < 1.0, only the first
int(factor*number-of-blocks) message blocks are chaffed.
g g ð?s$ 'factor' must be between 0.0 and 1.0i s 'blocksper' must be zero or moreN( t
ValueErrort _Chaff__factort _Chaff__blocksper( t selft factort blocksper( ( s> /usr/lib64/python2.6/site-packages/Crypto/Protocol/Chaffing.pyt __init__A s
c C sM g } t | ƒ | i } t | i ƒ } x t d t t | ƒ ƒ | ƒ D]þ \ } } | | j oØ | \ } } } t | ƒ }
t | ƒ } d } xŒ | D]„ }
d d k } | i |
ƒ } | i | ƒ } | | | f } | o1 t | i d ƒ ƒ d @o | i | ƒ d } n | i | ƒ q” W| o | i | ƒ qEqG | i | ƒ qG W| S( sX chaff( [(serial-number:int, data:string, MAC:string)] )
: [(int, string, string)]
Add chaff to message blocks. blocks is a list of 3-tuples of the
form (serial-number, data, MAC).
Chaff is created by choosing a random number of the same
byte-length as data, and another random number of the same
byte-length as MAC. The message block's serial number is
placed on the chaff block and all the packet's chaff blocks
are randomly interspersed with the single wheat block. This
method then returns a list of 3-tuples of the same form.
Chaffed blocks will contain multiple instances of 3-tuples
with the same serial number, but the only way to figure out
which blocks are wheat and which are chaff is to perform the
MAC hash and compare values.
i iÿÿÿÿNi i@ i (
t lenR t rangeR t mapt Nonet syst _randnumR t append( R t blockst
chaffedblockst countR t it wheatt serialt datat mact datasizet macsizet addwheatt jR
t chaffdatat chaffmact chaff( ( s> /usr/lib64/python2.6/site-packages/Crypto/Protocol/Chaffing.pyR \ s0
!
c C sT d d k l } d d k } | i | d ƒ } x | | i j o q2 W| i | ƒ S( Niÿÿÿÿ( t randpooli ( t Crypto.UtilR t timet
RandomPoolt entropyt get_bytes( R t sizeR R! t pool( ( s> /usr/lib64/python2.6/site-packages/Crypto/Protocol/Chaffing.pyR ’ s ( t __name__t
__module__t __doc__R R R ( ( ( s> /usr/lib64/python2.6/site-packages/Crypto/Protocol/Chaffing.pyR 1 s 6t __main__sŽ We hold these truths to be self-evident, that all men are created equal, that
they are endowed by their Creator with certain unalienable Rights, that among
these are Life, Liberty, and the pursuit of Happiness. That to secure these
rights, Governments are instituted among Men, deriving their just powers from
the consent of the governed. That whenever any Form of Government becomes
destructive of these ends, it is the Right of the People to alter or to
abolish it, and to institute new Government, laying its foundation on such
principles and organizing its powers in such form, as to them shall seem most
likely to effect their Safety and Happiness.
s Original text:
==========s
==========i( i s Calculating MACs...( t HMACt SHAt Jeffersont digestmods Adding chaff...R g à?R i ( t encodestrings chaffed message blocks:s -->s s %3ds Undigesting wheat...t s They match!s They differ!N( () R) t __revision__t Crypto.Util.numberR R R' t textR R% R
R R R t Crypto.HashR+ R, t keyt _[1]t blockt newt digestt macst AssertionErrort sourceR R t mR R t cR t chaffedt base64R/ R t ht pmact tagt reprt joint newtext( ( ( s> /usr/lib64/python2.6/site-packages/Crypto/Protocol/Chaffing.pyt + s\ p
2 !