32 Hits in 6.5 sec

Two practical and provably secure block ciphers: BEAR and LION [chapter]

Ross Anderson, Eli Biham
1996 Lecture Notes in Computer Science  
In this paper we suggest two new provably secure block ciphers, called BEAR and LION. They both have large block sizes, and are based on the Luby-Rackoff construction.  ...  Their underlying components are a hash function and a stream cipher, and they are provably secure in the sense that attacks which find their keys would yield attacks on one or both of the underlying components  ...  Acknowledgment: We would like to thank Mike Roe for making his code available to us for testing, and to the referees for valuable comments.  ... 
doi:10.1007/3-540-60865-6_48 fatcat:teorwwst7bfh5or6yoiiazkhki

On the provable security of BEAR and LION schemes [article]

Lara Maines and Matteo Piva and Anna Rimoldi and Massimiliano Sala
2011 arXiv   pre-print
BEAR, LION and LIONESS are block ciphers presented by Biham and Anderson (1996), inspired by the famous Luby-Rackoff constructions of block ciphers from other cryptographic primitives (1988).  ...  The ciphers proposed by Biham and Anderson are based on one stream cipher and one hash function. Good properties of the primitives ensure good properties of the block cipher.  ...  This work has been supported by TELSY Elettronica e Telecomunicazioni, an Italian company working in Information and Communication Security.  ... 
arXiv:1105.0259v1 fatcat:bucg655ydvdnnjuofei3sp6r4m

BEAST: A fast block cipher for arbitrary blocksizes [chapter]

Stefan Lucks
1996 IFIP Advances in Information and Communication Technology  
BEAST is assembled from cryptographic hash functions and stream ciphers. It is provably secure if these building blocks are secure.  ...  Keywords Block-cipher, Luby-Rackoff, pseudorandom permutation, provably secure, smartcard, remote key P.  ...  Anderson and Biham proposed two block ciphers for flexible but large blocks: BEAR and LION, both similar to Figure 2 with (1 + r)-bit Blocks.  ... 
doi:10.1007/978-0-387-35083-7_13 fatcat:ph6v7juqjbaa3kwoxeag2t7tda

Building Provably Secure Block Ciphers from Cryptographic Hash Functions

Charles F.
2020 International Journal of Computer Applications  
This paper presents a proposal for the construction of provably secure block ciphers based on cryptographic hash functions.  ...  secure.  ...  These constructions typically use both hash functions and stream ciphers as sources of pseudorandomness. BEAR and LION [7] are examples of provably secure block ciphers based on this result.  ... 
doi:10.5120/ijca2020920123 fatcat:4gjvj6mnqba3peyswisirtvwgy

Building Secure Block Ciphers on Generic Attacks Assumptions [chapter]

Jacques Patarin, Yannick Seurin
2009 Lecture Notes in Computer Science  
Up to now, the design of block ciphers has been mainly driven by heuristic arguments, and little theory is known to constitute a good guideline for the development of their architecture.  ...  By opposition, other provably secure symmetric primitives, as for example C [3] and KFC [4], designed using information-theoretic results, are only proved to resist a limited (though significant) range  ...  There have been a number of "provably secure" block ciphers proposals. We review the most prominent of them. BEAR and LION were proposed by Anderson and Biham [2] .  ... 
doi:10.1007/978-3-642-04159-4_5 fatcat:lbxt5nkisza3paoaizw3wpuozu

Ciphers with Arbitrary Finite Domains [chapter]

John Black, Phillip Rogaway
2002 Lecture Notes in Computer Science  
We want to achieve this goal starting from a block cipher (which requires a message space of size N = 2 n , for some n).  ...  We see ciphers with arbitrary domains as a worthwhile primitive in its own right, and as a potentially useful one for making higher-level protocols.  ...  Thanks also to Mihir Bellare, David McGrew, and Silvio Micali for their helpful comments.  ... 
doi:10.1007/3-540-45760-7_9 fatcat:zmhomwbaorhvboa5kxa7nxetiy

On the Construction of Variable-Input-Length Ciphers [chapter]

Mihir Bellare, Phillip Rogaway
1999 Lecture Notes in Computer Science  
This paper introduces the problem of constructing such objects, and provides a practical solution. Our VIL mode of operation make s a v ariable-input-length cipher from any block cipher.  ...  Whereas a block cipher enciphers messages of some one particular length the blocklength, a variable-input-length cipher takes messages of varying and preferably arbitrary lengths.  ...  Phillip Rogaway was supported by NSF CAREER Award CCR-962540, and MICRO grants 97-150 and 98-129, funded by RSA Data Security, Inc., and ORINCON Corporation.  ... 
doi:10.1007/3-540-48519-8_17 fatcat:vie4wr3y7re7hpmeueambarmnm

On the security of remotely keyed encryption [chapter]

Stefan Lucks
1997 Lecture Notes in Computer Science  
Also GRIFFIN is proposed, a fast new block cipher for flexible but large blocks. The RaMaRK scheme and GRIFFIN are provably secure if the underlying building blocks are secure.  ...  Since the attacker can take over the slow device and actually take part in the encryption process, common definitions of the security of block ciphers have to be reconsidered.  ...  and if the blocks are large, GRIFFIN can be expected to run at about the same speed as LION and thus significantly faster than its competitor LIONESS. 4  ... 
doi:10.1007/bfb0052349 fatcat:xprfw4ngcjazbghwsqzk2oy4ri

