Results 351 to 360 of about 244,800 (405)
Some of the next articles are maybe not open access.
Journal on Educational Resources in Computing, 2002
This module introduces the concept of cryptography, from the simple Shift Cipher to the more complex Public-Key Cryptography. User will be introduced to some simple classic cryptographic algorithms.
Jeffrey W. Humphries, Martin C. Carlisle
openaire +1 more source
This module introduces the concept of cryptography, from the simple Shift Cipher to the more complex Public-Key Cryptography. User will be introduced to some simple classic cryptographic algorithms.
Jeffrey W. Humphries, Martin C. Carlisle
openaire +1 more source
Proceedings of the 25th ACM Symposium on Access Control Models and Technologies, 2020
Reporting sexual assault and harassment is an important and difficult problem. Since late 2017, it has received increased attention as the viral #MeToo movement has brought about accusations against high-profile individuals and a wider discussion around the prevalence of sexual violence.
openaire +1 more source
Reporting sexual assault and harassment is an important and difficult problem. Since late 2017, it has received increased attention as the viral #MeToo movement has brought about accusations against high-profile individuals and a wider discussion around the prevalence of sexual violence.
openaire +1 more source
IEEE Transactions on Systems, Man, and Cybernetics, 1976
This correspondence comments on cryptography as a vocation or avocation for the systems scientist. A nontrivial challenge is included.
openaire +1 more source
This correspondence comments on cryptography as a vocation or avocation for the systems scientist. A nontrivial challenge is included.
openaire +1 more source
Cryptologia, 1979
It Is proposed that a theory of cryptography covering both substitution and transposition ciphers in a general way be considered so as to not overlook, various characteristics of cipher systems. A cipher consists of correspondence classes and their sequence, the classes being roughly equal to equivalence classes in algebra. Examples are given.
openaire +1 more source
It Is proposed that a theory of cryptography covering both substitution and transposition ciphers in a general way be considered so as to not overlook, various characteristics of cipher systems. A cipher consists of correspondence classes and their sequence, the classes being roughly equal to equivalence classes in algebra. Examples are given.
openaire +1 more source
Information Systems Security, 2007
We've seen where cryptography came from, but where is it going? In this article, I pose a number of unsolved problems: challenges that face us with which we have to deal.
openaire +1 more source
We've seen where cryptography came from, but where is it going? In this article, I pose a number of unsolved problems: challenges that face us with which we have to deal.
openaire +1 more source
ACM SIGACT News, 1986
An idea of Stephen Wiesner [1] is expanded to give a method of public key distribution which is provably secure under the principles of quantum mechanics. It appears that this scheme could actually be implemented in favorable environments.
openaire +1 more source
An idea of Stephen Wiesner [1] is expanded to give a method of public key distribution which is provably secure under the principles of quantum mechanics. It appears that this scheme could actually be implemented in favorable environments.
openaire +1 more source
Handbook of Information and Communication Security, 2019
Christian Monyk
semanticscholar +1 more source
Christian Monyk
semanticscholar +1 more source
2017
Starting with the work of Bellare, Goldreich and Goldwasser [CRYPTO’94], a rich line of work has studied the design of updatable cryptographic primitives. For example, in an updatable signature scheme, it is possible to efficiently transform a signature over a message into a signature over a related message without recomputing a fresh signature.
Prabhanjan Ananth +2 more
openaire +2 more sources
Starting with the work of Bellare, Goldreich and Goldwasser [CRYPTO’94], a rich line of work has studied the design of updatable cryptographic primitives. For example, in an updatable signature scheme, it is possible to efficiently transform a signature over a message into a signature over a related message without recomputing a fresh signature.
Prabhanjan Ananth +2 more
openaire +2 more sources
Quantum cryptography based on Bell's theorem.
Physical Review Letters, 1991A. Ekert
semanticscholar +1 more source
Transitioning organizations to post-quantum cryptography
Nature, 2022David Joseph +9 more
semanticscholar +1 more source