Results 231 to 240 of about 380,993 (266)
Some of the next articles are maybe not open access.
2008 7th Computer Information Systems and Industrial Management Applications, 2008
New communications paradigms such as wireless communications for handheld devices have increased requirements for operating speed of relevant security mechanisms, such as encryption for confidentiality, hashing for message integrity and combined hashing and public key encryption for digital signature.
openaire +2 more sources
New communications paradigms such as wireless communications for handheld devices have increased requirements for operating speed of relevant security mechanisms, such as encryption for confidentiality, hashing for message integrity and combined hashing and public key encryption for digital signature.
openaire +2 more sources
A Study of Cryptographic Backdoors in Cryptographic Primitives
Electrical Engineering (ICEE), Iranian Conference on, 2018Since the revelations of Edward Snowden in 2013, the topic of cryptographic backdoors has been popular in both cyber security and popular culture. However, such backdoors were well known in the cryptology community well before 2013. There are a variety of mechanisms for modifying cryptographic primitives so that the resultant modified algorithm is more
openaire +2 more sources
Making Cryptographic Primitives Harder
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2008This paper studies a method for transforming ordinary cryptographic primitives to new harder primitives. Such a method is expected to lead to general schemes that make present cryptosystems secure against the attack of quantum computers. We propose a general technique to construct a new function from an ordinary primitive function f with a help of ...
Hiroyuki Hatanaka +4 more
openaire +2 more sources
Implementing Cryptographic Primitives in the Symbolic Model [PDF]
, 2011 When discussing protocol properties in the symbolic (Dolev-Yao; term-based) model of cryptography, the set of cryptographic primitives is defined by the constructors of the term algebra and by the equational theory on top of it. The set of considered primitives is not easily modifiable during the discussion.
openaire +1 more source
Post-Quantum Cryptographic Primitives
2020The necessity of cyber-security is becoming apparent as we grow increasingly dependent on technology in our daily lives. Cybersecurity allows us to protect our digital information that is stored and transferred via the Internet. Because of this growing dependence, this research project endeavours to design, construct and evaluate new post-quantum ...
openaire +2 more sources
Conventional Cryptographic Primitives
2010Modern network security systems contain cryptographic primitives as an essential building block. In this chapter, we discuss conventional cryptographic primitives, which are also known as symmetric primitives. The term “symmetric” stems from the fact that in order to use conventional primitives, all parties need to share the same set of secret keys ...
openaire +2 more sources
Primitive Constituent Elements of Cryptographic Protocols
2018 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI), 2018Many cryptographic protocols have been proposed, and many studies of them have been done. However, there is no study to identify constituent elements of cryptographic protocols that are elements of the protocols consist of. The constituent elements can be used for the basis of classification of already proposed cryptographic protocols, the basis of ...
Jingchen Yan +3 more
openaire +1 more source
CLAASP: a Cryptographic Library for the Automated Analysis of Symmetric Primitives
IACR Cryptology ePrint Archive, 2023E. Bellini +6 more
semanticscholar +1 more source
On the Homomorphic Computation of Symmetric Cryptographic Primitives
2013We present an analysis on the homomorphic computability of different symmetric cryptographic primitives, with the goal of understanding their characteristics with respect to the homomorphic evaluation according to the BGV scheme. Specifically, we start from the framework presented by Gentry, Halevi and Smart for evaluating AES.
S. Mella, R. Susella
openaire +2 more sources
Cryptographic Applications of Primitive Pythagorean Triples
Cryptologia, 2014Abstract This article presents properties of primitive Pythagorean triples (PPTs) that have potential applications to cryptography. It shows that the six classes of primitive Pythagorean triples can be put into two groups, and autocorrelation and cross-correlation functions of the six classes derived from the gaps between each class type have been ...
Subhash Kak, Monisha Prabhu
openaire +2 more sources