A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
Message Authentication Codes from Unpredictable Block Ciphers
[chapter]
2009
Lecture Notes in Computer Science
H is a secure message authentication code (MAC) with birthday security, as long as f is unpredictable. (2) PRF Preservation. ...
Thus, our work motivates further research to understand the gap between unpredictability and pseudorandomness of the existing block ciphers, such as AES. ...
One exception here is the design of message authentication codes (MACs): since the resulting primitive only needs to be unpredictable, it would be highly desirable to only assume that the block cipher ...
doi:10.1007/978-3-642-03356-8_16
fatcat:uzgghr6gvrbpdbae4v3vakfapm
Anti-spoofing and open GNSS signal authentication with signal authentication sequences
2010
2010 5th ESA Workshop on Satellite Navigation Technologies and European Workshop on GNSS Signals and Signal Processing (NAVITEC)
The paper proposes a concept of a new authentication scheme based on signal authentication sequences that can be integrated in GNSS. ...
Global Navigation Satellite System (GNSS) signal authentication is a requirement for a number of applications. ...
A direct block cipher encryption of the code is typically a not preferred design option as a time limited code can be obtained with a high gain directional antenna (autocorrelation of a signal sample can ...
doi:10.1109/navitec.2010.5708065
fatcat:aqxztjxbyjdjjlkbpqeyifvyt4
NEW MESSAGE AUTHENTICATION CODE USLNG UNIMODAL CHAOTIC MAPPING
1998
The International Conference on Electrical Engineering
The contents of a message are authenticated by verifying the correctness of message authentication code (MAC), which is computed by the sender and is appended to the message. ...
Message authentication is a procedure established between two ends, (sender and receiver), allows each end to verify the integrity of the received message. ...
At the other end (receiver) the same procedures are applied to reproduce the message authentication code. The receiver compares the calculated message authentication code with the received one. ...
doi:10.21608/iceeng.1998.61102
fatcat:jxkzhgqpozbjhkayn2wrzliby4
Constructing Rate-1 MACs from Related-Key Unpredictable Block Ciphers: PGV Model Revisited
[chapter]
2010
Lecture Notes in Computer Science
In this paper, we investigate the feasibility of constructing rate-1 MACs from related-key unpredictable block ciphers. ...
Almost all current block-cipher-based MACs reduce their security to the pseudorandomness of their underlying block ciphers, except for a few of them to the unpredictability, a strictly weaker security ...
In this paper, we focus on the design of authentication modes, or block-cipherbased Message Authentication Codes. ...
doi:10.1007/978-3-642-13858-4_14
fatcat:3xeqkg4laza3nniqcnzu4jw2zi
Study of a new link layer security scheme in a wireless sensor network
[article]
2012
arXiv
pre-print
In this paper we have proposed a new technique to provide data authentication and privacy in faster, scalable and cost effective way. ...
Security of wireless sensor network (WSN) is always considered a critical issue and has a number of considerations that separate them from traditional wireless sensor network. ...
The essential cryptographic primitives for WSNs are block ciphers, message authentication codes (MACs) and hash functions. ...
arXiv:1209.5428v1
fatcat:nknkvgtixnauxidpi2x5dt6fry
Novel Hardware Implementation of the Cipher Message Authentication Code
2008
Journal of Computer Systems, Networks, and Communications
A new algorithm for producing message authenticating codes (MACs) was recently proposed by NIST. ...
The proposed security scheme incorporates an FIPS approved and secure block cipher algorithm and was standardized by NIST in May, 2005. ...
A message authentication code (MAC) is an authentication tag (also called a checksum) derived by applying an authentication scheme, together with a secret key, to a message. ...
doi:10.1155/2008/923079
fatcat:3jfwwu4i4bcf3ojljgiozsb2iy
Counter Chain: A New Block Cipher Mode of Operation
2015
Journal of Information Processing Systems
The proposed CC mode integrates the cipher block chaining (CBC) block cipher mode of operation with the counter (CTR) mode in a consistent fashion. ...
In this paper, we propose a novel block cipher mode of operation, which is known as the counter chain (CC) mode. ...
Since the last block is a function of all the other plaintext blocks, it is (5) used as a message authentication code (MAC). ...
doi:10.3745/jips.03.0031
fatcat:iyxero4ct5etnbj3le4v6grr6i
Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes
[chapter]
2002
Lecture Notes in Computer Science
Their performance and security scale directly with those of the underlying block cipher function. ...
We also present the XECB message authentication (XECB-MAC) modes that have all the operational properties of the XOR-MAC modes (e.g., fully parallel and pipelined operation, incremental updates, and out-oforder ...
Let the two messages have the same counter ctr; hence, the authentication tag of the new message, w , is obtained from the authentication tag of the previous message, w, by the following formula: w = w ...
doi:10.1007/3-540-45473-x_8
fatcat:e5fu7kvyp5fxzexrbfak73s4pe
Combining message encryption and authentication
2011
Annales UMCS Informatica
The first part of the paper explains the need for combining message encryption and authentication. We begin with the example to emphasize the fact that privacy ‡ does not imply authenticity. ...
We analyze possibilities of choice of underlying encryption and authentication components and their order in a message we also try to answer. What does single-key mode really mean? ...
Code (MAC) constructions based on block ciphers, MAC constructions based on hash functions and a universal hash-based MACs. ...
doi:10.2478/v10065-011-0010-y
fatcat:77kbsjuq2rfv3lpi3be5ha2h64
Secure Message Authentication Against Related-Key Attack
[chapter]
2014
Lecture Notes in Computer Science
We start with the definitions of related-key security of Message Authentication Codes and identify required properties of relatedkey derivation functions for provable security. ...
Next, we consider the construction of variable-input-length MACs from fixed-input-length related-key unpredictable functions. We present simple attacks against XCBC and TMAC. ...
Specifically, Can we achieve an efficient construction of Message Authentication Code, secure against related-key attacks, if we only assume related-key unpredictability from the underlying block ciphers ...
doi:10.1007/978-3-662-43933-3_16
fatcat:yz3xlvuk4zcgvbets5efbfc5sm
A Cryptographic Toolbox for Feedback Control Systems
2020
Modeling, Identification and Control
Code (HMAC), and the stream ciphers from the eSTREAM portfolio, is introduced. ...
By applying message authentication codes (MACs), we assert the authenticity of the data before allowing it to enter the components of the feedback control system. ...
Authentication Contains keyed message authentication codes that accept inputs of arbitrary length and produces a fixed-length output called a tag. ...
doi:10.4173/mic.2020.4.3
fatcat:bev4ikp2x5g77pbi46vazhhlqi
Past, Present and Future of Research in the Information Society
2007
Australian Academic and Research Libraries
Ciphers are alphabetical letters or numbers that are encrypted using some sequential coding process and a key. For this essay, we will refer to both as codes. ...
Cryptanalysis is the art of surreptitiously revealing the contents of coded messages, breaking codes, that were not intended for you as a recipient.. Secondly, there are nomenclators and enciphers. ...
In addition, it's nice if the
cipher is
efficientfault-
tolerant
Most ciphers are either block ciphers or stream ciphers. ...
doi:10.1080/00048623.2007.10721285
fatcat:5kia2etpcbh5zavkxuge4o74uu
An improved DNA Based Security Model using Reduced Cipher Text Technique
2019
International Journal of Computer Network and Information Security
In this paper a new cryptographic security technique is proposed to secure data from un-authorized access. ...
Besides this key, round key selection technique, random series of DNA based coding and modified DNA based coding are followed by unique method of substitutions. ...
in binary coded form is obtained by executing Steps 1-6 from Message Encryption Algorithm as: CT='01000001 01100010 01100100 01110101 01101100' 01110101 01101100' Then, The final form of primary cipher ...
doi:10.5815/ijcnis.2019.07.03
fatcat:273hqsbrn5cblchogtbfoynhdq
FPGA BASED ENCRYPTION DESIGN USING VHDL
2014
International Journal of Research in Engineering and Technology
A transposition cipher (also called permutation cipher) transforms a message by rearranging the positions of the elements of the message without changing the identities of the elements. ...
Notice that plaintext and ciphertext are a pair of respective notions: the former refers to messages input to, and the latter, output from, an encryption algorithm. ...
doi:10.15623/ijret.2014.0322032
fatcat:wszpyljrkzc3rp4vbfp5i4exde
Avalanche Effect in Improperly Initialized CAESAR Candidates
2016
Electronic Proceedings in Theoretical Computer Science
Analyzing 52 candidates of the current CAESAR competition has shown none of them have an avalanche effect in authentication tag strong enough to work properly when partially misconfigured. ...
Authenticated ciphers are often built as various combinations of block ciphers, stream ciphers, message authentication codes, and hash functions. ...
It is long known that cryptographic primitives such as ciphers, hash functions and message authentication codes should produce seemingly random outputs. ...
doi:10.4204/eptcs.233.7
fatcat:fxvrqtoynvdt5ejtjvbbwa4jsm
« Previous
Showing results 1 — 15 out of 1,725 results