Results 211 to 220 of about 23,331 (249)
Some of the next articles are maybe not open access.
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 ...
Yuichi Goto
exaly +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
exaly +2 more sources
Cryptographic Primitives with Hinting Property
Journal of Cryptology, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Navid Alamati, Sikhar Patranabis
openaire +3 more sources
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 +1 more source
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 +1 more source
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 ...
Shingo Hasegawa +4 more
openaire +1 more source
The Black-Box Model for Cryptographic Primitives
Journal of Cryptology, 1998To investigate security properties of a cryptographic primitive it is useful to grasp the idea a class of attacks is based on. Having a model that describes essential features of the primitive without unnecessary details one can concentrate on what makes the primitive resistant to what class of attacks.
Claus-Peter Schnorr, Serge Vaudenay
openaire +2 more sources
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 +1 more source
2020
Abstract This chapter provides a very detailed introduction to cryptography. It first explains the cryptographic basics and introduces the concept of public-key encryption which is based on one-way and trapdoor functions, considering the three major public-key encryption families like integer factorization, discrete logarithm and ...
openaire +1 more source
Abstract This chapter provides a very detailed introduction to cryptography. It first explains the cryptographic basics and introduces the concept of public-key encryption which is based on one-way and trapdoor functions, considering the three major public-key encryption families like integer factorization, discrete logarithm and ...
openaire +1 more source
Verification of a Cryptographic Primitive
ACM Transactions on Programming Languages and Systems, 2015This article presents a full formal machine-checked verification of a C program: the OpenSSL implementation of SHA-256. This is an interactive proof of functional correctness in the Coq proof assistant, using the Verifiable C program logic. Verifiable C is a separation logic for the C language, proved sound with respect to the operational semantics for
openaire +1 more source
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 +1 more source