scholarly journals Classic McEliece on the ARM Cortex-M4

2021 ◽  
pp. 125-148
Author(s):  
Ming-Shing Chen ◽  
Tung Chou
Keyword(s):  
Flash Memory ◽  
Public Key ◽  
Constant Time ◽  
Key Generation ◽  
The Public ◽  
Level 3 ◽  
Level 1 ◽  
Target Platform

This paper presents a constant-time implementation of Classic McEliece for ARM Cortex-M4. Specifically, our target platform is stm32f4-Discovery, a development board on which the amount of SRAM is not even large enough to hold the public key of the smallest parameter sets of Classic McEliece. Fortunately, the flash memory is large enough, so we use it to store the public key. For the level-1 parameter sets mceliece348864 and mceliece348864f, our implementation takes 582 199 cycles for encapsulation and 2 706 681 cycles for decapsulation. Compared to the level-1 parameter set of FrodoKEM, our encapsulation time is more than 80 times faster, and our decapsulation time is more than 17 times faster. For the level-3 parameter sets mceliece460896 and mceliece460896f, our implementation takes 1 081 335 cycles for encapsulation and 6 535 186 cycles for decapsulation. In addition, our implementation is also able to carry out key generation for the level-1 parameter sets and decapsulation for level-5 parameter sets on the board.

scholarly journals Analisis dan Implementasi Algoritma Asimetris Dual Modulus RSA (DM-RSA) pada Aplikasi Chat

2021 ◽  
Vol 5 (4) ◽  
pp. 768-773
Author(s):  
Aminudin ◽  
Ilyas Nuryasin
Keyword(s):  
Prime Numbers ◽  
Public Key ◽  
Generation Process ◽  
Key Generation ◽  
The Public ◽  
Asymmetric Model ◽  
Rsa Algorithm ◽  
Private Key ◽  
Public Keys ◽  
Cryptographic Algorithms

The RSA algorithm is one of the cryptographic algorithms with an asymmetric model where the algorithm has two keys, namely the public key and the private key. However, as time goes on, these algorithms are increasingly exposed to security holes and make this algorithm vulnerable to being hacked by people who do not have authority. The vulnerability stems from the algorithm's public keys (e and n). The strength of the RSA algorithm is based on the difficulty of factoring two prime numbers that are generated during the key generation process, if these values ​​can be known using certain methods, the public key and private key values ​​will be found. Therefore, there are many studies that improvise the RSA algorithm, one of which is the Dual Modulus RSA (DM-RSA) algorithm. The algorithm uses four prime numbers which produce 2 modulus and 4 keys (2 public keys and 2 private keys). From the results of the Kraitchik factorization test, it was found that the DM-RSA algorithm was proven to be more resistant up to 2 times or even more than the standard RSA algorithm. This is evidenced by the fact that the value of n is 24 bits, the RSA algorithm can last up to 63204 ms (1 minute 22 seconds) while the Dual Modulus RSA algorithm lasts up to 248494123 ms (142 minutes 47 seconds).  

Pemetaan Penerapan Standar Audit Berbasis ISA Pada Kantor Akuntan Publik (KAP) di Daerah Istimewa Yogyakarta

MODUS ◽  
2016 ◽  
Vol 28 (1) ◽  
pp. 23
Author(s):  
Caecilia Mesian Anggit Sari ◽  
Rustiana Rustiana
Keyword(s):  
Descriptive Analysis ◽  
International Standards ◽  
Public Accounting ◽  
Accounting Firms ◽  
The Public ◽  
Public Accounting Firms ◽  
Questions And Answers ◽  
Level 3 ◽  
Level 1 ◽  
Business Entities

