Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "oracle" wg kryterium: Temat


Wyświetlanie 1-4 z 4
Tytuł:
Design of Grover’s Algorithm over 2, 3 and 4- Qubit Systems in Quantum Programming Studio
Autorzy:
Diana, Jingle
Shylu, Sam
Mano, Mano
Ananth, Jude
Selvaraj, Daniel
Powiązania:
https://bibliotekanauki.pl/articles/2055247.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
quantum search
Oracle
Qubit
Hadamard
transform
phase shift
Opis:
In this paper, we design and analyse the Circuit for Grover’s Quantum Search Algorithm on 2, 3 and 4-qubit systems, in terms of number of gates, representation of state vectors and measurement probability for the state vectors. We designed, examined and simulated the quantum circuit on IBM Q platform using Quantum Programming Studio. We present the theoretical implementation of the search algorithm on different qubit systems. We observe that our circuit design for 2 and 4-qubit systems are precise and do not introduce any error while experiencing a small error to our design of 3-qubit quantum system.
Źródło:
International Journal of Electronics and Telecommunications; 2022, 68, 1; 77--82
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Libyan Oracle of Zeus Ammon
Autorzy:
Nodzynska, A.
Powiązania:
https://bibliotekanauki.pl/articles/702595.pdf
Data publikacji:
2006
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
'KING'S ORACLE'
ANCIENT EGYPT
ZEUS AMMON IN SIWA OASIS
Opis:
The oracle procedure employed in the sacral complex of Zeus Ammon in Siwa oasis apparently did not differ from that of the standard Egyptian barque procession. This procession, taking place during the god's symbolic journey from Aghurmi to the Umm Ubayda temple, during which questions were asked and answers received, was open to all pilgrims. Archaeological finds, as well as literary tradition concerning Alexander the Great's visit, suggest the possibility of private consultation: viz., a 'king's oracle' following a different, unknown ritual.
Źródło:
Meander; 2006, 61, 1-2; 113-121
0025-6285
Pojawia się w:
Meander
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An efficient and provably - secure digital signature scheme based on elliptic curve bilinear pairings
Autorzy:
Islam, S. K. H.
Biswas, G. P.
Powiązania:
https://bibliotekanauki.pl/articles/375650.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Elliptic curve cryptography
bilinear pairing
Map-to-point function
digital signature
random oracle model
provably secure
Opis:
We proposed an efficient and secure digital signature scheme using elliptic curve cryptography (ECC) and bilinear pairings in this paper. The proposed scheme employs the general cryptographic hash function (i.e., SHA-1) instead of map-to-point function, because the map-to-point is a cost-intensive operation and it is usually implemented as a probabilistic algorithm. Further, our scheme is computationally efficient as one bilinear paring and three elliptic curve scalar point multiplication operations are executed for signature generation and verification, and thus the scheme requires much lesser computation cost than other related schemes. In addition, in the random oracle model, our scheme is proven to be existential unforgeable against the adaptive chosen message and identity attacks (EUF-CMA) based on a variation of the collusion attack algorithm with ktraitors (k-CAA3) problem.
Źródło:
Theoretical and Applied Informatics; 2012, 24, 2; 109-118
1896-5334
Pojawia się w:
Theoretical and Applied Informatics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Binary Tree Based Forward Secure Signature Scheme in the Random Oracle Model
Autorzy:
Jurkiewicz, Mariusz
Powiązania:
https://bibliotekanauki.pl/articles/2055214.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
forward secure digital signature scheme
bilinear pairing of Type 3
random oracle model
bilinear Diffie-Hellman inversion problem
Opis:
In this paper we construct and consider a new group-based digital signature scheme with evolving secret key, which is built using a bilinear map. This map is an asymmetric pairing of Type 3, and although, for the reason of this paper, it is treated in a completely abstract fashion it ought to be viewed as being actually defined over E(Fqn )[p] × E(Fqnk )[p] → Fqnk [p]. The crucial element of the scheme is the key updater algorithm. With the adoption of pairings and binary trees where a number of leaves is the same as a number of time periods, we are assured that an updated secret key can not be used to recover any of its predecessors. This, in consequence, means that the scheme is forward-secure. To formally justify this assertion, we conduct analysis in fu-cma security model by reducing the security of the scheme to the computational hardness of solving the Weak ℓ-th Bilinear Diffie-Hellman Inversion problem type. We define this problem and explain why it can be treated as a source of security for cryptographic schemes. As for the reduction itself, in general case, it could be possible to make only in the random oracle model.
Źródło:
International Journal of Electronics and Telecommunications; 2021, 67, 4; 717--726
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-4 z 4

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies