scholarly journals The SQALE of CSIDH: sublinear Vélu quantum-resistant isogeny action with low exponents

Author(s):  
Jorge Chávez-Saab ◽  
Jesús-Javier Chi-Domínguez ◽  
Samuel Jaques ◽  
Francisco Rodríguez-Henríquez

AbstractRecent independent analyses by Bonnetain–Schrottenloher and Peikert in Eurocrypt 2020 significantly reduced the estimated quantum security of the isogeny-based commutative group action key-exchange protocol CSIDH. This paper refines the estimates of a resource-constrained quantum collimation sieve attack to give a precise quantum security to CSIDH. Furthermore, we optimize large CSIDH parameters for performance while still achieving the NIST security levels 1, 2, and 3. Finally, we provide a C-code constant-time implementation of those CSIDH large instantiations using the square-root-complexity Vélu’s formulas recently proposed by Bernstein, De Feo, Leroux and Smith.

We consider non-commutative generalization of CDH problem [1,2] on base of metacyclic group G of type Millera Moreno (minimal non-abelian group). We show that conjugacy problem in this group are intractable. The algorithm of generating (desinging) of common key in non-commutative group with 2 mutually commuting subgroups are constructed by us.


2021 ◽  
Author(s):  
Yue Zheng ◽  
Wenye Liu ◽  
Chongyan Gu ◽  
Chip hong Chang

<p>Peer to Peer (P2P) or direct connection IoT has become increasingly popular owing to its lower latency and higher privacy compared to database-driven or server-based IoT. However, wireless vulnerabilities raise severe concerns on IoT device-to-device communication. This is further aggravated by the challenge to achieve lightweight direct mutual authentication and secure key exchange between IoT peer nodes in P2P IoT applications. Physical unclonable function (PUF) is a key enabler to lightweight, low-power and secure authentication of resource-constrained devices in IoT. Nevertheless, current PUF-enabled authentication protocols, with or without the challenge-response pairs (CRPs) of each of its interlocutors stored in the verifier’s side, are incompatible for P2P IoT scenarios due to the security, storage and computing power limitations of IoT devices. To solve this problem, a new lightweight PUF-based mutual authentication and key-exchange protocol is proposed. It allows two resource-constrained PUF embedded endpoint devices to authenticate each other directly without the need for local storage of CRP or any private secrets, and simultaneously establish the session key for secure data exchange without resorting to public-key algorithm. The proposed protocol is evaluated using the Mao and Boyd logic as well as the automatic security analysis tool ProVerif to corroborate its mutual authenticity, secrecy, and resistance against replay and man-in-the-middle attacks. Using two Avnet Ultra96-V2 boards to emulate the two IoT endpoint devices of a network, a physical prototype system is also constructed to demonstrate and validate the feasibility of the proposed secure P2P connection scheme.</p>


Author(s):  
Wouter Castryck ◽  
Tanja Lange ◽  
Chloe Martindale ◽  
Lorenz Panny ◽  
Joost Renes

2015 ◽  
Vol 18 (3) ◽  
pp. 254-259
Author(s):  
Thuong Tuan Dang ◽  
Tuan Anh Nguyen ◽  
Tran Thi Bao Ngo

In some recent papers, the authors have showed some homomorphic cryptosystems which are particular cases of split exact sequences of groups. By connecting the relation between these ideas to the concept of group action, in this paper, we build a public key exchange protocol based on actions to a group, from its automorphism group and semigroup ℤ under usual multiplication.


2021 ◽  
Author(s):  
Yue Zheng ◽  
Wenye Liu ◽  
Chongyan Gu ◽  
Chip hong Chang

<p>Peer to Peer (P2P) or direct connection IoT has become increasingly popular owing to its lower latency and higher privacy compared to database-driven or server-based IoT. However, wireless vulnerabilities raise severe concerns on IoT device-to-device communication. This is further aggravated by the challenge to achieve lightweight direct mutual authentication and secure key exchange between IoT peer nodes in P2P IoT applications. Physical unclonable function (PUF) is a key enabler to lightweight, low-power and secure authentication of resource-constrained devices in IoT. Nevertheless, current PUF-enabled authentication protocols, with or without the challenge-response pairs (CRPs) of each of its interlocutors stored in the verifier’s side, are incompatible for P2P IoT scenarios due to the security, storage and computing power limitations of IoT devices. To solve this problem, a new lightweight PUF-based mutual authentication and key-exchange protocol is proposed. It allows two resource-constrained PUF embedded endpoint devices to authenticate each other directly without the need for local storage of CRP or any private secrets, and simultaneously establish the session key for secure data exchange without resorting to public-key algorithm. The proposed protocol is evaluated using the Mao and Boyd logic as well as the automatic security analysis tool ProVerif to corroborate its mutual authenticity, secrecy, and resistance against replay and man-in-the-middle attacks. Using two Avnet Ultra96-V2 boards to emulate the two IoT endpoint devices of a network, a physical prototype system is also constructed to demonstrate and validate the feasibility of the proposed secure P2P connection scheme.</p>


2006 ◽  
Vol 1 (2) ◽  
pp. 52-70
Author(s):  
Mohammed A. Tawfiq ◽  
◽  
Sufyan T. Faraj Al-janabi ◽  
Abdul-Karim A. R. Kadhim ◽  
◽  
...  

2010 ◽  
Vol 30 (7) ◽  
pp. 1805-1808
Author(s):  
Shao-feng DENG ◽  
Fan DENG ◽  
Yi-fa LI

Sign in / Sign up

Export Citation Format

Share Document