Abstrak Tujuan dari penelitian ini adalah untuk memetakan penerapan standar auditing berdasarkan International Standards on Auditing (ISA) di Kantor Akuntan Publik (KAP) di Yogyakarta. Penelitian ini merupakan penelitian kualitatif yang menggunakan wawancara mendalam dan kuesioner terbuka untuk mengumpulkan data dari KAP. Sampel penelitian adalah 6 dari 12 KAP di Yogyakarta. Analisis data menggunakan analisis deskriptif dan wawancara intensif dengan para pengambil keputusan dari KAP (manajer atau partner). Hasil penelitian menunjukkan bahwa 50% dari KAP di Yogyakarta berada pada tahap mengetahui (level 1), 17% pada tahap aplikasi (level 3), dan 33% pada tahap pendidikan (level 4). Implikasi dari penelitian ini adalah bahwa KAP di tingkat 1 harus berkontribusi secara aktif untuk mencari informasi tentang audit dari badan usaha kecil berdasarkan ISA yang telah diterbitkan oleh Ikatan Akuntan Indonesia. Pertanyaan dan Jawaban (TJ) buku pegangan berisi prinsip-prinsip audit yang berbasis ISA untuk badan usaha kecil dan menengah. Buku panduan ini dimaksudkan untuk membantu auditor dalam menerapkan standar audit yang relevan secara efektif dan efisien. Kata kunci: International Standards on Auditing (ISA), Kantor Akuntan Publik, Auditor Abstract The aim of this study is to map the application of the auditing standards based on the International Standards on Auditing (ISA) at public accounting firms in Yogyakarta. This study is a qualitative research that uses in-depth interviews and open-questionnaires to collect data from public accounting firms. The research sample consists of 6 of 12 public accounting firms. Data were analyzed by using descriptive analysis and intensive interviews with the decision makers of public accounting firms (managers or partners). The results show that 50% of public accounting firms in Yogyakarta are at the stage of knowing (level 1), 17% at the application stage (level 3), and 33% at the stage of education (level 4). The implication of this study is that the public accounting firms at level 1 should contribute actively to seek information about the audit of small business entities based on ISA which has been issued by the Indonesian Institute of Accountants. The Questions and Answers (TJ) handbook contains the ISA-based audit principles for small and medium business entities. This handbook is intended to assist the auditor in applying relevant audit standards effectively and efficiently. Keywords: International Standard on Auditing (ISA), Public Accounting Firm, Auditor

scholarly journals Modified Key Generation in RSA Algorithm

2019 ◽  
Vol 8 (2) ◽  
pp. 5311-5315
Keyword(s):  
Public Key ◽  
Key Generation ◽  
The Public ◽  
Rsa Algorithm ◽  
Private Key ◽  
Asymmetric Cryptography ◽  
Encryption And Decryption

RSA Algorithm is one of the widely used asymmetric cryptography. But with several conducts of the different studies, factorization attack based on the value of modulo ‘n’ and based on the public key, the value of the private key is vulnerable. With this, the study modified the RSA Algorithm based on modulo and the public key. The modulo transformed into a new value that produced a compound result in the factorization process. At the same time, the public key has been modified by choosing randomly from collected values and transformed to a different value making it a better-hidden private key. The two algorithms compared in terms of factorization, encryption and decryption, and speed. The modification of the RSA Algorithm based on modulo and public key produced a new two-tier scheme in terms of factorization, and encryption and decryption process. The new scheme in the result is resistant to factorization and has a new scheme of private key hiding.

scholarly journals Quantum Key Distribution Based-on Refraction and Polarization Entanglement

2020 ◽  
Vol 8 (6) ◽  
pp. 2911-2918
Keyword(s):  
Quantum Key Distribution ◽  
Secure Communication ◽  
Key Distribution ◽  
Public Key ◽  
Entangled State ◽  
Key Generation ◽  
Secret Key ◽  
The Public ◽  
Encryption And Decryption ◽  
Refraction Factor

Cryptography is the specialty of encoding and decoding messages and exists as extended as the individuals have doubted from one another and need secure correspondence. The traditional techniques for encryption naturally depend on any among public key or secret key approaches. In general, the public key encryption depends on two keys, for example, public key and private key. Since encryption and decryption keys are different, it isn't important to safely distribute a key. In this approach, the difficult of the numerical issues is assumed, not demonstrated. All the security will be easily compromised if proficient factoring algorithms are found. In secret key encryption two clients at first create secret key, which is a long string of arbitrarily selected bits and safely shares between them. At that point the clients can utilize the secret key along with the algorithms to encryption and decryption information. The procedures are complicated and also planned such a way that every bit of output is based on every bit of input. There are two fundamental issues with secret key encryption; first one is that by breaking down the openly known encoding algorithms, it gets simpler to decrypt the message. The subsequent one is that it experiences key-conveyance issue. As a result of the ongoing improvements in quantum processing and quantum data hypothesis, the quantum computers presents genuine difficulties to generally utilized current cryptographic strategy. The improvement of quantum cryptography beat the deficiencies of old style cryptography and achieves these huge accomplishments by using the properties of infinitesimal articles, for example, photon with its polarization and entangled state. In this paper, Polarization by refraction based quantum key distribution (PR-QKD) is proposed for quantum key generation and distribution. The proposed work considers three basis of polarization such as rectilinear (horizontal and vertical), circular (left-circular and right-circular), ellipse (left-ellipse and rightellipse) and refraction factor. This quantum key can be used for secure communication between two users who are spatially separated and also offer intrusion detection ability to detect attackers. The theoretical approach and conceptual results are discussed in this paper.