Fast encryption for set-top technologies

Stefan Lucks, Ruediger Weis, Volker Hilt, Dilip D. Kandlur, Kevin Jeffay, Timothy Roscoe
1998 Multimedia Computing and Networking 1999  
The rst is to evaluate modern block ciphers in a JAVA environment. The second approach is based on recent developments regarding fast Luby Racko ciphers.  ...  In contrast to ciphers such as BEAR, LION, LIONESS, BEAST, and GRIFFIN, conventional block ciphers such as DES, IDEA and Blow sh work on xed but small blocks typically 64 bit.  ...  Like BEAR, LION, LIONESS 3 and BEAST, 28 GRIFFIN is based on the famous Luby-Racko construction. 26 Actually, BEAR, LION, and BEAST are three-round Luby-Racko ciphers, LIONESS is a four-round Luby-Racko  ... 
doi:10.1117/12.333826 fatcat:s7zlgvrrtvhanakpyy753od2we

Recent Developments in the Design of Conventional Cryptographic Algorithms [chapter]

Bart Preneel, Vincent Rijmen, Antoon Bosselaers
1998 Lecture Notes in Computer Science  
This paper examines proposals for three cryptographic primitives: block ciphers, stream ciphers, and hash functions.  ...  It provides an overview of the design principles of a large number of recent proposals, which includes the global structure, the number of rounds, the way of introducing non-linearity and diffusion, and  ...  Two examples of this construction are LION and BEAR [6] , both based on a combination of an additive stream cipher and a hash function (SEAL and SHA-1 are used as examples).  ... 
doi:10.1007/3-540-49248-8_4 fatcat:ifsnr5zxk5fo3gwbex32pgpnhm

Scramble All, Encrypt Small [chapter]

Markus Jakobsson, Julien P. Stern, Moti Yung
1999 Lecture Notes in Computer Science  
In this paper, we propose a new design tool for "block encryption", allowing the en/decryption of arbitrarily long messages, but performing en/decryption on only a single block (e.g., 128 bit block), where  ...  the existence of a secure remotely keyed encryption scheme which performs only one interaction with the smart-card device.  ...  From an engineering perspective, the Bear and Lion designs [AB96] have taught how to encrypt an arbitrary long block given fast stream ciphers.  ... 
doi:10.1007/3-540-48519-8_8 fatcat:fkakuwrnqbhqbpwwfhdjtkiy5q

Simpira v2: A Family of Efficient Permutations Using the AES Round Function [chapter]

Shay Gueron, Nicky Mouha
2016 Lecture Notes in Computer Science  
.: Two Practical and Provably Secure Block Ciphers: BEARS and LION. In: FSE 1996. LNCS, vol. 1039, pp. 113–120. Springer (1996) 3.  ...  Some of the earliest designs are Bear and Lion [2], and Beast [61]. They are higher-level constructions, in the sense that they use hash functions and stream ciphers as underlying components.  ... 
doi:10.1007/978-3-662-53887-6_4 fatcat:3wjksrkgqzgo3pg57fpdq6cffu

The Related-Key Analysis of Feistel Constructions [chapter]

Manuel Barbosa, Pooya Farshim
2015 Lecture Notes in Computer Science  
It is well known that the classical three-and four-round Feistel constructions are provably secure under chosen-plaintext and chosen-ciphertext attacks, respectively.  ...  In this paper we show that, under suitable reuse of round keys, security under related-key attacks can be provably attained.  ...  by national funds, through the Foundation for Science and Technology (FCT).  ... 
doi:10.1007/978-3-662-46706-0_14 fatcat:gg7huflgxvebdns7mcphyuma5u

A Parallelizable Enciphering Mode [chapter]

Shai Halevi, Phillip Rogaway
2004 Lecture Notes in Computer Science  
For a description of EME look ahead to Figures 1 and 2 . We prove that EME is secure, assuming that the underling block cipher is secure.  ...  The proof is in the standard, provable-security tradition: an attack on EME (as a ± prp with domain M = {0, 1} n ∪ {0, 1} 2n ∪ · · · ∪ {0, 1} n 2 ) is shown to imply an attack on the underlying block cipher  ...  Matsumoto, and H. Imai. On the construction of block ciphers provably secure and not relying on any unproved hypotheses.  ... 
doi:10.1007/978-3-540-24660-2_23 fatcat:6dkqqvnmlfh2dmmjsfpdkew3au

Practical, scalable alternative session encryption using one-time pads [article]

Marc W. Abel
2012 arXiv   pre-print
So far as assurance of confidentiality is concerned, today's block ciphers and public key cryptosystems flunk the exam.  ...  In this paper, I discredit many myths concerning one-time pads, discuss practical steps to address perceived shortcomings, and shatter the notion that secure generation, distribution, and use of mammoth  ...  out to build a onetime pad implementation I would want to use; that is, it needed to be convenient, provably secure under certain assumptions, probably secure when used in practice, scalable to thousands  ... 
arXiv:1212.5086v1 fatcat:fsibkstwyjdr7g2yl5wiwciekq
« Previous Showing results 1 — 15 out of 32 results