Optimizing BIKE for the Intel Haswell and ARM Cortex-M4

2021 ◽  
pp. 97-124
Author(s):  
Ming-Shing Chen ◽  
Tung Chou ◽  
Markus Krausz
Keyword(s):  
Quantum Cryptography ◽  
Constant Time ◽  
The Third ◽  
Level 3 ◽  
Key Encapsulation Mechanism ◽  
Standardization Process ◽  
Level 1 ◽  
Post Quantum Cryptography ◽  
Algorithm Level

BIKE is a key encapsulation mechanism that entered the third round of the NIST post-quantum cryptography standardization process. This paper presents two constant-time implementations for BIKE, one tailored for the Intel Haswell and one tailored for the ARM Cortex-M4. Our Haswell implementation is much faster than the avx2 implementation written by the BIKE team: for bikel1, the level-1 parameter set, we achieve a 1.39x speedup for decapsulation (which is the slowest operation) and a 1.33x speedup for the sum of all operations. For bikel3, the level-3 parameter set, we achieve a 1.5x speedup for decapsulation and a 1.46x speedup for the sum of all operations. Our M4 implementation is more than two times faster than the non-constant-time implementation portable written by the BIKE team. The speedups are achieved by both algorithm-level and instruction-level optimizations.

scholarly journals Quantum walk public-key cryptographic system

2015 ◽  
Vol 13 (07) ◽  
pp. 1550050 ◽  
Author(s):  
C. Vlachou ◽  
J. Rodrigues ◽  
P. Mateus ◽  
N. Paunković ◽  
A. Souto
Keyword(s):  
Quantum Mechanics ◽  
Quantum Information Processing ◽  
Quantum Walk ◽  
Quantum Walks ◽  
Public Key ◽  
Key Generation ◽  
The Public ◽  
Cryptographic System ◽  
Encryption Decryption ◽  
Quantum Public Key

Quantum Cryptography is a rapidly developing field of research that benefits from the properties of Quantum Mechanics in performing cryptographic tasks. Quantum walks are a powerful model for quantum computation and very promising for quantum information processing. In this paper, we present a quantum public-key cryptographic system based on quantum walks. In particular, in the proposed protocol the public-key is given by a quantum state generated by performing a quantum walk. We show that the protocol is secure and analyze the complexity of public key generation and encryption/decryption procedures.

scholarly journals Analisis Pola Identifikasi Zero Knowledge Proof Dengan Algoritma Feige Fiat Shamir Menggunakan Blum Blum Shub

2021 ◽  
pp. 7-12
Author(s):  
Cherlina Helena Purnamasari Panjaitan ◽  
Lisda Juliana Pangaribuan
Keyword(s):  
Random Number ◽  
Random Number Generator ◽  
Public Key ◽  
Key Generation ◽  
Number Generator ◽  
Zero Knowledge ◽  
The Public ◽  
Public Keys ◽  
Generation Test ◽  
Zero Knowledge Proof

Protocol Zero Knowledge Proof is one of the protocols in Cryptography that has a fairly good level of security, because it applies the concept of "Truly Zero Knowledge Proof" which is not leaking any information. This protocol is used in the Fiat Shamir, Guillou Quisquater and Schnorr Feige Algorithms, all of which are Cryptographic Algorithms using private keys and public keys. In the Public key, all three of these Algorithms use a random number generator at the values p and q to get the public key. In this study, the author will generate a public key generation test using CPRNG (Cryptographically-secure Pseudo-Random Number Generator) with the Blum Blum Shub algorithm. The test will be conducted on the Fiat Feige Algorithm, the formation of the key will use the Blum Blum Shub Algorithm, but the Identification Protocol still uses the Fiat Shamir Feige Algorithm. The results of this study show the Feige Fiat Algorithm with the Blum Blum Shub Algorithm as the key builder successfully identifies the pattern sent by the signer.

scholarly journals A Constant-time AVX2 Implementation of a Variant of ROLLO

2021 ◽  
pp. 152-174
Author(s):  
Tung Chou ◽  
Jin-Han Liou
Keyword(s):  
Generation Time ◽  
State Of The Art ◽  
The State ◽  
Constant Time ◽  
Key Generation ◽  
Decoding Algorithm ◽  
Key Encapsulation Mechanism ◽  
Level 1

This paper introduces a key encapsulation mechanism ROLLO+ and presents a constant-time AVX2 implementation of it. ROLLO+ is a variant of ROLLO-I targeting IND-CPA security. The main difference between ROLLO+ and ROLLO-I is that the decoding algorithm of ROLLO+ is adapted from the decoding algorithm of ROLLO-I. Our implementation of ROLLO+-I-128, one of the level-1 parameter sets of ROLLO+, takes 851823 Skylake cycles for key generation, 30361 Skylake cycles for encapsulation, and 673666 Skylake cycles for decapsulation. Compared to the state-of-the-art implementation of ROLLO-I-128 by Aguilar-Melchor et al., which is claimed to be constant-time but actually is not, our implementation achieves a 12.9x speedup for key generation, a 10.6x speedup for encapsulation, and a 14.5x speedup for decapsulation. Compared to the state-of-the-art implementation of the level-1 parameter set of BIKE by Chen, Chou, and Krausz, our key generation time is 1.4x as slow, but our encapsulation time is 3.8x as fast, and our decapsulation time is 2.4x as fast.

scholarly journals Parameterized Hardware Accelerators for Lattice-Based Cryptography and Their Application to the HW/SW Co-Design of qTESLA

2020 ◽  
pp. 269-306
Author(s):  
Wen Wang ◽  
Shanquan Tian ◽  
Bernhard Jungk ◽  
Nina Bindel ◽  
Patrick Longa ◽  
...  
Keyword(s):  
Hardware Implementation ◽  
Hardware Accelerators ◽  
Key Generation ◽  
Signature Scheme ◽  
Quantum Lattice ◽  
Level 3 ◽  
Level 1 ◽  
Lattice Based Cryptography ◽  
Embedded Applications ◽  
Provably Secure

This paper presents a set of efficient and parameterized hardware accelerators that target post-quantum lattice-based cryptographic schemes, including a versatile cSHAKE core, a binary-search CDT-based Gaussian sampler, and a pipelined NTT-based polynomial multiplier, among others. Unlike much of prior work, the accelerators are fully open-sourced, are designed to be constant-time, and can be parameterized at compile-time to support different parameters without the need for re-writing the hardware implementation. These flexible, publicly-available accelerators are leveraged to demonstrate the first hardware-software co-design using RISC-V of the post-quantum lattice-based signature scheme qTESLA with provably secure parameters. In particular, this work demonstrates that the NIST’s Round 2 level 1 and level 3 qTESLA variants achieve over a 40-100x speedup for key generation, about a 10x speedup for signing, and about a 16x speedup for verification, compared to the baseline RISC-V software-only implementation. For instance, this corresponds to execution in 7.7, 34.4, and 7.8 milliseconds for key generation, signing, and verification, respectively, for qTESLA’s level 1 parameter set on an Artix-7 FPGA, demonstrating the feasibility of the scheme for embedded applications.

scholarly journals Human–Vehicle Integration in the Code of Practice for Automated Driving

Information ◽  
2020 ◽  
Vol 11 (6) ◽  
pp. 284 ◽  
Author(s):  
Stefan Wolter ◽  
Giancarlo Caccia Dominioni ◽  
Sebastian Hergeth ◽  
Fabio Tango ◽  
Stuart Whitehouse ◽  
...  
Keyword(s):  
Human Factors ◽  
Development Process ◽  
The Body ◽  
Automated Driving ◽  
The Public ◽  
Code Of Practice ◽  
The Past ◽  
Literature Reviews ◽  
Level 3 ◽  
Level 1

The advancement of SAE Level 3 automated driving systems requires best practices to guide the development process. In the past, the Code of Practice for the Design and Evaluation of ADAS served this role for SAE Level 1 and 2 systems. The challenges of Level 3 automation make it necessary to create a new Code of Practice for automated driving (CoP-AD) as part of the public-funded European project L3Pilot. It provides the developer with a comprehensive guideline on how to design and test automated driving functions, with a focus on highway driving and parking. A variety of areas such as Functional Safety, Cybersecurity, Ethics, and finally the Human–Vehicle Integration are part of it. This paper focuses on the latter, the Human Factors aspects addressed in the CoP-AD. The process of gathering the topics for this category is outlined in the body of the paper. Thorough literature reviews and workshops were part of it. A summary is given on the draft content of the CoP-AD Human–Vehicle Integration topics. This includes general Human Factors related guidelines as well as Mode Awareness, Trust, and Misuse. Driver Monitoring is highlighted as well, together with the topic of Controllability and the execution of Customer Clinics. Furthermore, the Training and Variability of Users is included. Finally, the application of the CoP-AD in the development process for Human-Vehicle Integration is illustrated.

Sign in / Sign up

Export Citation Format

Share Document